Technical Note: \cal Q-Learning
Machine Learning
Rules of encounter: designing conventions for automated negotiation among computers
Rules of encounter: designing conventions for automated negotiation among computers
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
ALIFE Proceedings of the sixth international conference on Artificial life
Flexible double auctions for electionic commerce: theory and implementation
Decision Support Systems - Special issue on economics of electronic commerce
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Economic mechanism design for computerized agents
WOEC'95 Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1
Exploring bidding strategies for market-based scheduling
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
An evolutionary game-theoretic comparison of two double-auction market designs
AAMAS'04 Proceedings of the 6th AAMAS international conference on Agent-Mediated Electronic Commerce: theories for and Engineering of Distributed Mechanisms and Systems
IEEE Transactions on Evolutionary Computation
Evolutionary mechanism design: a review
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
We introduce a method for strategy acquisition in nonzero-sum n-player games and empirically validate it by applying it to a well-known benchmark problem in this domain, namely, the double-auction market. Many existing approaches to strategy acquisition focus on attempting to find strategies that are robust in the sense that they are good all-round performers against all-comers. We argue that, in many economic and multiagent scenarios, the robustness criterion is inappropriate; in contrast, our method focuses on searching for strategies that are likely to be adopted by participating agents, which is formalized as the size of a strategy's basins of attraction under the replicator dynamics.