{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:40:55Z","timestamp":1725572455753},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_18","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T12:57:16Z","timestamp":1368622636000},"page":"209-220","source":"Crossref","is-referenced-by-count":1,"title":["Truthful Many-to-Many Assignment with Private Weights"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Escoffier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fanny","family":"Pascual","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Spanjaard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.tcs.2006.07.057","volume":"369","author":"E. Angel","year":"2006","unstructured":"Angel, E., Bampis, E., Pascual, F.: Truthful algorithms for scheduling selfish tasks on parallel machines. Theoretical Computer Science\u00a0369(1-3), 157\u2013168 (2006)","journal-title":"Theoretical Computer Science"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1002\/net.3230130404","volume":"13","author":"D. Avis","year":"1983","unstructured":"Avis, D.: A survey of heuristics for the weighted matching problem. Networks\u00a013, 475\u2013493 (1983)","journal-title":"Networks"},{"key":"18_CR3","unstructured":"Black, D.: The Theory of Committees and Elections. Cambridge University Press (1958)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Ghosh, A.: Truthful assignment without money. In: ACM Conference on Electronic Commerce, pp. 325\u2013334 (2010)","DOI":"10.1145\/1807342.1807394"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00453-009-9386-0","volume":"58","author":"N. Garg","year":"2010","unstructured":"Garg, N., Kavitha, T., Kumar, A., Mehlhorn, K., Mestre, J.: Assigning papers to referees. Algorithmica\u00a058(1), 119\u2013136 (2010)","journal-title":"Algorithmica"},{"key":"18_CR6","unstructured":"Golden, B., Perny, P.: Infinite order Lorenz dominance for fair multiagent optimization. In: AAMAS, pp. 383\u2013390 (2010)"},{"key":"18_CR7","unstructured":"Gross, O.: The bottleneck assignment problem. Technical Report P-1630, The Rand Corporation, Sta. Monica, CA (1959)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-24829-0_14","volume-title":"Algorithmic Game Theory","author":"E. Koutsoupias","year":"2011","unstructured":"Koutsoupias, E.: Scheduling without payments. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol.\u00a06982, pp. 143\u2013153. Springer, Heidelberg (2011)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-15781-3_4","volume-title":"Algorithms \u2013 ESA 2010","author":"P. Krysta","year":"2010","unstructured":"Krysta, P., Ventre, C.: Combinatorial auctions with verification are tractable. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol.\u00a06347, pp. 39\u201350. Springer, Heidelberg (2010)"},{"key":"18_CR10","unstructured":"Lema\u00eetre, M., Verfaillie, G., Fargier, H., Lang, J., Bataille, N., Lachiver, J.M.: Equitable allocation of earth observing satellites resources. In: Proc of 5th ONERA-DLR Aerospace Symposium, ODAS 2003 (2003)"},{"key":"18_CR11","unstructured":"Lesca, J., Perny, P.: LP solvable models for multiagent fair allocation problems. In: ECAI, pp. 393\u2013398 (2010)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/11841036_48","volume-title":"Algorithms \u2013 ESA 2006","author":"J. Mestre","year":"2006","unstructured":"Mestre, J.: Greedy in approximation algorithms. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 528\u2013539. Springer, Heidelberg (2006)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design (extended abstract). In: STOC, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Penna, P., Ventre, C.: Optimal collusion-resistant mechanisms with verification. In: ACM Conference on Electronic Commerce, pp. 147\u2013156 (2009)","DOI":"10.1145\/1566374.1566396"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Schummer, J., Vohra, R.V.: Mechanism Design without Money. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic Game Theory, pp. 243\u2013266. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.012"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, 8\u201337 (1961)","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T01:58:05Z","timestamp":1557712685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}