Developing adaptive auction mechanisms
ACM SIGecom Exchanges
Characterizing effective auction mechanisms: insights from the 2007 TAC market design competition
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Agent-human interactions in the continuous double auction
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Resource allocation in decentralised computational systems: an evolutionary market-based approach
Autonomous Agents and Multi-Agent Systems
What the 2007 TAC Market Design Game tells us about effective auction mechanisms
Autonomous Agents and Multi-Agent Systems
Competition between markets and the CAT Tournament: Guest editors' introduction to the special issue
Electronic Commerce Research and Applications
An assessment of strategies for choosing between competitive marketplaces
Electronic Commerce Research and Applications
TATM: a trust mechanism for social traders in double auctions
AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence
Market niching in multi-attribute computational resource allocation systems
Proceedings of the 13th International Conference on Electronic Commerce
Maximizing matching in double-sided auctions
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Socio-economic vision graph generation and handover in distributed smart camera networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
Auctions, when well designed, result in desirable economic out-comes and have been widely used in solving real-world resource allocation problems, and in structuring stock or futures exchanges. The field of auction mechanism design has drawn much attention in recent years from economists, mathematicians, and computer scientists. In traditional auction theory, auctions are viewed as games of incomplete information and traditional analytic methods from game theory have been successfully applied to some simple types of auctions. However, the assumption of prior common knowledge in the incomplete information approach may not hold in some auctions, and computing analytic solutions may be infeasible in other auctions. Both of these problems hold in the case of continuous double auctions.