Sciweavers

156 search results - page 17 / 32
» Homotopy Methods to Compute Equilibria in Game Theory
Sort
View
UAI
2000
13 years 9 months ago
Fast Planning in Stochastic Games
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
Michael J. Kearns, Yishay Mansour, Satinder P. Sin...
AAAI
2000
13 years 9 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
ANOR
2008
127views more  ANOR 2008»
13 years 7 months ago
Computer science and decision theory
This paper reviews applications in computer science that decision theorists have addressed for years, discusses the requirements posed by these applications that place great strai...
Fred S. Roberts
ECAI
2006
Springer
13 years 11 months ago
Cheating Is Not Playing: Methodological Issues of Computational Game Theory
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
Bruno Beaufils, Philippe Mathieu