Sciweavers

4435 search results - page 66 / 887
» Algorithms, games, and the internet
Sort
View
ATAL
2009
Springer
14 years 4 months ago
Multiagent learning in large anonymous games
In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to ...
Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
WWW
2008
ACM
14 years 10 months ago
Emergence of terminological conventions as an author-searcher coordination game
All information exchange on the Internet ? whether through full text, controlled vocabularies, ontologies, or other mechanisms ? ultimately requires that that an information provi...
David Bodoff, Sheizaf Rafaeli
AAAI
2007
14 years 8 days ago
A New Algorithm for Generating Equilibria in Massive Zero-Sum Games
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
Martin Zinkevich, Michael H. Bowling, Neil Burch
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...