{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:27:13Z","timestamp":1768559233350,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540462422","type":"print"},{"value":"9783540462439","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11888727_6","type":"book-chapter","created":{"date-parts":[[2006,11,22]],"date-time":"2006-11-22T02:54:45Z","timestamp":1164164085000},"page":"71-84","source":"Crossref","is-referenced-by-count":2,"title":["Achieving Allocatively-Efficient and Strongly Budget-Balanced Mechanisms in the Network Flow Domain for Bounded-Rational Agents"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Bachrach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey S.","family":"Rosenschein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.2307\/1911219","volume":"45","author":"J. Green","year":"1977","unstructured":"Green, J., Laffont, J.J.: Characterization of satisfactory mechanisms for the revelation of preferences for public goods. Econometrica\u00a045(2), 427\u2013438 (1977)","journal-title":"Econometrica"},{"key":"6_CR2","unstructured":"Hurwicz, L.: On the existence of allocation systems whose manipulative Nash equilibria are pareto-optimal. In: 3rd World Congress of the Econometric Society (unpublished, 1975)"},{"key":"6_CR3","unstructured":"Conitzer, V., Sandholm, T.: Universal voting protocol tweaks to make manipulation hard. In: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI), Acapulco, Mexico, pp. 781\u2013788 (2003)"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J.J. Bartholdi","year":"1989","unstructured":"Bartholdi, J.J.: The computational difficulty of manipulating an election. Social Choice and Welfare\u00a06(3), 227\u2013241 (1989)","journal-title":"Social Choice and Welfare"},{"key":"6_CR5","unstructured":"Conitzer, V., Sandholm, T.: Computing shapley values, manipulating value division schemes, and checking core membership in multi-issue domains. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI), San Jose, California, USA, pp. 219\u2013225 (2004)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Shapley, L.S.: A value for n-person games. Contributions to the Theory of Games, 31\u201340 (1953)","DOI":"10.1515\/9781400881970-018"},{"issue":"1-2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0004-3702(97)00030-1","volume":"94","author":"T. Sandholm","year":"1997","unstructured":"Sandholm, T., Lesser, V.R.: Coalitions among computationally bounded agents. Artificial Intelligence\u00a094(1-2), 99\u2013137 (1997)","journal-title":"Artificial Intelligence"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Sanghvi, S., Parkes, D.C.: Hard-to-manipulate combinatorial auctions. Technical report, Harvard University (2004)","DOI":"10.7551\/mitpress\/9780262033428.003.0003"},{"key":"6_CR9","unstructured":"Lavi, R., Mu\u2019alem, A., Nisan, N.: Towards a characterization of truthful combinatorial auctions (extended abstract). In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2003)"}],"container-title":["Lecture Notes in Computer Science","Agent-Mediated Electronic Commerce. Designing Trading Agents and Mechanisms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11888727_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T08:43:54Z","timestamp":1555922634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11888727_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462422","9783540462439"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11888727_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}