Sciweavers

45 search results - page 6 / 9
» On the Complexity of Equilibria Problems in Angel-Daemon Gam...
Sort
View
CSJM
2006
81views more  CSJM 2006»
13 years 7 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
ATAL
2007
Springer
14 years 1 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
14 years 29 days ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
13 years 8 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
AAAI
2000
13 years 8 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