Sciweavers

1599 search results - page 99 / 320
» Algorithms for Parity Games
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
15 years 5 months ago
Approximate Nash Equilibria under Stability Conditions
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
Maria-Florina Balcan, Mark Braverman
DAGSTUHL
2007
15 years 7 months ago
Equilibrium Tracing in Bimatrix Games
Abstract. We analyze the relations of the van den Elzen-Talman algorithm, the Lemke-Howson algorithm and the global Newton method introduced by Govindan and Wilson. It is known tha...
Anne Balthasar
AAAI
2011
14 years 6 months ago
Learning in Repeated Games with Minimal Information: The Effects of Learning Bias
Automated agents for electricity markets, social networks, and other distributed networks must repeatedly interact with other intelligent agents, often without observing associate...
Jacob W. Crandall, Asad Ahmed, Michael A. Goodrich
WADS
2007
Springer
77views Algorithms» more  WADS 2007»
16 years 16 days ago
The Stackelberg Minimum Spanning Tree Game
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gw...
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
15 years 12 months ago
Event-driven learning classifier systems for online soccer games
This paper reports on the application of classifier systems to the acquisition of decision-making algorithms for agents in online soccer games. The objective of this research is t...
Yuji Sato, Ryutaro Kanno