Optimal Auction Design for Agents with Hard Valuation Problems

As traditional commerce moves on-line more business transactions will be mediated by software agents, and the ability of agent-mediated electronic marketplaces to efficiently allocate resources will be highly dependent on the complexity of the decision problems that agents face; determined in part by the structure of the marketplace, resource characteristics, and the nature of agents' local problems. We compare auction performance for agents that have hard local problems, and uncertain values for goods. Perhaps an agent must solve a hard optimization problem to value a good, or interact with a busy and expensive human expert. Although auction design cannot simplify the valuation problem itself, we show that good auction design can simplify meta-deliberation - providing incentives for the "right" agents to deliberate for the "right" amount of time. Empirical results for a particular cost-benefit model of deliberation show that an ascending-price auction will often support higher revenue and efficiency than other auction designs. The price provides agents with useful information about the value that other agents hold for the good.

[1]  David C. Parkes,et al.  Accounting for Cognitive Costs in On-Line Auction Design , 1998, AMET.

[2]  Y. Shoham,et al.  Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .

[3]  Robert H. Guttman,et al.  Cooperative vs. Competitive Multi-Agent Negotiations in Retail Electronic Commerce , 1998, CIA.

[4]  Ronald M. Harstad,et al.  Modeling Competitive Bidding: A Critical Essay , 1994 .

[5]  Steven A. Lippman,et al.  The Economics of Job Search: A Survey: Part I , 1976 .

[6]  Michael P. Wellman A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems , 1993, J. Artif. Intell. Res..

[7]  Martin Andersson,et al.  Leveled Commitment Contracts with Myopic and Strategic Agents , 1998, AAAI/IAAI.

[8]  Victor R. Lesser,et al.  Issues in Automated Negotiation and Electronic Commerce: Extending the Contract Net Framework , 1997, ICMAS.

[9]  R. McAfee,et al.  Auctions and Bidding , 1986 .

[10]  J. Bakos Reducing buyer search costs: implications for electronic marketplaces , 1997 .

[11]  Hal R. Varian,et al.  Economic Mechanism Design for Computerized Agents , 1995, USENIX Workshop on Electronic Commerce.

[12]  櫻井 祐子,et al.  Hal R. Varian: Economic Mechanism Design for Computerized Agents, the First Usenix Workshop on Electronic Commercr (1995). , 2000 .

[13]  Moshe Tennenholtz,et al.  Mechanism design for resource bounded agents , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[14]  S. Lippman,et al.  THE ECONOMICS OF JOB SEARCH: A SURVEY* , 1976 .

[15]  José M. Vidal,et al.  Agents on the Web: Online Auctions , 1999, IEEE Internet Comput..

[16]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.

[17]  Martin Andersson,et al.  Time-Quality Tradeoffs in Reallocative Negotiation with Combinatorial Contract Types , 1999, AAAI/IAAI.

[18]  T. Sandholm Limitations of the Vickrey Auction in Computational Multiagent Systems , 1996 .

[19]  R. McAfee,et al.  Auctions with entry , 1987 .

[20]  Michael Peters,et al.  Sequential selling mechanisms , 1994 .

[21]  Victor R. Lesser,et al.  Coalitions Among Computationally Bounded Agents , 1997, Artif. Intell..

[22]  H. Van Dyke Parunak,et al.  A systematic market approach to distributed constraint problems , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[23]  Tuomas Sandholm,et al.  An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations , 1993, AAAI.

[24]  David C. Parkes,et al.  iBundle: an efficient ascending price bundle auction , 1999, EC '99.

[25]  Stuart J. Russell,et al.  Principles of Metareasoning , 1989, Artif. Intell..

[26]  Jeffrey K. MacKie-Mason,et al.  Generalized Vickrey Auctions , 1994 .

[27]  Craig Boutilier,et al.  Sequential Auctions for the Allocation of Resources with Complementarities , 1999, IJCAI.

[28]  Victor R. Lesser,et al.  Advantages of a Leveled Commitment Contracting Protocol , 1996, AAAI/IAAI, Vol. 1.

[29]  David C. Parkes,et al.  Iterative Combinatorial Auctions: Theory and Practice , 2000, AAAI/IAAI.

[30]  Axel Ockenfels,et al.  Online Auctions , 2006 .

[31]  Donald B. Hausch,et al.  A common value auction model with endogenous entry and information acquisition , 1993 .

[32]  Jeffrey O. Kephart,et al.  Shopbots and Pricebots , 1999, IJCAI.