{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:13:15Z","timestamp":1767237195947,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161698"},{"type":"electronic","value":"9783642161704"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16170-4_30","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T12:07:44Z","timestamp":1286971664000},"page":"347-358","source":"Crossref","is-referenced-by-count":5,"title":["Minimal Subsidies in Expense Sharing Games"],"prefix":"10.1007","author":[{"given":"Reshef","family":"Meir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoram","family":"Bachrach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey S.","family":"Rosenschein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01766876","volume":"3","author":"R.J. Aumann","year":"1974","unstructured":"Aumann, R.J., Dr\u00e9ze, J.H.: Cooperative games with coalition structures. International Journal of Game Theory\u00a03, 217\u2013237 (1974)","journal-title":"International Journal of Game Theory"},{"key":"30_CR2","unstructured":"Aziz, H., Brandt, F., Harrenstein, P.: Monotone cooperative games and their threshold versions. In: AAMAS 2010, pp. 1017\u20131024 (2010)"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-04645-2_12","volume-title":"Algorithmic Game Theory","author":"Y. Bachrach","year":"2009","unstructured":"Bachrach, Y., Elkind, E., Meir, R., Pasechnik, D., Zuckerman, M., Rothe, J., Rosenschein, J.S.: The cost of stability in coalitional games. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol.\u00a05814, pp. 122\u2013134. Springer, Heidelberg (2009)"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Meir, R., Zuckerman, M., Rothe, J., Rosenschein, J.S.: The cost of stability in weighted voting games (extended abstract). In: AAMAS 2009, pp. 1289\u20131290 (2009)","DOI":"10.1007\/978-3-642-04645-2_12"},{"key":"30_CR5","unstructured":"Bachrach, Y., Rosenschein, J.S.: Coalitional skill games. In: AAMAS 2008, pp. 1023\u20131030 (2008)"},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/s10458-008-9057-6","volume":"18","author":"Y. Bachrach","year":"2009","unstructured":"Bachrach, Y., Rosenschein, J.S.: Power in threshold network flow games. Autonomous Agents and Multi-Agent Systems\u00a018(1), 106\u2013132 (2009)","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"30_CR7","unstructured":"Bachrach, Y., Rosenschein, J.S., Porat, E.: Power and stability in connectivity games. In: AAMAS 2008, pp. 999\u20131006 (2008)"},{"key":"30_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4393-0","volume-title":"Cooperative Games on Combinatorial Structures","author":"J.M. Bilbao","year":"2000","unstructured":"Bilbao, J.M.: Cooperative Games on Combinatorial Structures. Kluwer Publishers, Dordrecht (2000)"},{"key":"30_CR9","unstructured":"Br\u00e2nzei, S., Larson, K.: Coalitional affinity games and the stability gap. In: IJCAI 2009, pp. 79\u201384 (2009)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-79309-0_30","volume-title":"Algorithmic Game Theory","author":"N. Buchbinder","year":"2008","unstructured":"Buchbinder, N., Lewin-Eytan, L., Naor, J(S.), Orda, A.: Non-cooperative cost sharing games via subsidies. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol.\u00a04997, pp. 337\u2013349. Springer, Heidelberg (2008)"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/net.3230030402","volume":"3","author":"A. Claus","year":"1973","unstructured":"Claus, A., Kleitman, D.J.: Cost allocation for a spanning tree. Networks\u00a03, 289\u2013304 (1973)","journal-title":"Networks"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dss.2004.08.004","volume":"39","author":"N.R. Devanur","year":"2005","unstructured":"Devanur, N.R., Mihail, M., Vazirani, V.V.: Strategyproof cost-sharing mechanisms for set cover and facility location games. Decision Support Systems\u00a039, 11\u201322 (2005)","journal-title":"Decision Support Systems"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01584227","volume":"21","author":"D. Granot","year":"1981","unstructured":"Granot, D., Huberman, G.: Minimum cost spanning tree games. Mathematical Programming\u00a021, 1\u201318 (1981)","journal-title":"Mathematical Programming"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Ieong, S., Shoham, Y.: Marginal contribution nets: a compact representation scheme for coalitional games. In: ACM EC 2005, pp. 193\u2013202 (2005)","DOI":"10.1145\/1064009.1064030"},{"key":"30_CR15","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost sharing schemes. In: SODA 2005, pp. 602\u2013611 (2005)"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.V.: Applications of approximation algorithms to cooperative games. In: STOC 2001, pp. 364\u2013372 (2001)","DOI":"10.1145\/380752.380825"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Mathematics"},{"key":"30_CR18","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, Chichester (1990)"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230080104","volume":"8","author":"N. Megiddo","year":"1978","unstructured":"Megiddo, N.: Cost allocation for steiner trees. Networks\u00a08, 1\u20136 (1978)","journal-title":"Networks"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Monderer, D., Tennenholtz, M.: k-implementation. In: ACM EC 2003, pp. 19\u201328 (2003)","DOI":"10.1145\/779928.779931"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, \u00c9.: Group strategy proof mechanisms via primal-dual algorithms. In: FOCS 2003, pp. 584\u2013593 (2003)","DOI":"10.1109\/SFCS.2003.1238231"},{"key":"30_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0308-8","volume-title":"Introduction to the Theory of Cooperative Games","author":"B. Peleg","year":"2003","unstructured":"Peleg, B., Sudh\u00f6lter, P.: Introduction to the Theory of Cooperative Games. Kluwer Publishers, Dordrecht (2003)"},{"key":"30_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-642-03816-7_54","volume-title":"Mathematical Foundations of Computer Science 2009","author":"E. Resnick","year":"2009","unstructured":"Resnick, E., Bachrach, Y., Meir, R., Rosenschein, J.S.: The cost of stability in network flow games. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 636\u2013650. Springer, Heidelberg (2009)"},{"key":"30_CR24","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF02099700","volume":"57","author":"D. Skorin-Kapov","year":"1995","unstructured":"Skorin-Kapov, D.: On the core of the minimum cost steiner tree game in networks. Annals of Operations Research\u00a057, 233\u2013249 (1995)","journal-title":"Annals of Operations Research"},{"key":"30_CR25","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16170-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T18:17:48Z","timestamp":1740593868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16170-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161698","9783642161704"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16170-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}