Skip to main content

Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship

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

Abstract

We study the truthful facility assignment problem, where a set of agents with private most-preferred points on a metric space are assigned to facilities that lie on the metric space, under capacity constraints on the facilities. The goal is to produce such an assignment that minimizes the social cost, i.e., the total distance between the most-preferred points of the agents and their corresponding facilities in the assignment, under the constraint of truthfulness, which ensures that agents do not misreport their most-preferred points.

We propose a resource augmentation framework, where a truthful mechanism is evaluated by its worst-case performance on an instance with enhanced facility capacities against the optimal mechanism on the same instance with the original capacities. We study a well-known mechanism, Serial Dictatorship, and provide an exact analysis of its performance. Among other results, we prove that Serial Dictatorship has approximation ratio \(g/(g-2)\) when the capacities are multiplied by any integer \(g \ge 3\). Our results suggest that even a limited augmentation of the resources can have wondrous effects on the performance of the mechanism and in particular, the approximation ratio goes to 1 as the augmentation factor becomes large. We complement our results with bounds on the approximation ratio of Random Serial Dictatorship, the randomized version of Serial Dictatorship, when there is no resource augmentation.

Ioannis Caragiannis was partially supported by a Caratheodory research grant E.114 from the University of Patras. Aris Filos-Ratsikas was partially supported by the COST Action IC1205 on “Computational Social Choice” and by the ERC Advanced Grant 321171 (ALGAME). Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, and Kristoffer Arnsfelt Hansen acknowledge support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61361136003) for the Sino-Danish Center for the Theory of Interactive Computation and from the Center for Research in Foundations of Electronic Markets (CFEM), supported by the Danish Strategic Research Council.

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 EPUB and 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

Notes

  1. 1.

    With the exception of the bi-criteria result in [3].

  2. 2.

    We point out here that statement 1 and a weaker version of statement 2 in Theorem 1 can be obtained as corollaries of results in the literature for the online transportation problem (see [11, 12]). However, we will prove the three statements of Theorem 1 as part of our more general framework.

References

  1. Abdulkadiroğlu, A., Sönmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica 66, 689–701 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Anshelevich, E., Das, S.: Matching, cardinal utility, and social welfare. ACM SIGECom Exch. 9(1), 4 (2010)

    Article  Google Scholar 

  3. Anshelevich, E., Sekar, S.: Blind, greedy, random: algorithms for matching and clustering using only ordinal information. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI), pp. 390–396 (2016)

    Google Scholar 

  4. Aziz, H., Chen, J., Filos-Ratsikas, A., Mackenzie, S., Mattei, N.: Egalitarianism of random assignment mechanisms. In: Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2016)

    Google Scholar 

  5. Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. J. Econ. Theory 100, 295–328 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. Theory Comput. Syst. 50(4), 589–610 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Emek, Y., Langner, T., Wattenhofer, R.: The price of matching with metric preferences. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 459–470. Springer, Heidelberg (2015). doi:10.1007/978-3-662-48350-3_39

    Chapter  Google Scholar 

  8. Filos-Ratsikas, A., Frederiksen, S.K.S., Zhang, J.: Social welfare in one-sided matchings: random priority and beyond. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 1–12. Springer, Heidelberg (2014). doi:10.1007/978-3-662-44803-8_1

    Google Scholar 

  9. Guo, M., Conitzer, V.: Strategy-proof allocation of multiple items between two agents without payments or priors. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 881–888 (2010)

    Google Scholar 

  10. Hylland, A., Zeckhauser, R.: The efficient allocation of individuals to positions. J. Polit. Econ. 87(2), 293–314 (1979)

    Article  MATH  Google Scholar 

  11. Kalyanasundaram, B., Pruhs, K.: Online weighted matching. J. Algorithms 14(3), 478–488 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kalyanasundaram, B., Pruhs, K.: The online transportation problem. SIAM J. Discrete Math. 13(3), 370–383 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617–643 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Koutsoupias, E.: Weak adversaries for the k-server problem. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS), pp. 444–449 (1999)

    Google Scholar 

  15. Krysta, P., Manlove, D., Rastegari, B., Zhang, J.: Size versus truthfulness in the house allocation problem. In: Proceedings of the 15th ACM Conference on Economics and Computation (EC), pp. 453–470 (2014)

    Google Scholar 

  16. Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. ACM Trans. Econ. Comput. 1(4), Article No. 18 (2013)

    Google Scholar 

  17. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)

    Article  MathSciNet  Google Scholar 

  18. Svensson, L.-G.: Strategy-proof allocation of indivisble goods. Soc. Choice Welfare 16(4), 557–567 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  19. Young, N.: The k-server dual and loose competitiveness for paging. Algorithmica 11(6), 525–541 (1994)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aris Filos-Ratsikas .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag GmbH Germany

About this paper

Cite this paper

Caragiannis, I., Filos-Ratsikas, A., Frederiksen, S.K.S., Hansen, K.A., Tan, Z. (2016). Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship. In: Cai, Y., Vetta, A. (eds) Web and Internet Economics. WINE 2016. Lecture Notes in Computer Science(), vol 10123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-54110-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-54110-4_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-54109-8

  • Online ISBN: 978-3-662-54110-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics