Browsing by Subject "Nash equilibrium"
Now showing items 112 of 12

Conference Object
A catalog of ∃ℝcomplete decision problems about Nash equilibria in multiplayer games
(Schloss Dagstuhl LeibnizZentrum 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 playerspecific constants
(2007)We consider a special case of weighted congestion games with playerspecific latency functions where each player uses for each particular resource a fixed (nondecreasing) delay function together with a playerspecific ...

Article
Cost sharing mechanisms for fair pricing of resource usage
(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
(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?
(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
(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 nondecreasing, nonconstant ...

Conference Object
Network uncertainty in selfish routing
(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
(2008)In this work, we introduce and study a new, potentially rich model for selfish routing over noncooperative networks, as an interesting hybridization of the two prevailing such models, namely the KPmodel [E. Koutsoupias, ...

Article
NonWalrasian decentralization of the core
(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
(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
(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 multiplayer games
(Schloss Dagstuhl LeibnizZentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)We study the complexity of decision problems about symmetric Nash equilibria for symmetric multiplayer games. These decision problems concern the existence of a symmetric Nash equilibrium with certain natural properties. ...