119 search results - page 21 / 24 » The complexity of pure Nash equilibria |
84
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we introduce a novel flow representation for finite games in strategic form. This representation allows us to develop a canonical direct sum decomposition of an arbi...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we examine the behavior of bidding agents that are in direct competition with the other participants in an auction setting. Thus the agents are not simply trying to...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
108
click to vote
ESA
2010
Springer
14 years 10 months ago
2010
Springer
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...