Chain: A Dynamic Double Auction Framework for Matching Patient Agents
Journal of Artificial Intelligence Research(2011)
摘要
In this paper we present and evaluate a general framework for the design of truthful auctions for matching agents in a dynamic, two-sided market. A single commodity, such as a resource or a task, is bought and sold by multiple buyers and sellers that arrive and depart over time. Our algorithm, Chain, provides the first framework that allows a truthful dynamic double auction (DA) to be constructed from a truthful, single-period (i.e. static) double-auction rule. The pricing and matching method of the Chain construction is unique amongst dynamic-auction rules that adopt the same building block. We examine experimentally the allocative efficiency of Chain when instantiated on various single-period rules, including the canonical McAfee double-auction rule. For a baseline we also consider non-truthful double auctions populated with zero-intelligence plus"-style learning agents. Chain-based auctions perform well in comparison with other schemes, especially as arrival intensity falls and agent valuations become more volatile.
更多查看译文
关键词
CHAIN construction,truthful auction,truthful dynamic double auction,canonical McAfee double-auction rule,double-auction rule,dynamic-auction rule,general framework,matching method,non-truthful double auction,various single-period rule,dynamic double auction framework,patient agent
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要