{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:32:34Z","timestamp":1742963554137,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642044274"},{"type":"electronic","value":"9783642044281"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04428-1_11","type":"book-chapter","created":{"date-parts":[[2009,10,9]],"date-time":"2009-10-09T12:05:58Z","timestamp":1255089958000},"page":"120-131","source":"Crossref","is-referenced-by-count":10,"title":["On Multi-dimensional Envy-Free Mechanisms"],"prefix":"10.1007","author":[{"given":"Ahuva","family":"Mu\u2019alem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Amar, L., Mu\u2019alem, A., Stoesser, J.: On the importance of migration for fairness in online grid markets. In: GRID (2008)","DOI":"10.1109\/GRID.2008.4662784"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: FOCS, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Balcan, N., Blum, A., Mansour, Y.: Item pricing for revenue maximization. In: EC (2008)","DOI":"10.1145\/1386790.1386802"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Blumrosen, L., Nisan, N.: On the computational power of iterative auctions I: Demand queries. In: EC (2005)","DOI":"10.1145\/1064009.1064013"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Cheung, M., Swamy, C.: Approximation algorithms for single-minded envy-free profit-maximization problems with limited supply. In: FOCS (2008)","DOI":"10.1109\/FOCS.2008.15"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-87744-8_25","volume-title":"Algorithms - ESA 2008","author":"G. Christodoulou","year":"2008","unstructured":"Christodoulou, G., Koutsoupias, E., Vidali, A.: A characterization of 2-player mechanisms for scheduling. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol.\u00a05193, pp. 297\u2013307. Springer, Heidelberg (2008)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Dhangwatnotai, P., Dobzinski, S., Dughmi, S., Roughgarden, T.: Truthful approximation schemes for single-parameter agents. In: FOCS (2008)","DOI":"10.1109\/FOCS.2008.71"},{"key":"11_CR8","first-page":"45","volume":"7","author":"D. Foley","year":"1967","unstructured":"Foley, D.: Resource allocation and the public sector. Yale Economics Essays\u00a07, 45\u201398 (1967)","journal-title":"Yale Economics Essays"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/11917496_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A. Grigoriev","year":"2006","unstructured":"Grigoriev, A., van Loon, J., Sitters, R., Uetz, M.: How to sell a graph: Guidelines for graph retailers. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 125\u2013136. Springer, Heidelberg (2006)"},{"key":"11_CR10","unstructured":"Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: SODA, pp. 1164\u20131173 (2005)"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s003550100149","volume":"19","author":"C.-J. Haake","year":"2002","unstructured":"Haake, C.-J., Raith, M.G., Su, F.E.: Bidding for envy-freeness: A procedural approach to n-player fair-division problems. Social Choice and Welfare\u00a019(4), 723\u2013749 (2002)","journal-title":"Social Choice and Welfare"},{"key":"11_CR12","unstructured":"Hartline, J., Ieong, S., Schapira, M., Zohar, A.: Private communication (2008)"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.3982\/ECTA7168","volume":"77","author":"B. Heydenreich","year":"2009","unstructured":"Heydenreich, B., Mller, R., Uetz, M.J., Vohra, R.: Characterization of revenue equivalence. Econometrica\u00a077(1), 307\u2013316 (2009)","journal-title":"Econometrica"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput.\u00a017(3), 539\u2013551 (1988)","journal-title":"SIAM J. Comput."},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-540-74456-6_41","volume-title":"Mathematical Foundations of Computer Science 2007","author":"E. Koutsoupias","year":"2007","unstructured":"Koutsoupias, E., Vidali, A.: A lower bound of 1+phi for truthful scheduling mechanisms. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 454\u2013464. Springer, Heidelberg (2007)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. In: FOCS (1987)","DOI":"10.1109\/SFCS.1987.8"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: EC (2004)","DOI":"10.1145\/988772.988792"},{"key":"11_CR18","unstructured":"Mishra, D., Talman, D.: Characterization of walrasian equilibria of the assignment model, working paper (2007)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behavior\u00a035, 166\u2013196 (2001)","journal-title":"Games and Economic Behavior"},{"volume-title":"Algorithmic Game Theory","year":"2007","key":"11_CR20","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.jet.2004.10.007","volume":"129","author":"N. Nisan","year":"2006","unstructured":"Nisan, N., Segal, I.: The communication requirements of efficient allocations and supporting prices. Journal of Economic Theory\u00a0129(1), 192\u2013224 (2006)","journal-title":"Journal of Economic Theory"},{"key":"11_CR22","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications (1998)"},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01769864","volume":"13","author":"M. Quinzii","year":"1984","unstructured":"Quinzii, M.: Core and competitive equilibria with indivisibilities. International Journal of Game Theory\u00a013(1), 41\u201360 (1984)","journal-title":"International Journal of Game Theory"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-4068(87)90007-3","volume":"16","author":"J.C. Rochet","year":"1987","unstructured":"Rochet, J.C.: A necessary and sufficient condition for rationalizability in a quasi-linear context. Journal of Mathematical Economics\u00a016, 191\u2013200 (1987)","journal-title":"Journal of Mathematical Economics"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04428-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T10:03:10Z","timestamp":1602324190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04428-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044274","9783642044281"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04428-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}