Sciweavers

14084 search results - page 48 / 2817
» A Theory for Game Theories
Sort
View
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
14 years 23 days ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...

Presentation
1554views
15 years 7 months ago
NECTAR : Nash Equillibrium CompuTation Algorithms and Resources
NECTAR : Nash Equillibrium CompuTation Algorithms and Resources, Poster Presentation at Microsoft TechVista Delhi. (October 2007)
Sujit Gujar, Rama Suri Narayanam, Y Narahari
ATAL
2009
Springer
14 years 2 months ago
Multiagent reinforcement learning: algorithm converging to Nash equilibrium in general-sum discounted stochastic games
This paper introduces a multiagent reinforcement learning algorithm that converges with a given accuracy to stationary Nash equilibria in general-sum discounted stochastic games. ...
Natalia Akchurina
ACMACE
2004
ACM
14 years 1 months ago
Audio games: new perspectives on game audio
This paper discusses the design of audio games, a quite new computer game category that originates from games for players with visual impairments, as well as mainstream music game...
Johnny Friberg, Dan Gärdenfors
SAGT
2010
Springer
151views Game Theory» more  SAGT 2010»
13 years 6 months ago
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users
Abstract. We consider network congestion games in which a finite number of non-cooperative users select paths. The aim is to mitigate the inefficiency caused by the selfish users...
Dimitris Fotakis, George Karakostas, Stavros G. Ko...