skip to main content
research-article

Using Priced Options to Solve the Exposure Problem in Sequential Auctions

Authors Info & Claims
Published:01 December 2012Publication History
Skip Abstract Section

Abstract

We propose a priced options model for solving the exposure problem of bidders with valuation synergies participating in a sequence of online auctions. We consider a setting in which complementary-valued items are offered sequentially by different sellers, who have the choice of either selling their item directly or through a priced option. In our model, the seller fixes the exercise price for this option, and then sells it through a first-price auction. We analyze this model from a decision-theoretic perspective and we show, for a setting where the competition is formed by local bidders (which desire a single item), that using options can increase the expected profit for both sides. Furthermore, we derive the equations that provide minimum and maximum bounds between which the bids of the synergy buyer are expected to fall, in order for both sides of the market to have an incentive to use the options mechanism. Next, we perform an experimental analysis of a market in which multiple synergy buyers are active simultaneously. We show that, despite the extra competition, some synergy buyers may benefit, because sellers are forced to set their exercise prices for options at levels which encourage participation of all buyers.

References

  1. Amram, M. and Kulatilaka, N. 1998. Real Options: Managing Strategic Investment in an Uncertain World. Oxford University Press.Google ScholarGoogle Scholar
  2. Bajari, P. and Hortacsu, A. 2003. The winner’s curse, reserve prices, and endogenous entry: Empirical insights from ebay auctions. RAND J. Econ. 34, 155--329.Google ScholarGoogle ScholarCross RefCross Ref
  3. Borgs, C., Chayes, J., Immorlica, N., Jain, K., Etesami, O., and Mahdian, M. 2007. Dynamics of bid optimization in online advertisement auctions. In Proceedings of the 16th International Conference on World Wide Web (WWW’07). ACM Press, New York, 531--540. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Boutilier, C., Goldszmidt, M., and Sabata, B. 1999. Sequential auctions for the allocation of resources with complementarities. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI’99). 523--527. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Cai, K., Niu, J., and Parsons, S. 2007. Using evolutionary game-theory to analyse the performance of trading strategies in a continuous double auction market. In Adaptive Agents and Multi-Agent Systems III. Lecture Notes in Computer Science, vol. 4865. Springer, 44--59. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Cramton, P., Shoham, Y., and Steinberg, R. 2006. Combinatorial Auctions. MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Czajkowski, K., Foster, I., and Kesselman, C. 1999. Resource co-allocation in computational grids. In Proceedings of the 8th IEEE Symposium on High Performance Distributed Computing (HPDC’99). 219--228. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Elyakime, B., Laffont, J.-J., Loisel, P., and Vuong, Q. 1994. First-Price sealed-bid auctions with secret reservation prices. Annales d’Economie et Statistique 34, 115--141.Google ScholarGoogle Scholar
  9. Fatima, S. 2006. A comparative study of sequential and simultaneous auctions. In Proceedings of the 5th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS’06). 1205--1207. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Friedman, E. J. and Parkes, D. C. 2003. Pricing wifi at starbucks: Issues in online mechanism design. In Proceedings of the 4th ACM Conference on Electronic Commerce (EC’03). ACM Press, New York, 240--241. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Gerding, E., Robu, V., Stein, S., Parkes, D., Rogers, A., and Jennings, N. 2011. Online mechanism design for electric vehicle charging. In Proceedings of the 10th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS’11). 811--818. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Gopal, R., Thompson, S., Tung, Y. A., and Whinston, A. B. 2005. Managing risks in multiple online auctions: An options approach. Decis. Sci. 36, 3, 397--425.Google ScholarGoogle ScholarCross RefCross Ref
  13. Greenwald, A. and Boyan, J. 2004. Bidding under uncertainty: Theory and experiments. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence (UAI’04). AAAI Press, 209--216. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Hull, J. C. 2003. Options, Futures, and Other Derivatives 5th Ed. Prentice Hall.Google ScholarGoogle Scholar
  15. Jordan, P. R., Wellman, M. P., and Balakrishnan, G. 2010. Strategy and mechanism lessons from the first ad auctions trading agent competition. In Proceedings of the 11th ACM Conference on Electronic Commerce (EC’10). 287--296. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Juda, A. and Parkes, D. 2009. An options-based solution to the sequential auction problem. Artif. Intell. 173, 7--8, 876--899. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Juda, A. I. and Parkes, D. C. 2006. The sequential auction problem on ebay: An empirical analysis and a solution. In Proceedings of the 7th ACM Conference on Electronic Commerce (EC’06). ACM Press, New York, 180--189. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Klemperer, P. 1999. Auction theory: A guide to the literature. J. Econ. Surv. 13, 3, 227--286.Google ScholarGoogle ScholarCross RefCross Ref
  19. Mous, L., Robu, V., and Poutré, H. L. 2008. Can priced options solve the exposure problem in sequential auctions? ACM SIGEcom Exchang. 7, 2. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Mous, L., Robu, V., and Poutré, H. L. 2010. Using priced options to solve the exposure problem in sequential auctions. In Agent-Mediated Electronic Commerce and Trading Agent Design and Analysis. Lecture Notes in Business Information Processing, vol. 44. Springer, 29--45.Google ScholarGoogle Scholar
  21. Osepayshvili, A., Wellman, M., Reeves, D., and MacKie-Mason, J. 2005. Self-confirming price prediction for bidding in simultaneous ascending auctions. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI’05). 441--449.Google ScholarGoogle Scholar
  22. Parkes, D. C. 2007. Online mechanisms. Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani Eds., Cambridge University Press.Google ScholarGoogle Scholar
  23. Reeves, D., Wellman, M., MacKie-Mason, J. K., and Osepayshvili, A. 2005. Exploring bidding strategies for market-based scheduling. Decis. Support Syst. 39, 1, 67--85. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Robu, V. and La Poutré, H. 2007. Designing bidding strategies in sequential auctions for risk averse agents. In Proceedings of the Conference on Agent-Mediated Electronic Commerce (AMEC’07). Lecture Notes in Business Information Processing, vol. 13. Springer, 76--89.Google ScholarGoogle Scholar
  25. Robu, V. and La Poutré, H. 2010. Designing bidding strategies in sequential auctions for risk averse agents. Multiagent Grid Syst. 6, 5--6, 437--457. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Robu, V., Noot, H., Poutré, H. L., and van Schijndel, W.-J. 2008. An agent platform for auction-based allocation of loads in transportation logistics. In Proceedings of the 7th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS’08). 3--10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Robu, V., La Poutré, H., and Bohte, S. 2009. The complex dynamics of sponsored search markets. In Proceedings of the 4th International Workshop on Agents and Data Mining Interaction (ADMI’09). Lecture Notes in Artificial Intelligence, vol. 5680. Springer, 183--198. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Robu, V., Vetsikas, I. A., Gerding, E. H., and Jennings, N. R. 2010a. Addressing the exposure problem of bidding agents using flexibly priced options. In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI’10). IOS Press, 581--586. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Robu, V., Vetsikas, I. A., Gerding, E. H., and Jennings, N. R. 2010b. Flexibly priced options: A new mechanism for sequential auctions with complementary goods. In Proceedings of the 9th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS’10). Vol. 1. 1485--1486. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Robu, V., Noot, H., La Poutré, J. A., and van Schijndel, W. 2011. A multi-agent platform for auction-based allocation of roads in transportation logistics. Expert Syst. Appl. 38, 4, 3483--3491. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Robu, V., Stein, S., Gerding, E., Parkes, D., Rogers, A., and Jennings, N. 2012. An online mechanism for multi-speed electric vehicle charging. In Lecture Notes of the Institute Computer Sciences, Social Informatics and Telecommunications, vol. 80. Springer, 100--112.Google ScholarGoogle Scholar
  32. Sandholm, T. 2002. Algorithm for optimal winner determination in combinatorial auctions. Artif. Intell. 135, 1--2, 1--54. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Sandholm, T. and Lesser, V. 2001. Leveled commitment contracts and strategic breach. Games Econ. Behav. 35, 1--2, 212--270.Google ScholarGoogle ScholarCross RefCross Ref
  34. Sandholm, T. and Lesser, V. 2002. Leveled-Commitment contracting: A backtracking instrument for multiagent systems. Artif. Intell. Mag. 23, 3, 89--100. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Smith, J. E. and McCardle, K. F. 1999. Options in the real world: Some lessons learned in evaluating oil and gas investments. Oper. Res. 47, 1, 1--15. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Stein, S., Payne, T. R., and Jennings, N. R. 2009. Flexible provisioning of web service workflows. ACM Trans. Internet Technol. 9, 1, 2--45. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. ’t Hoen, P., Robu, V., and La Poutré, J. A. 2005. Decommitment in a competitive multi-agent transportation setting. In Software Agent-Based Applications, Platforms and Development Kits, R. Unland, M. Klusch, and M. Calisti Eds., Whitestein Series in Software Agent Technologies, Springer, 409--431.Google ScholarGoogle Scholar
  38. Vetsikas, I. A. and Jennings, N. R. 2008. Bidding strategies for realistic multi-unit sealed-bid auctions. In Proceedings of the 23rd Conference on Artificial Intelligence (AAAI’08). 182--189. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Wellman, M., Greenwald, A., and Stone, P. 2007. Autonomous Bidding Agents: Strategies and Lessons from the Trading Agent Competition. MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Wellman, M. P., Osepayshvili, A. V., MacKie-Mason, J. K., and Reeves, D. M. 2008. Bidding strategies for simultaneous ascending auctions. B. E. J. Theor. Econ. 8, 1.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Using Priced Options to Solve the Exposure Problem in Sequential Auctions

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Internet Technology
        ACM Transactions on Internet Technology  Volume 12, Issue 2
        December 2012
        94 pages
        ISSN:1533-5399
        EISSN:1557-6051
        DOI:10.1145/2390209
        Issue’s Table of Contents

        Copyright © 2012 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 December 2012
        • Accepted: 1 July 2012
        • Revised: 1 March 2012
        • Received: 1 September 2009
        Published in toit Volume 12, Issue 2

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed
      • Article Metrics

        • Downloads (Last 12 months)1
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!