Sciweavers

178 search results - page 15 / 36
» Impersonation Strategies in Auctions
Sort
View
AMEC
2003
Springer
15 years 11 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
2009
Springer
16 years 20 days ago
Stronger CDA strategies through empirical game-theoretic analysis and reinforcement learning
We present a general methodology to automate the search for equilibrium strategies in games derived from computational experimentation. Our approach interleaves empirical game-the...
L. Julian Schvartzman, Michael P. Wellman
ATAL
2006
Springer
15 years 9 months ago
A novel method for automatic strategy acquisition in N-player non-zero-sum games
We present a novel method for automatically acquiring strategies for the double auction by combining evolutionary optimization together with a principled game-theoretic analysis. ...
Steve Phelps, Marek Marcinkiewicz, Simon Parsons
ATAL
2004
Springer
15 years 11 months ago
Towards Robust Multi-Agent Systems: Handling Communication Exceptions in Double Auctions
This paper addresses an important question in the development of multi-agent systems—how can we create robust systems out of the often unreliable agents and infrastructures we ca...
Simon Parsons, Mark Klein