• Conference Object  

      A catalog of ∃ℝ-complete decision problems about Nash equilibria in multi-player games 

      Bilò, Vittorio; Mavronicolas, Marios (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016)
      [Schaefer and Štefankovic, Theory of Computing Systems, 2015] provided an explicit formulation of ∃ℝ as the class capturing the complexity of deciding the Existential Theory of the Reals, and established that deciding, ...
    • Article  

      Congestion games with player-specific constants 

      Mavronicolas, Marios; Milchtaich, I.; Monien, Burkhard; Tiemann, K. (2007)
      We consider a special case of weighted congestion games with player-specific latency functions where each player uses for each particular resource a fixed (non-decreasing) delay function together with a player-specific ...
    • Article  

      Cost sharing mechanisms for fair pricing of resource usage 

      Mavronicolas, Marios; Panagopoulou, P. N.; Spirakis, Paul G. (2008)
      We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand
    • 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 ...
    • Conference Object  

      How many attackers can selfish defenders catch? 

      Mavronicolas, Marios; Monien, Burkhard; Lesta, Vicky Papadopoulou (2008)
      In a distributed system with attacks and defenses, an economic investment in defense mechanisms aims at increasing the degree of system protection against the attacks. We study such investments in the selfish setting, where ...
    • 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 ...
    • Conference Object  

      Network uncertainty in selfish routing 

      Georgiou, Chryssis; Pavlides, Theophanis; Philippou, Anna (2006)
      We study the problem of selfish routing in the presence of incomplete network information. Our model consists of a number of users who wish to route their traffic on a network of m parallel links with the objective of ...
    • 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, ...
    • Article  

      Non-Walrasian decentralization of the core 

      Koutsougeras, Leonidas C.; Ziros, Nicholas (2011)
      We show that in large finite economies, core allocations can be approximately decentralized as Nash (rather than Walras) equilibrium. We argue that this exercise is an essential complement to asymptotic core equivalence ...
    • Article  

      The structure and complexity of Nash equilibria for a selfish routing game 

      Fotakis, Dimitris A.; Kontogiannis, Spyros C.; Koutsoupias, Elias; Mavronicolas, Marios; Spirakis, Paul G. (2009)
      In this work, we study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links. We assume a collection ...
    • Article  

      Voronoi games on cycle graphs 

      Mavronicolas, Marios; Monien, Burkhard; Lesta, Vicky Papadopoulou; Schoppmann, F. (2008)
      In a Voronoi game, each of a finite number of players chooses a point in some metric space. The utility of a player is the total measure of all points that are closer to him than to any other player, where points equidistant ...
    • Conference Object  

      ∃ℝ-complete decision problems about symmetric nash equilibria in symmetric multi-player games 

      Bilò, Vittorio; Mavronicolas, Marios (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
      We study the complexity of decision problems about symmetric Nash equilibria for symmetric multi-player games. These decision problems concern the existence of a symmetric Nash equilibrium with certain natural properties. ...