{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:11:45Z","timestamp":1764587505165},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","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-14165-2_7","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:02Z","timestamp":1278321962000},"page":"67-78","source":"Crossref","is-referenced-by-count":34,"title":["The Cooperative Game Theory Foundations of Network Bargaining Games"],"prefix":"10.1007","author":[{"given":"MohammadHossein","family":"Bateni","sequence":"first","affiliation":[]},{"given":"MohammadTaghi","family":"Hajiaghayi","sequence":"additional","affiliation":[]},{"given":"Nicole","family":"Immorlica","sequence":"additional","affiliation":[]},{"given":"Hamid","family":"Mahini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Azar, Y., Birnbaum, B., Celis, L.E., Devanur, N.R., Peres, Y.: Convergence of local dynamics to balanced outcomes in exchange networks. In: FOCS (2009)","DOI":"10.1109\/FOCS.2009.33"},{"key":"7_CR2","unstructured":"Azar, Y., Devanur, N.R., Jain, K., Peres, Y.: Monotonicity in bargaining games. In: SODA (2010)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bateni, M., Hajiaghayi, M., Immorlica, N., Mahini, H.: The cooperative game theory foundations of network bargaining games, CoRR, abs\/1004.4317 (2010)","DOI":"10.1007\/978-3-642-14165-2_7"},{"key":"7_CR4","first-page":"119","volume":"10","author":"O.N. Bondareva","year":"1963","unstructured":"Bondareva, O.N.: Some applications of linear programming to cooperative games. Problemy Kibernetiki\u00a010, 119\u2013139 (1963)","journal-title":"Problemy Kibernetiki"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-77105-0_6","volume-title":"Internet and Network Economics","author":"H. Bosse","year":"2007","unstructured":"Bosse, H., Byrka, J., Markakis, E.: New algorithms for approximate nash equilibria in bimatrix games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol.\u00a04858, pp. 17\u201329. Springer, Heidelberg (2007)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-540-92185-1_61","volume-title":"Internet and Network Economics","author":"T. Chakraborty","year":"2008","unstructured":"Chakraborty, T., Kearns, M.: Bargaining solutions in a social network. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 548\u2013555. Springer, Heidelberg (2008)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Chakraborty, T., Kearns, M., Khanna, S.: Network bargaining: Algorithms and structural results. In: EC (2009)","DOI":"10.1145\/1566374.1566398"},{"key":"7_CR8","unstructured":"Charness, G., Corominas-Bosch, M., Frechette, G.R.: Bargaining and Network Structure: An Experiment, SSRN eLibrary (2005)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player nash equilibrium. In: FOCS, pp. 261\u2013272 (2006)","DOI":"10.1109\/FOCS.2006.69"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/FOCS.2006.20","volume-title":"FOCS 2006: 47th Annual IEEE Symposium on Foundations of Computer Science","author":"X. Chen","year":"2006","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Computing nash equilibria: Approximation and smoothed complexity. In: FOCS 2006: 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 603\u2013612. IEEE Computer Society, Los Alamitos (2006)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: Complexity of determining nonemptiness of the core. In: EC, pp. 230\u2013231 (2003)","DOI":"10.1145\/779928.779973"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/11944874_27","volume-title":"Internet and Network Economics","author":"C. Daskalakis","year":"2006","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.H.: A note on approximate nash equilibria. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 297\u2013306. Springer, Heidelberg (2006)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Papadimitriou, C.H.: On oblivious ptas\u2019s for nash equilibrium. In: STOC, pp. 75\u201384 (2009)","DOI":"10.1145\/1536414.1536427"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/nav.3800120303","volume":"12","author":"M. Davis","year":"1965","unstructured":"Davis, M., Maschler, M.: The kernel of a cooperative game. Naval Research Logistics Quarterly\u00a012, 223\u2013259 (1965)","journal-title":"Naval Research Logistics Quarterly"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Deng, X., Fang, Q., Sun, X.: Finding nucleolus of flow game. In: SODA, pp. 124\u2013131 (2006)","DOI":"10.1145\/1109557.1109572"},{"key":"7_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7787-8","volume-title":"Cooperative Games: Solutions and Applications","author":"T.S.H. Driessen","year":"1988","unstructured":"Driessen, T.S.H.: Cooperative Games: Solutions and Applications. Kluwer Academic Publishers, Dordrecht (1988)"},{"key":"7_CR17","first-page":"195","volume":"83","author":"U. Faigle","year":"1998","unstructured":"Faigle, U., Kern, W., Fekete, S.P., Hochst\u00e4ttler, W.: The nucleon of cooperative games and an algorithm for matching games. Mathematical Programming\u00a083, 195\u2013211 (1998)","journal-title":"Mathematical Programming"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s001820050083","volume":"27","author":"U. Faigle","year":"1998","unstructured":"Faigle, U., Kern, W., Kuipers, J.: Computing the nucleolus of min-cost spanning tree games is np-hard. International Journal of Game Theory\u00a027, 443\u2013450 (1998)","journal-title":"International Journal of Game Theory"},{"key":"7_CR19","unstructured":"Faigle, U., Kern, W., Kuipers, J.: An efficient algorithm for nucleolus and prekernel computation in some classes of TU-games, Memorandum 1464, University of Twente, Enschede (1998)"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s001820100065","volume":"30","author":"U. Faigle","year":"2001","unstructured":"Faigle, U., Kern, W., Kuipers, J.: On the computation of the nucleolus of a cooperative game. International Journal of Game Theory\u00a030, 79\u201398 (2001)","journal-title":"International Journal of Game Theory"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s00186-006-0065-5","volume":"63","author":"U. Faigle","year":"2006","unstructured":"Faigle, U., Kern, W., Kuipers, J.: Computing an element in the lexicographic kernel of a game. Mathematical methods of operations research\u00a063, 427\u2013433 (2006)","journal-title":"Mathematical methods of operations research"},{"key":"7_CR22","first-page":"47","volume":"40","author":"D.B. Gilies","year":"1959","unstructured":"Gilies, D.B.: Solutions to general non-zero-sum games. Ann. Math. Studies\u00a040, 47\u201385 (1959)","journal-title":"Ann. Math. Studies"},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01247104","volume":"25","author":"D. Granot","year":"1996","unstructured":"Granot, D., Maschler, M., Owen, G., Zhu, W.R.: The kernel\/nucleolus of a standard tree game. International Journal of Game Theory\u00a025(2), 219\u2013244 (1996)","journal-title":"International Journal of Game Theory"},{"key":"7_CR24","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost sharing schemes. In: SODA, pp. 602\u2013611 (2005)"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: STOC, pp. 364\u2013372 (2001)","DOI":"10.1145\/380752.380825"},{"key":"7_CR26","unstructured":"Kanoria, Y., Bayati, M., Borgs, C., Chayes, J.T., Montanari, A.: A natural dynamics for bargaining on exchange networks, CoRR, abs\/0911.1767 (2009)"},{"issue":"2","key":"7_CR27","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1287\/moor.28.2.294.14477","volume":"28","author":"W. Kern","year":"2003","unstructured":"Kern, W., Paulusma, D.: Matching games: the least core and the nucleolus. Math. Oper. Res.\u00a028(2), 294\u2013308 (2003)","journal-title":"Math. Oper. Res."},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Tardos, \u00c9.: Balanced outcomes in social exchange networks. In: STOC, pp. 295\u2013304 (2008)","DOI":"10.1145\/1374376.1376994"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Kontogiannis, S.C., Spirakis, P.G.: Efficient algorithms for constant well supported approximate equilibria in bimatrix games. In: ICALP, pp. 595\u2013606 (2007)","DOI":"10.1007\/978-3-540-73420-8_52"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Markakis, E., Saberi, A.: On the core of the multicommodity flow game. In: EC, pp. 93\u201397 (2003)","DOI":"10.1145\/779928.779940"},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.cor.2004.06.020","volume":"33","author":"H. Meinhardt","year":"2006","unstructured":"Meinhardt, H.: An lp approach to compute the pre-kernel for cooperative games. Computers & Operations Research\u00a033, 535\u2013557 (2006)","journal-title":"Computers & Operations Research"},{"key":"7_CR32","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"J.F. Nash","year":"1950","unstructured":"Nash, J.F.: The bargaining problem. Econometrica\u00a018, 155\u2013162 (1950)","journal-title":"Econometrica"},{"key":"7_CR33","volume-title":"Theory of Games and Economic Behavior","author":"J.V. Neumann","year":"1944","unstructured":"Neumann, J.V., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)"},{"issue":"4","key":"7_CR34","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF01766427","volume":"19","author":"J.A.M. Potters","year":"1991","unstructured":"Potters, J.A.M.: An axiomatization of the nucleolus. International Journal of Game Theory\u00a019(4), 365\u2013373 (1991)","journal-title":"International Journal of Game Theory"},{"issue":"6","key":"7_CR35","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0117107","volume":"17","author":"D. Schmeidler","year":"1969","unstructured":"Schmeidler, D.: The nucleolus of a characteristic function game. SIAM Journal of Applied Mathematics\u00a017(6), 1163\u20131170 (1969)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Shapley, L.S., Shubik, M.: The assignment game i: the core. International Journal of Game Theory, 111\u2013130 (1972)","DOI":"10.1007\/BF01753437"},{"key":"7_CR37","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1002\/nav.3800140404","volume":"14","author":"L.S. Shapley","year":"1967","unstructured":"Shapley, L.S.: On balanced sets and cores. Naval Research Logistics Quarterly\u00a014, 453\u2013460 (1967)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"7_CR38","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1287\/moor.20.1.189","volume":"20","author":"C. Snijders","year":"1995","unstructured":"Snijders, C.: Axiomatization of the nucleolus. Math. Oper. Res.\u00a020(1), 189\u2013196 (1995)","journal-title":"Math. Oper. Res."},{"key":"7_CR39","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01258200","volume":"24","author":"A. Sobolev","year":"1995","unstructured":"Sobolev, A.: The nucleolus for cooperative games with arbitrary bounds of individual rationality. International Journal of Game Theory\u00a024, 13\u201322 (1995)","journal-title":"International Journal of Game Theory"},{"key":"7_CR40","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01240179","volume":"23","author":"T. Solymosi","year":"1994","unstructured":"Solymosi, T., Raghavan, T.E.S.: An algorithm for finding the nucleolus of assignment games. International Journal of Game Theory\u00a023, 119\u2013143 (1994)","journal-title":"International Journal of Game Theory"},{"key":"7_CR41","first-page":"449","volume":"134","author":"R.E. Stearns","year":"1968","unstructured":"Stearns, R.E.: Convergent transfer schemes for n-person games. Transactions of American Mathematical Society\u00a0134, 449\u2013459 (1968)","journal-title":"Transactions of American Mathematical Society"},{"key":"7_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-77105-0_8","volume-title":"Internet and Network Economics","author":"H. Tsaknakis","year":"2007","unstructured":"Tsaknakis, H., Spirakis, P.G.: An optimization approach for approximate nash equilibria. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol.\u00a04858, pp. 42\u201356. Springer, Heidelberg (2007)"},{"key":"7_CR43","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2000)","edition":"2"},{"key":"7_CR44","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1287\/moor.6.1.88","volume":"6","author":"M. Yarom","year":"1981","unstructured":"Yarom, M.: The lexicographic kernel of a cooperative game. Math. Oper. Res.\u00a06, 66\u2013100 (1981)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:41:44Z","timestamp":1558280504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}