Sciweavers

206 search results - page 18 / 42
» Computing Equilibria in Anonymous Games
Sort
View
IPL
2006
92views more  IPL 2006»
13 years 6 months ago
A constructive approach to sequential Nash equilibria
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
René Vestergaard
ADHOCNOW
2005
Springer
14 years 8 days ago
Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks
Pilu Crescenzi, Miriam Di Ianni, Alessandro Lazzon...
ICALP
2004
Springer
14 years 3 days ago
Nash Equilibria in Discrete Routing Games with Convex Latency Functions
Martin Gairing, Thomas Lücking, Marios Mavron...
CORR
2008
Springer
172views Education» more  CORR 2008»
13 years 6 months ago
Altruism in Congestion Games
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...
Martin Hoefer, Alexander Skopalik
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 6 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen