Sciweavers

294 search results - page 55 / 59
» The complexity of computing a Nash equilibrium
Sort
View
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
15 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...
SBP
2012
Springer
13 years 5 months ago
The Impact of Network Structure on the Perturbation Dynamics of a Multi-agent Economic Model
Complex adaptive systems (CAS) modeling has become a common tool to study the behavioral dynamics of agents in a broad range of disciplines from ecology to economics. Many modelers...
Marshall A. Kuypers, Walter E. Beyeler, Robert J. ...
ATAL
2007
Springer
15 years 3 months ago
Normative system games
We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic ...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
79
Voted
AAAI
2007
15 years 12 hour 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
PODS
2004
ACM
98views Database» more  PODS 2004»
15 years 9 months ago
Processing First-Order Queries under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
Alan Nash, Bertram Ludäscher