• Conference Object  

      Designing mechanisms for reliable internet-based computing 

      Fernández Anta, Antonio; Georgiou, Chryssis; Mosteiro, Miguel A. (2008)
      In this work, using a game-theoretic approach, cost-sensitive mechanisms that lead to reliable Internet-based computing are designed. In particular, we consider Internet-based master-worker computations, where a master ...
    • Conference Object  

      Discrete-time stochastic minimax control of partially observable systems 

      Charalambous, Charalambos D. (2001)
      This paper presents a sample path optimization technique, as an alternative to the ensample average in formulating and solving stochastic minimax dynamic games. The stochastic games are nonlinear, discrete-time, and partially ...
    • Article  

      Extending argumentation to make good decisions 

      Dimopoulos, Yannis; Moraïtis, Pavlos; Amgoud, L. (2009)
      Argumentation has been acknowledged as a powerful mechanism for automated decision making. In this context several recent works have studied the problem of accommodating preference information in argumentation. The majority ...
    • Article  

      Facets of the fully mixed Nash equilibrium conjecture 

      Feldmann, R.; Mavronicolas, Marios; Pieris, Andreas (2010)
      In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture, henceforth abbreviated as the FMNE Conjecture, in selfish routing for the special case of n identical users over two ...
    • Article  

      Finite-dimensional nonlinear output feedback dynamic games and bounds for sector nonlinearities 

      Charalambous, Charalambos D.; Elliott, R. J. (1999)
      In general, nonlinear output feedback dynamic games are infinite-dimensional. This paper treats a class of minimax games when the nonlinearities enter the dynamics of the unobservable states. An information state approach ...
    • Article  

      Finite-time disturbance attenuation control problem for singularly perturbed discrete-time systems 

      Abdelrahman, M. A.; Naidu, D. S.; Charalambous, Charalambos D.; Moore, K. L. (1998)
      In this paper we consider the problem of finite-time H∞-optimal control of linear, singularly perturbed, discrete-time systems. The problem is addressed from the game theoretic approach. This leads to a singularly perturbed, ...
    • Article  

      Frequency domain and dynamic game methods for actuator/sensor selection in systems with sector nonlinearities 

      Demetriou, M. A.; Charalambous, Charalambos D. (2001)
      The purpose of this note is to provide a method for placing actuators and sensors in systems with nonlinear dynamics wherein the choices for actuator and sensor locations are such that the resulting system is rendered ...
    • Book  

      Game theory in communication networks: cooperative resolution of interactive networking scenarios 

      Antoniou, Josephina; Pitsillides, Andreas (CRC Press, 2013)
      "Focusing on heterogeneous networks, this book addresses important resource management and security issues found in networks and uses theoretical tools to model them. Although it explores network design and management from ...
    • Conference Object  

      A game theory-based approach to reducing interference in dense deployments of home wireless networks 

      Antoniou, Josephina; Pitsillides, Andreas; Libman, L. (2011)
      Urban residential areas are becoming increasingly dense with more and more home networks being deployed in close proximity. The paper considers a dense urban residential area where each house/unit has its own wireless ...
    • Article  

      How many attackers can selfish defenders catch? 

      Mavronicolas, Marios; Monien, Burkhard; Lesta, Vicky Papadopoulou (2013)
      In a distributed system with attacks and defenses, both attackers and defenders are self-interested entities. We assume a reward-sharing scheme among interdependent defenders
    • Article  

      Information markets for product attributes: A game theoretic, dual pricing mechanism 

      Markopoulos, Panos M.; Aron, Ravi; Ungar, Lyle H. (2010)
      We model the availability of information about product attributes in Internet-based markets, focusing on a phenomenon that we term as information deficit (availability of less than perfect information about product attributes) ...
    • Conference Object  

      Is online product information availability driven by quality or differentiation? 

      Markopoulos, Panos M.; Aron, Ravi; Ungar, Lyle H. (Affiliation: The Wharton School, University of Pennsylvania, Philadelphia, PA, United StatesCorrespondence Address: Markopoulos, P. M.The Wharton School, University of Pennsylvania, Philadelphia, PA, United Statesemail: markopou@wharton.upenn.edu, 2005)
      We present a game theoretic model for the availability of product information in Internet markets, where buyers can search for multiple products in parallel. We use a multiple-circle variation of Salop's "unit circle" model ...
    • Article  

      Minimax games for stochastic systems subject to relative entropy uncertainty: Applications to SDEs on Hilbert spaces 

      Ahmed, N. U.; Charalambous, Charalambos D. (2007)
      In this paper, we consider minimax games for stochastic uncertain systems with the pay-off being a nonlinear functional of the uncertain measure where the uncertainty is measured in terms of relative entropy between the ...
    • Article  

      Minimizing expectation plus variance 

      Mavronicolas, Marios; Monien, Burkhard (2012)
      We consider strategic games in which each player seeks a mixed strategy to minimize her cost evaluated by a concave valuation V (mapping probability distributions to reals)
    • Article  

      Moritz Schlick's evolutionary game theory 

      Vrahimis, Andreas (University of Illinois Press, 2023)
      The early Schlick developed an evolutionary biological account of play. He contrasted play with work. Where work encompasses all activity that is undertaken for the sake of some practical outcome, play renders what was ...
    • Article  

      Nash equilibria in discrete routing games with convex latency functions 

      Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard; Rode, M. (2004)
      We study Nash equilibria in a discrete routing game that combines features of the two most famous models for non-cooperative routing, the KP model [16] and the Wardrop model [27]. In our model, users share parallel links. ...
    • Article  

      Nash equilibria in discrete routing games with convex latency functions 

      Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard; Rode, M. (2008)
      In a discrete routing game, each of n selfish users employs a mixed strategy to ship her (unsplittable) traffic over m parallel links. The (expected) latency on a link is determined by an arbitrary non-decreasing, non-constant ...
    • Article  

      Network game with attacker and protector entities 

      Mavronicolas, Marios; Lesta, Vicky Papadopoulou; Philippou, Anna; Spirakis, Paul G. (2005)
      Consider an information network with harmful procedures called attackers (e.g., viruses)
    • Article  

      A network game with attackers and a defender 

      Mavronicolas, Marios; Lesta, Vicky Papadopoulou; Philippou, Anna; Spirakis, Paul G. (2008)
      Consider an information network with threats called attackers
    • Article  

      A new model for selfish routing 

      Lücking, T.; Mavronicolas, Marios; Monien, Burkhard; Rode, M. (2008)
      In this work, we introduce and study a new, potentially rich model for selfish routing over non-cooperative networks, as an interesting hybridization of the two prevailing such models, namely the KPmodel [E. Koutsoupias, ...