Sciweavers

10 search results - page 1 / 2
» Heuristic search for identical payoff Bayesian games
Sort
View
ATAL
2010
Springer
13 years 6 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
ATAL
2008
Springer
13 years 7 months ago
Searching for approximate equilibria in empirical games
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
Patrick R. Jordan, Yevgeniy Vorobeychik, Michael P...
ATAL
2004
Springer
13 years 10 months ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
AMEC
2003
Springer
13 years 10 months ago
Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
William E. Walsh, David C. Parkes, Rajarshi Das
ATAL
2004
Springer
13 years 10 months ago
Multi-Agent Service Description/Discovery Games
Agent description and discovery (ADD) is a critical infrastructure for open multi-agent services. As multi-agent systems grow larger and more diverse, it becomes harder to locate ...
Jun Wang, Les Gasser