Sciweavers

170 search results - page 17 / 34
» Parallel Computation of Nash Equilibria in N-Player Games
Sort
View
UAI
2000
13 years 9 months ago
Fast Planning in Stochastic Games
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...
Michael J. Kearns, Yishay Mansour, Satinder P. Sin...
CORR
2008
Springer
172views Education» more  CORR 2008»
13 years 7 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
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
SIROCCO
2004
13 years 9 months ago
Existence of Nash Equilibria in Selfish Routing Problems
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
Alessandro Ferrante, Mimmo Parente
ATAL
2008
Springer
13 years 9 months ago
Approximating mixed Nash equilibria using smooth fictitious play in simultaneous auctions
We investigate equilibrium strategies for bidding agents that participate in multiple, simultaneous second-price auctions with perfect substitutes. For this setting, previous rese...
Enrico H. Gerding, Zinovi Rabinovich, Andrew Byde,...