294 search results - page 5 / 59 » The complexity of computing a Nash equilibrium |
UAI
2000
14 years 11 months ago
2000
Multi-agent games are becoming an increasingly prevalent formalism for the study of electronic commerceand auctions. The speed at which transactions can take place and the growing...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
85
Voted
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
We investigate equilibrium strategies for bidding agents that participate in multiple, simultaneous second-price auctions with perfect substitutes. For this setting, previous rese...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
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...