{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:20:39Z","timestamp":1725571239326},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174605"},{"type":"electronic","value":"9783642174612"}],"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-17461-2_26","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T09:53:59Z","timestamp":1292406839000},"page":"317-331","source":"Crossref","is-referenced-by-count":0,"title":["The Networked Common Goods Game"],"prefix":"10.1007","author":[{"given":"Jinsong","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Bansal, M.S., Venkaiah, V.C.: Improved fully polynomial time approximation scheme for the 0-1 multiple-choice knapsack problem. In: Proc. of SIAM Conference on Discrete Mathematics (2004)","key":"26_CR1"},{"key":"26_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S.P. Boyd","year":"2004","unstructured":"Boyd, S.P., Vandenberghe, L.: Convex optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.jet.2006.06.006","volume":"135","author":"Y. Bramoull\u00e9","year":"2007","unstructured":"Bramoull\u00e9, Y., Kranton, R.E.: Public goods in networks. Journal of Economic Theory\u00a0135(1), 478\u2013494 (2007)","journal-title":"Journal of Economic Theory"},{"unstructured":"Even-Dar, E., Kearns, M., Suri, S.: A network formation game for bipartite exchange economies. In: Proc. of ACM SODA 2007, pp. 697\u2013706 (2007)","key":"26_CR4"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1214\/aoms\/1177706369","volume":"30","author":"E. Eisenberg","year":"1959","unstructured":"Eisenberg, E., Gale, D.: Consensus of subjective probabilities: The Pari-Mutuel method. Annals of Mathematical Statistics\u00a030, 165\u2013168 (1959)","journal-title":"Annals of Mathematical Statistics"},{"doi-asserted-by":"crossref","unstructured":"Feldman, M., Lai, K., Zhang, L.: A price-anticipating resource allocation mechanism for distributed shared clusters. In: Proc. of ACM EC 2005, pp. 127\u2013136 (2005)","key":"26_CR6","DOI":"10.1145\/1064009.1064023"},{"unstructured":"Fisher, I.: PhD thesis. Yale University, New Haven (1891)","key":"26_CR7"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF01133222","volume":"4","author":"A.V. Fol\u2019gardt","year":"1993","unstructured":"Fol\u2019gardt, A.V.: Solution of a resource allocation game. Computational Mathematics and Modeling\u00a04(3), 273\u2013274 (1993)","journal-title":"Computational Mathematics and Modeling"},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BF01138120","volume":"6","author":"A.V. Fol\u2019gardt","year":"1995","unstructured":"Fol\u2019gardt, A.V.: Games with allocation of discrete resources to several sites. Computational Mathematics and Modeling\u00a06(3), 172\u2013176 (1995)","journal-title":"Computational Mathematics and Modeling"},{"doi-asserted-by":"crossref","unstructured":"Goemans, M.X., Li, E.L., Mirrokni, V.S., Thottan, M.: Market sharing games applied to content distribution in ad-hoc networks. In: Proc. of MobiHoc 2004, pp. 55\u201366 (2004)","key":"26_CR10","DOI":"10.1145\/989459.989467"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1126\/science.162.3859.1243","volume":"162","author":"G. Hardin","year":"1968","unstructured":"Hardin, G.: Tragedy of the commons. Science\u00a0162, 1243\u20131248 (1968)","journal-title":"Science"},{"volume-title":"The handbook of experimental economics","year":"1995","unstructured":"Kagel, J.H., Roth, A.E. (eds.): The handbook of experimental economics. Princeton University Press, Princeton (1995)","key":"26_CR12"},{"unstructured":"Kakade, S.M., Kearns, M.J., Ortiz, L.E., Pemantle, R., Suri, S.: Economic properties of social networks. In: Proc. of NIPS 2004 (2004)","key":"26_CR13"},{"key":"26_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack problems. Springer, Heidelberg (2004)"},{"key":"26_CR15","volume-title":"Knapsack problems: Algorithms and computer implementation","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack problems: Algorithms and computer implementation. John Wiley and Sons, Chichester (1990)"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, games, and the Internet. In: Proc. of STOC 2001, pp. 749\u2013753 (2001)","key":"26_CR17","DOI":"10.1145\/380752.380883"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/11523468_40","volume-title":"Automata, Languages and Programming","author":"L. Zhang","year":"2005","unstructured":"Zhang, L.: The efficiency and fairness of a fixed budget resource allocation game. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 485\u2013496. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17461-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T19:44:00Z","timestamp":1553283840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17461-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174605","9783642174612"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17461-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}