Skip to main content

Fixed Price Approximability of the Optimal Gain from Trade

  • Conference paper
  • First Online:
Web and Internet Economics (WINE 2017)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10660))

Included in the following conference series:

Abstract

Bilateral trade is a fundamental economic scenario comprising a strategically acting buyer and seller (holding an item), each holding valuations for the item, drawn from publicly known distributions. It was recently shown that the only mechanisms that are simultaneously dominant strategy incentive compatible, strongly budget balanced, and ex-post individually rational, are fixed price mechanisms, i.e., mechanisms that are parametrised by a price p, and trade occurs if and only if the valuation of the buyer is at least p and the valuation of the seller is at most p. The gain from trade (GFT) is the increase in welfare that results from applying a mechanism. We study the GFT achievable by fixed price mechanisms. We explore this question for both the bilateral trade setting and a double auction setting where there are multiple i.i.d. unit demand buyers and sellers. We first identify a fixed price mechanism that achieves a GFT of at least 2 / r times the optimum, where r is the probability that the seller’s valuation does not exceed that of the buyer’s valuation. This extends a previous result by McAfee. Subsequently, we improve this approximation factor in an asymptotic sense, by showing that a more sophisticated rule for setting the fixed price results in a GFT within a factor \(O(\log (1/r))\) of the optimum. This is asymptotically the best approximation factor possible. For the double auction setting, we present a fixed price mechanism that achieves for all \(\epsilon > 0\) a gain from trade of at least \((1-\epsilon )\) times the optimum with probability \(1 - 2/e^{\#T \epsilon ^2 /2}\), where \(\#T\) is the expected number of trades of the mechanism. This can be interpreted as a “large market” result: Full efficiency is achieved in the limit, as the market gets thicker.

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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

Notes

  1. 1.

    More generally, we may define the notion of a mechanism such that more complex pricing schemes are possible, but our definition suffices for the mechanisms that we will define later in this paper.

References

  1. Blumrosen, L., Dobzinski, S.: Reallocation mechanisms. In: Proceedings of the 15th ACM Conference on Economics and Computation (EC), p. 617. ACM (2014)

    Google Scholar 

  2. Blumrosen, L., Dobzinski, S.: (Almost) Efficient Mechanisms for Bilateral Trading. ArXiv/CoRR, abs/1604.04876 (2016)

    Google Scholar 

  3. Blumrosen, L., Mizrahi, Y.: Approximating gains-from-trade in bilateral trading. In: Cai, Y., Vetta, A. (eds.) WINE 2016. LNCS, vol. 10123, pp. 400–413. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-54110-4_28

    Chapter  Google Scholar 

  4. Brustle, J., Cai, Y., Wu, F., Zhao, M.: Approximating gains from trade in two-sided markets via simple mechanisms. In: Proceedings of the 2017 ACM Conference on Economics and Computation (EC), pp. 589–590 (2017)

    Google Scholar 

  5. Colini-Baldeschi, R., de Keijzer, B., Leonardi, S., Turchetta, S.: Approximately efficient double auctions with strong budget balance. In: Proceedings of the 27th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1424–1443. SIAM (2016)

    Google Scholar 

  6. Colini-Baldeschi, R., Goldberg, P.W., de Keijzer, B., Leonardi, S., Turchetta, S., Roughgarden, T.: Approximately efficient two-sided combinatorial auctions. In: Proceedings of the 18th ACM Conference on Economics and Computation (EC), pp. 591–608. ACM (2017)

    Google Scholar 

  7. Deng, X., Goldberg, P.W., Tang, B., Zhang, J.: Revenue maximization in a Bayesian double auction market. Theor. Comput. Sci. 539, 1–12 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  8. Deshmukh, K., Goldberg, A.V., Hartline, J.D., Karlin, A.R.: Truthful and competitive double auctions. In: Möhring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 361–373. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45749-6_34

    Chapter  Google Scholar 

  9. Feldman, M., Gonen, R.: Markets with strategic multi-minded mediators. ArXiv/ CoRR, abs/1603.08717 (2016)

    Google Scholar 

  10. Feldman, M., Gonen, R.: Online truthful mechanisms for multi-sided markets. CoRR, abs/1604.04859 (2016)

    Google Scholar 

  11. Gerstgrasser, M., Goldberg, P.W., Koutsoupias, E.: Revenue maximization for market intermediation with correlated priors. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 273–285. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53354-3_22

    Chapter  Google Scholar 

  12. Giannakopoulos, Y., Koutsoupias, E., Lazos, P.: Online Market Intermediation. ArXiv/CoRR, abs/1703.09279 (2017)

    Google Scholar 

  13. Gresik, T.A., Satterthwaite, M.A.: The rate at which a simple market converges to efficiency as the number of traders increases: an asymptotic result for optimal trading mechanisms. J. Econ. Theory 48(1), 304–332 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  14. McAfee, P.R.: A dominant strategy double auction. J. Econ. Theory 56(2), 434–450 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  15. McAfee, R.P.: The gains from trade under fixed price mechanisms. Appl. Econ. Res. Bull. 1, 1–10 (2008)

    Google Scholar 

  16. Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. J. Econ. Theory 29(2), 265–281 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  17. Rustichini, A., Satterthwaite, M.A., Williams, S.R.: Convergence to efficiency in a simple market with incomplete information. Econometrica 62(5), 1041–1063 (1994)

    Article  MATH  Google Scholar 

  18. Satterthwaite, M.A., Williams, S.R.: The optimality of a simple market mechanism. Econometrica 70(5), 1841–1863 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  19. Segal-Halevi, E., Hassidim, A., Aumann, Y.: A random-sampling double-auction mechanism. ArXiv/CoRR, abs/1604.06210 (2016)

    Google Scholar 

  20. Segal-Halevi, E., Hassidim, A., Aumann, Y.: SBBA: a strongly-budget-balanced double-auction mechanism. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 260–272. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53354-3_21

    Chapter  Google Scholar 

Download references

Acknowledgements

We thank Tim Roughgarden for helpful discussions at the early stages of this work.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Riccardo Colini-Baldeschi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Colini-Baldeschi, R., Goldberg, P., de Keijzer, B., Leonardi, S., Turchetta, S. (2017). Fixed Price Approximability of the Optimal Gain from Trade. In: R. Devanur, N., Lu, P. (eds) Web and Internet Economics. WINE 2017. Lecture Notes in Computer Science(), vol 10660. Springer, Cham. https://doi.org/10.1007/978-3-319-71924-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71924-5_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71923-8

  • Online ISBN: 978-3-319-71924-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics