Sciweavers

4 search results - page 1 / 1
» Computational analysis of perfect-information position aucti...
Sort
View
26
Voted
SIGECOM
2009
ACM
84views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
Computational analysis of perfect-information position auctions
David Robert Martin Thompson, Kevin Leyton-Brown
CG
2006
Springer
14 years 7 days ago
A Retrograde Approximation Algorithm for One-Player Can't Stop
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
James Glenn, Haw-ren Fang, Clyde P. Kruskal
ACG
2009
Springer
14 years 3 months ago
Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K
Retrograde analysis is a tool for reconstructing a game tree starting from its leaves; with these techniques one can solve specific subsets of a complex game, achieving optimal pl...
Paolo Ciancarini, Gian Piero Favini
AAAI
2010
13 years 10 months ago
Progress on Agent Coordination with Cooperative Auctions
Auctions are promising decentralized methods for teams of agents to allocate and re-allocate tasks among themselves in dynamic, partially known and time-constrained domains with p...
Sven Koenig, Pinar Keskinocak, Craig A. Tovey