{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:28:45Z","timestamp":1725812925282},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319131283"},{"type":"electronic","value":"9783319131290"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13129-0_8","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:08:41Z","timestamp":1417432121000},"page":"106-119","source":"Crossref","is-referenced-by-count":2,"title":["The Shapley Value in Knapsack Budgeted Games"],"prefix":"10.1007","author":[{"given":"Smriti","family":"Bhagat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Weinsberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Aadithya, K.V., Michalak, T.P., Jennings, N.R.: Representation of coalitional games with algebraic decision diagrams. In: AAMAS 2011 (2011)"},{"key":"8_CR2","unstructured":"Aziz, H., Sorensen, T.B.: Path coalitional games. In: CoopMAS 2011 (2011)"},{"key":"8_CR3","unstructured":"Bachrach, Y., Lev, O., Lovett, S., Rosenschein, J.S., Zadimoghaddam, M.: Cooperative weakest link games. In: AAMAS 2014 (to appear, 2014)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Markakis, E., Resnick, E., Procaccia, A.D., Rosenschein, J.S., Saberi, A.: Approximating power indices: Theoretical and empirical analysis. In: Autonomous Agents and Multi-Agent Systems (March 2010)","DOI":"10.1007\/s10458-009-9078-9"},{"key":"8_CR5","unstructured":"Bachrach, Y., Porat, E.: Path disruption games. In: AAMAS 2010 (2010)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Bhagat, S., Kim, A., Muthukrishnan, S., Weinsberg, U.: The shapley value in knapsack budgeted games. arXiv:1409.5200 (2014)","DOI":"10.1007\/978-3-319-13129-0_8"},{"key":"8_CR7","unstructured":"Conitzer, V., Sandholm, T.: Computing shapley values, manipulating value division schemes, and checking core membership in multi-issue domains. In: AAAI 2004 (2004)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Deng, X., Papadimitriou, C.H.: On the complexity of cooperative solution concepts. Mathematics of Operations Research\u00a019(2) (1994)","DOI":"10.1287\/moor.19.2.257"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Faigle, U., Kern, W.: On some approximately balanced combinatorial cooperative games. Zeitschrift f\u00fcr Operations Research\u00a038(2) (1993)","DOI":"10.1007\/BF01414210"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Fatima, S.S., Wooldridge, M., Jennings, N.R.: A linear approximation method for the shapley value. Artificial Intelligence\u00a0172(14) (2008)","DOI":"10.1016\/j.artint.2008.05.003"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Ieong, S., Shoham, Y.: Marginal contribution nets: A compact representation scheme for coalitional games. In: EC 2005 (2005)","DOI":"10.1145\/1064009.1064030"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Ieong, S., Shoham, Y.: Multi-attribute coalitional games. In: EC 2006 (2006)","DOI":"10.1145\/1134707.1134726"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Kuipers, J.: Bin packing games. Mathematical Methods of Operations Research\u00a047(3) (1998)","DOI":"10.1007\/BF01198407"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Ma, R.T., Chiu, D., Lui, J.C., Misra, V., Rubenstein, D.: Internet economics: The use of shapley value for isp settlement. In: CoNEXT 2007 (2007)","DOI":"10.1145\/1364654.1364662"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Matsui, T., Matsui, Y.: A survey of algorithms for calculating power indices of weighted majority games. J. Oper. Res. Soc. Japan (2000)","DOI":"10.15807\/jorsj.43.71"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Matsui, Y., Matsui, T.: Np-completeness for calculating power indices of weighted majority games. Theoretical Computer Science (2001)","DOI":"10.1016\/S0304-3975(00)00251-6"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Michalak, T.P., Aadithya, K.V., Szczepanski, P.L., Ravindran, B., Jennings, N.R.: Efficient computation of the shapley value for game-theoretic network centrality. J. Artif. Int. Res. (January 2013)","DOI":"10.1613\/jair.3806"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Misra, V., Ioannidis, S., Chaintreau, A., Massouli\u00e9, L.: Incentivizing peer-assisted services: A fluid shapley value approach. In: SIGMETRICS 2010 (2010)","DOI":"10.1145\/1811039.1811064"},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"R. Narayanam","year":"2011","unstructured":"Narayanam, R., Narahari, Y.: A shapley value-based approach to discover influential nodes in social networks. IEEE Transactions on Automation Science and Engineering\u00a08(1), 130\u2013147 (2011)","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"8_CR20","unstructured":"Qiu, X.: Bin packing games. Master\u2019s thesis, University of Twente (2010)"},{"key":"8_CR21","first-page":"307","volume":"2","author":"L.S. Shapley","year":"1953","unstructured":"Shapley, L.S.: A value for n-person games. Contributions to the Theory of Games\u00a02, 307\u2013317 (1953)","journal-title":"Contributions to the Theory of Games"},{"key":"8_CR22","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer-Verlag New York, Inc., New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13129-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:19:03Z","timestamp":1559078343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13129-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131283","9783319131290"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13129-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}