224 search results - page 12 / 45 » On Nash-Equilibria of Approximation-Stable Games |
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
UAI
2004
13 years 8 months ago
2004
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
UAI
2000
13 years 8 months ago
2000
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...