Sciweavers

206 search results - page 28 / 42
» Computing Equilibria in Anonymous Games
Sort
View
SPAA
2006
ACM
14 years 22 days ago
Network design with weighted players
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
Ho-Lin Chen, Tim Roughgarden
CIG
2005
IEEE
14 years 12 days ago
Adapting Reinforcement Learning for Computer Games: Using Group Utility Functions
AbstractGroup utility functions are an extension of the common team utility function for providing multiple agents with a common reinforcement learning signal for learning cooperat...
Jay Bradley, Gillian Hayes
CORR
2008
Springer
102views Education» more  CORR 2008»
13 years 6 months ago
Game Theory with Costly Computation
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
Joseph Y. Halpern, Rafael Pass
ICS
2010
Tsinghua U.
14 years 4 months ago
Game Theory with Costly Computation: Formulation and Application to Protocol Security
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...
Joseph Y. Halpern, Rafael Pass
AAAI
2010
13 years 7 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman