Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference23 articles.
1. Archer, A., Tardos, E.: Frugal path mechanisms. ACM Trans. Algorithms 3(1) (2007)
2. Braverman, M., Chen, J., Kannan, S.: Optimal provision-after-wait in healthcare. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science (ITCS ’14), pp 541–542 (2014)
3. Cavallo, R.: Efficiency and redistribution in dynamic mechanism design. In: Proceedings of the 9th ACM, Conference on Electronic Commerce (EC ’08), pp 220–229 (2008)
4. Chakravarty, S., Kaplan, T.R.: Manna from heaven or forty years in the desert Optimal allocation without transfer payments. Social Science Research Network (2006). doi: 10.2139/ssrn.939389
5. Cole, R., Gkatzelis, V., Goel, G.: Mechanism design for fair division: allocating divisible items without payments. In: Proceedings of the 14th ACM, Conference on Electronic Commerce (EC ’13), pp 251–268 (2013)