Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3435))

Included in the following conference series:

Abstract

Current auctions often expose bidding agents to two difficult, yet common, problems. First, bidding agents often have the opportunity to participate in successive auctions selling the same good, with no dominant bidding strategy in any single auction. Second, bidding agents often need to acquire a bundle of goods by bidding in multiple auctions, again with no dominant bidding strategy in any single auction. This paper introduces an options-based infrastructure that respects the autonomy of individual sellers but still enables bidders to utilize a dominant, truthful strategy across multiple auctions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anthony, P., Jennings, N.R.: Developing a bidding agent for multiple heterogeneous auctions. ACM Trans. On Internet Technology (2003)

    Google Scholar 

  2. Boutilier, C., Goldszmidt, M., Sabata, B.: Sequential auctions for the allocation of resources with complementarities. In: Proc. 16th International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 527–534 (1999)

    Google Scholar 

  3. Byde, A., Preist, C., Jennings, N.R.: Decision procedures for multiple auctions. In: Proc. 1st Int. Joint Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2002) (2002)

    Google Scholar 

  4. Bykowsky, M.M., Cull, R.J., Ledyard, J.O.: Mutually destructive bidding: The FCC auction design problem. J. of Regulatory Economics (2000)

    Google Scholar 

  5. Dash, R.K., Jennings, N.R., Parkes, D.C.: Computational-mechanism design: A call to arms. IEEE Intelligent Systems, 40–47 (November 2003). Special Issue on Agents and Markets

    Google Scholar 

  6. Dixit, A.K., Pindyck, R.S.: Investment under Uncertainty. Princeton University Press, Princeton (1994)

    Google Scholar 

  7. Reeves, D.M., Wellman, M.P., MacKie-Mason, J.K., Osepayshvili, A.: Exploring bidding strategies for market-based scheduling. In: Decision Support Systems (2004); Special issue dedicated to the Fourth ACM Conference on Electronic Commerce (EC 2003)

    Google Scholar 

  8. Greenwald, A., Kephart, J.O.: Shopbots and pricebots. In: Proc. 16th International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 506–511 (1999)

    Google Scholar 

  9. Hajiaghayi, M.T., Kleinberg, R., Parkes, D.C.: Adaptive limited-supply online auctions. In: Proc. ACM Conf. on Electronic Commerce, pp. 71–80 (2004)

    Google Scholar 

  10. Iwasaki, A., Yokoo, M., Terada, K.: A robust open ascending-price multi-unit auction protocol against false-name bids. In: Decision Support Systems (2004); Special issue dedicated to the Fourth ACM Conference on Electronic Commerce (EC 2003)

    Google Scholar 

  11. Lavi, R., Nisan, N.: Competitive analysis of incentive compatible on-line auctions. In: Proc. 2nd ACM Conf. on Electronic Commerce (EC 2000) (2000)

    Google Scholar 

  12. Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auctions. In: Proc. 2nd ACM Conf. on Electronic Commerce (EC 2000) (2000)

    Google Scholar 

  13. Ng, C., Parkes, D.C., Seltzer, M.: Strategyproof Computing: Systems infrastructures for self-interested parties. In: 1st Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA (June 2003)

    Google Scholar 

  14. Parkes, D.C.: Five AI challenges in Strategyproof Computing. In: Proc. IJCAI 2003 Workshop on Autonomic Computing, Aculpulco, Mexico (2003)

    Google Scholar 

  15. Parkes, D.C., Singh, S.: An MDP-based approach to Online Mechanism Design. In: Proc. 17th Annual Conf. on Neural Information Processing Systems (NIPS 2003) (2003)

    Google Scholar 

  16. Porter, R., Ronen, A., Shoham, Y., Tennenholtz, M.: Mechanism design with execution uncertainty. In: Proc. 18th Conf. on Uncertainty in Artificial Intelligence (UAI 2002) (2002)

    Google Scholar 

  17. Rothkopf, M.H., Engelbrecht-Wiggans, R.: Innovative approaches to competitive mineral leasing. Resources and Energy 14, 233–248 (1992)

    Article  Google Scholar 

  18. Rothkopf, M.H., Pekeč, A., Harstad, R.M.: Computationally manageable combinatorial auctions. Management Science 44(8), 1131–1147 (1998)

    Article  MATH  Google Scholar 

  19. Sandholm, T., Lesser, V.: Leveled commitment contracts and strategic breach. Games and Economic Behavior 35, 212–270 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  20. Wellman, M.P., Wurman, P.R.: Market-aware agents for a multiagent world. In: Boman, M., Van de Velde, W. (eds.) MAAMAW 1997. LNCS, vol. 1237, pp. 115–125. Springer, Heidelberg (1997)

    Google Scholar 

  21. Yokoo, M., Sakurai, Y., Matsubara, S.: The effect of false-name bids in combinatorial auctions: New Fraud in Internet Auctions. Games and Economic Behavior 46(1), 174–188 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Juda, A.I., Parkes, D.C. (2006). An Options-Based Method to Solve the Composability Problem in Sequential Auctions. In: Faratin, P., Rodríguez-Aguilar, J.A. (eds) Agent-Mediated Electronic Commerce VI. Theories for and Engineering of Distributed Mechanisms and Systems. AMEC 2004. Lecture Notes in Computer Science(), vol 3435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575726_4

Download citation

  • DOI: https://doi.org/10.1007/11575726_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29737-6

  • Online ISBN: 978-3-540-33166-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics