{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:25Z","timestamp":1725541825629},"publisher-location":"Berlin, Heidelberg","reference-count":12,"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_32","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T17:14:44Z","timestamp":1260292484000},"page":"351-361","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Incentives for Participation with Type-Dependent Externalities"],"prefix":"10.1007","author":[{"given":"Michal","family":"Feldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Tessler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoav","family":"Wilf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"S. Arora","year":"1999","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems. Journal of Computer and System Sciences\u00a058(1), 193\u2013210 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Aumann, R.: Acceptable Points in General Cooperative n-Person Games. In: Contributions to the Theory of Games, vol. 4 (1959)","DOI":"10.1515\/9781400882168-018"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Feldman, M., Nisan, N.: Combinatorial Agency. In: ACM Electronic Commerce (2006)","DOI":"10.1145\/1134707.1134710"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Feldman, M., Nisan, N.: Mixed Strategies in Combinatorial Agency. In: 2nd international Workshop on Internet and Network Economics (2006)","DOI":"10.1007\/11944874_32"},{"issue":"3","key":"32_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/(SICI)1098-2418(199605)8:3<187::AID-RSA3>3.0.CO;2-U","volume":"8","author":"W. Fernandez de la Vega","year":"1996","unstructured":"Fernandez de la Vega, W.: Max-Cut Has a Randomized Approximation Scheme in Dense Graphs. Random Struct. Algorithms\u00a08(3), 187\u2013198 (1996)","journal-title":"Random Struct. Algorithms"},{"key":"32_CR6","unstructured":"Winter, E., Bernstein, S.: How to Throw a Party: Multi-Agent Initiatives with Type Dependent Externalities. Center for the study of rationality: discussion paper (2008)"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.2307\/2555793","volume":"27","author":"P. Jehiel","year":"1996","unstructured":"Jehiel, P., Moldovanu, B.: Strategic Nonparticipation. RAND Journal of Economics\u00a027, 84\u201398 (1996)","journal-title":"RAND Journal of Economics"},{"key":"32_CR8","first-page":"1","volume-title":"Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization","author":"M. Frieze Alan","year":"1995","unstructured":"Frieze Alan, M., Mark, J.: Improved Approximation Algorithms for Max k-Cut and Max Bisection. In: Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization, pp. 1\u201313. Springer, London (1995)"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1162\/003355399556016","volume":"114","author":"I. Segal","year":"1999","unstructured":"Segal, I.: Contracting with Externalities. Quarterly Journal of Economics\u00a0114, 337\u2013388 (1999)","journal-title":"Quarterly Journal of Economics"},{"key":"32_CR10","first-page":"337","volume":"113","author":"I. Segal","year":"2004","unstructured":"Segal, I.: Coordination and Discrimination in Contracting with Externalities: Divide and Conquer? Journal of Economic Theory\u00a0113, 337\u2013388 (2004)","journal-title":"Journal of Economic Theory"},{"key":"32_CR11","unstructured":"Viggo, K., Sanjeev, K., Jens, L., Alessandro, P.: On the Hardness of Approximating Max k-Cut and its Dual. Technical report (1997)"},{"key":"32_CR12","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_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:42:30Z","timestamp":1619782950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}