{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:11:06Z","timestamp":1725541866203},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108402"},{"type":"electronic","value":"9783642108419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10841-9_25","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T17:14:44Z","timestamp":1260292484000},"page":"268-279","source":"Crossref","is-referenced-by-count":3,"title":["Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Emek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Feldman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Feldman, M., Nisan, N.: Combinatorial Agency. In: ACM Conference on Electronic Commerce (2006)","DOI":"10.1145\/1134707.1134710"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/11944874_32","volume-title":"Internet and Network Economics","author":"M. Babaioff","year":"2006","unstructured":"Babaioff, M., Feldman, M., Nisan, N.: Mixed Strategies in Combinatorial Agency. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 353\u2013364. Springer, Heidelberg (2006)"},{"key":"25_CR3","unstructured":"Emek, Y., Heitner, I.: Combinatorial agency: the observable-action model (2006) (manuscript)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Shenker, S.: Distributed Algorithmic Mechanism Design: Recent Results and Future Directions. In: Proceedings of the International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (2002)","DOI":"10.1145\/570810.570812"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Feldman, M., Chuang, J., Stoica, I., Shenker, S.: Hidden-action in multi-hop routing. In: ACM Conference on Electronic Commerce, pp. 117\u2013126 (2005)","DOI":"10.1145\/1064009.1064022"},{"key":"25_CR6","volume-title":"Computers and intractability :a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Jhonson, D.S.: Computers and intractability:a guide to the theory of NP-completeness. W. H. Freeman, New York (1979)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"324","DOI":"10.2307\/3003457","volume":"13","author":"B. Holmstrom","year":"1982","unstructured":"Holmstrom, B.: Moral Hazard in Teams. Bell Journal of Economics\u00a013, 324\u2013340 (1982)","journal-title":"Bell Journal of Economics"},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"599","DOI":"10.2307\/2298126","volume":"60","author":"P. Legeros","year":"1993","unstructured":"Legeros, P., Matthews, S.: Efficient and Nearly-Efficient Partnerships. Review of Economic Studies\u00a060(3), 599\u2013611 (1993)","journal-title":"Review of Economic Studies"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"433","DOI":"10.2307\/2297432","volume":"51","author":"D. Mookherjee","year":"1984","unstructured":"Mookherjee, D.: Optimal Incentive Schemes with Many Agents. Review of Economic Studies\u00a051(3), 433\u2013446 (1984)","journal-title":"Review of Economic Studies"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Algorithms for selfish agents. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pp. 1\u201315 (1999)","DOI":"10.1007\/3-540-49116-3_1"},{"key":"25_CR11","unstructured":"Nisan, N., Ronen, A.: Algorithmic Mechanism Design. In: Proceedings of the 31st Symposium on Theory of Computing (1999)"},{"key":"25_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, Games, and the Internet. In: Proceedings of the 33rd Symposium on Theory of Computing, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"issue":"4","key":"25_CR14","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J.S. Provan","year":"1983","unstructured":"Provan, J.S., Ball, M.O.: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected. SIAM Journal on Computing\u00a012(4), 777\u2013788 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"428","DOI":"10.2307\/2555607","volume":"18","author":"E. Rasmusen","year":"1987","unstructured":"Rasmusen, E.: Moral Hazard in Risk-Averse Teams. Rand Journal of Economics\u00a018, 428\u2013435 (1987)","journal-title":"Rand Journal of Economics"},{"key":"25_CR16","unstructured":"Strausz, R.: Moral Hazard in Sequential Teams. Departmental Working Paper. Free University of Berlin (1996)"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1257\/0002828041464434","volume":"94","author":"E. Winter","year":"2004","unstructured":"Winter, E.: Incentives and Discrimination. American Economic Review\u00a094, 764\u2013773 (2004)","journal-title":"American Economic Review"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10841-9_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:42:28Z","timestamp":1619782948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}