Multilateral Deferred-Acceptance Mechanisms

  • Liad Blumrosen
  • Osnat Zohar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9470)


We study the design of multilateral markets, where agents with several different roles engage in trade. We first observe that the modular approach proposed by Dütting et al. [5] for bilateral markets can also be applied in multilateral markets. This gives a general method to design Deferred Acceptance mechanisms in such settings; these mechanisms, defined by Milgrom and Segal [10], are known to satisfy some highly desired properties.

We then show applications of this framework in the context of supply chains. We show how existing mechanisms can be implemented as multilateral Deferred Acceptance mechanisms, and thus exhibit nice practical properties (as group strategy-proofness and equivalence to clock auctions). We use the general framework to design a novel mechanism that improves upon previous mechanisms in terms of social welfare. Our mechanism manages to avoid “trade reduction” in some scenarios, while maintaining the incentive and budget-balance properties.



We thank Moshe Babaioff for helpful discussions. Liad Blumrosen was supported by the Israel Science Foundation (grant No. 230/10).


  1. 1.
    Babaioff, M., Nisan, N.: Concurrent auctions across the supply chain. J. Artif. Intell. Res. 21, 595–629 (2004)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Babaioff, M., Walsh, W.E.: Incentive-compatible, budget-balanced, yet highly efficient auctions for supply chain formation. Decision Sup. Sys. 39(1), 123–149 (2005)CrossRefGoogle Scholar
  3. 3.
    Cripps, M.W., Swinkels, J.M.: Efficiency of large double auctions. Econometrica 74(1), 47–92 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Dütting, P., Gkatzelis, V., Roughgarden, T.: The performance of deferred-acceptance auctions. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 187–204. ACM (2014)Google Scholar
  5. 5.
    Dütting, P., Roughgarden, T., Talgam-Cohen, I.: Modularity and greed in double auctions. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 241–258. ACM (2014)Google Scholar
  6. 6.
    Lehmann, D., Oćallaghan, L.I., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. J. ACM (JACM) 49(5), 577–602 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Lubin, B., Parkes, D.C.: Approximate strategyproofness. Curr. Sci. 103(9), 1021–1032 (2012)Google Scholar
  8. 8.
    McAfee, R.P.: A dominant strategy double auction. J. Econ. Theor. 56(2), 434–450 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Mehta, A., Roughgarden, T., Sundararajan, M.: Beyond moulin mechanisms. In: 8th ACM Conference on Electronic Commerce, EC 2007, pp. 1–10 (2007)Google Scholar
  10. 10.
    Milgrom, P., Segal, I.: Deferred-acceptance auctions and radio spectrum reallocation. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 185–186. ACM (2014)Google Scholar
  11. 11.
    Moulin, H.: Incremental cost sharing: characterization by coalition strategy-proofness. Soc. Choice Welfare 16(2), 279–320 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. J. Econ. Theor. 29(2), 265–281 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Rustichini, A., Satterthwaite, M.A., Williams, S.R.: Convergence to efficiency in a simple market with incomplete information. Econometrica 62(5), 1041–63 (1994)CrossRefzbMATHGoogle Scholar
  14. 14.
    Satterthwaite, M.A., Williams, S.R.: The optimality of a simple market mechanism. Econometrica 70(5), 1841–1863 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Singer, Y.: Budget feasible mechanisms. In: The 51st Annual Symposium on Foundations of Computer Science, FOCS 2010, pp. 765–774 (2010)Google Scholar
  16. 16.
    Vorobeychik, Y., Kiekintveld, C., Wellman, M.P.: Empirical mechanism design: methods, with application to a supply-chain scenario. In: ACM Conference on Electronic Commerce, pp. 306–315 (2006)Google Scholar
  17. 17.
    Walsh, W., Wellman, M., Ygge, F.: Combinatorial auctions for supply chain formation. In: Proceedings of the ACM Conference on Electronic Commerce, pp. 260–269 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Open Access This chapter is distributed under the terms of the Creative Commons Attribution Noncommercial License, which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.

Authors and Affiliations

  1. 1.Department of EconomicsThe Hebrew UniversityJerusalemIsrael
  2. 2.Bank of IsraelJerusalemIsrael

Personalised recommendations