{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T12:48:20Z","timestamp":1762606100900},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,5,11]],"date-time":"2012-05-11T00:00:00Z","timestamp":1336694400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s00186-012-0389-2","type":"journal-article","created":{"date-parts":[[2012,5,10]],"date-time":"2012-05-10T08:26:21Z","timestamp":1336638381000},"page":"43-65","source":"Crossref","is-referenced-by-count":10,"title":["Nash equilibrium based fairness"],"prefix":"10.1007","volume":"76","author":[{"given":"Hisao","family":"Kameda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eitan","family":"Altman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corinne","family":"Touati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Legrand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,11]]},"reference":[{"key":"389_CR1","unstructured":"Alpcan T, Ba\u015far T (2002) A game-theoretic framework for congestion control in general topology networks. In: Proceedings of 41th IEEE CDC, Las Vegas, Nevada. (Available at http:\/\/decision.csl.uiuc.edu\/~alpcan\/publications.htm )"},{"key":"389_CR2","unstructured":"Alpcan T, Ba\u015far T (2003) A utility-based congestion control scheme for Internet-style networks with delay. In: Proceedings of IEEE Infocom. (Available at http:\/\/decision.csl.uiuc.edu\/~alpcan\/publications.htm )"},{"key":"389_CR3","doi-asserted-by":"crossref","unstructured":"Altman E, Kameda H (2005) Equilibria for multiclass routing in multi-agent networks. In: Nowak AS, Szajowski K (eds) Advances in dynamic games: annals of international society of dynamic games, vol 7 . Birkh\u00e4user. Boston, pp 343\u2013367. (An extended version of the paper that appeared in Proceedings of 40th IEEE conference on decision and control (IEEE CDC\u201901), Orlando, USA, pp 604\u2013609, Dec 2001)","DOI":"10.1007\/0-8176-4429-6_20"},{"key":"389_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03539-9","volume-title":"Optima and equilibria: an introduction to nonlinear analysis","author":"J-P Aubin","year":"1998","unstructured":"Aubin J-P (1998) Optima and equilibria: an introduction to nonlinear analysis, 2nd edn. Springer, Berlin","edition":"2"},{"issue":"2","key":"389_CR5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321879.321887","volume":"22","author":"F Baskett","year":"1975","unstructured":"Baskett F, Mani Chandy K, Muntz R, Palacios FG (1975) Open, closed, and mixed networks of queues with different classes of customers. J ACM 22(2): 248\u2013260","journal-title":"J ACM"},{"key":"389_CR6","volume-title":"Data networks","author":"D Bertsekas","year":"1992","unstructured":"Bertsekas D, Gallager R (1992) Data networks, 2nd edn. Prentice-Hall, Englewood Cliffs","edition":"2"},{"key":"389_CR7","doi-asserted-by":"crossref","unstructured":"Bonald T, Massouli\u00e9 L (2001) Impact of fairness on Internet performance. In: Proceeidngs of ACM sigmetrics conference, pp 82\u201391","DOI":"10.1145\/384268.378438"},{"key":"389_CR8","doi-asserted-by":"crossref","unstructured":"Bonald T, Jonckheere M, Prouti\u00e8re A (2004) Insensitivie load balancing. In: Proceedings of ACM sigmetrics\/performance","DOI":"10.1145\/1005686.1005729"},{"key":"389_CR9","doi-asserted-by":"crossref","unstructured":"Cao XR (1982) Preference functions and bargaining solutions. In: Proceedings of IEEE CDC, Florida, pp 164\u2013171","DOI":"10.1109\/CDC.1982.268420"},{"key":"389_CR10","doi-asserted-by":"crossref","unstructured":"Donassolo B, Legrand A, Geyer C (2011). Non-cooperative scheduling considered harmful in collaborative volunteer computing environments. In Proceedings of the 11th IEEE\/ACM international symposium on cluster computing and the grid (CCGrid\u201911), May 2011, Newport Beach, CA, USA","DOI":"10.1109\/CCGrid.2011.34"},{"key":"389_CR11","first-page":"191","volume":"1","author":"A Giessler","year":"1978","unstructured":"Giessler A, Haanle J, Konig A, Pade E (1978) Free buffer allocation - An investigation by simulation. Comput Netw 1: 191\u2013204","journal-title":"Comput Netw"},{"key":"389_CR12","first-page":"265","volume":"77","author":"EJ Hughes","year":"1994","unstructured":"Hughes EJ (1994) The left side of antitrust: What fairness means and why it matters. Marquette Law Rev 77: 265\u2013306","journal-title":"Marquette Law Rev"},{"key":"389_CR13","unstructured":"Inoie A, Kameda H, Touati C (2004) Pareto set, fairness, and Nash equilibrium: a case study on load balancing. In: Proceedings of 11th intnational symposium dynamic games and applications, Tucson, Arizona, pp 386\u2013393"},{"key":"389_CR14","unstructured":"Jain R, Chiu D, Hawe W (1984) A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. DEC Research Report TR-301"},{"key":"389_CR15","doi-asserted-by":"crossref","unstructured":"Kameda H (2009) Coincident cost improvement vs. degradation by adding connections to noncooperative networks and distributed systems. Netw Spat Econ 9(2):269\u2013287, (an extended version of the paper, Kameda, H (2004) Bounds on benefits and harms of adding connections to noncooperative networks. In: Mitrou N et\u00a0al (eds) NETWORKING 2004\u2014proceedimgs of 3rd international IFIP-TC6 networking conference, Athens, Greece, May 9\u201314, 2004, Series: Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Germany, pp 405\u2013417)","DOI":"10.1007\/s11067-009-9102-2"},{"key":"389_CR16","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1109\/JSAC.2008.080922","volume":"29","author":"H Kameda","year":"2008","unstructured":"Kameda H, Altman E (2008) Inefficient noncooperation in networking games of common-pool resources. IEEE J Sel Areas Commun Spec Issue Game Theor Commun Syst 29: 1260\u20131268","journal-title":"IEEE J Sel Areas Commun Spec Issue Game Theor Commun Syst"},{"issue":"3","key":"389_CR17","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1145\/567112.567113","volume":"49","author":"H Kameda","year":"2002","unstructured":"Kameda H, Pourtallier O (2002) Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers. J ACM 49(3): 407\u2013433","journal-title":"J ACM"},{"issue":"9","key":"389_CR18","doi-asserted-by":"crossref","first-page":"1687","DOI":"10.1109\/9.880619","volume":"45","author":"H Kameda","year":"2000","unstructured":"Kameda H, Altman E, Kozawa T, Hosokawa Y (2000) Braess-like paradoxes in distributed computer systems. IEEE Trans Autom Control 45(9): 1687\u20131691","journal-title":"IEEE Trans Autom Control"},{"key":"389_CR19","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/ett.4460080106","volume":"8","author":"FP Kelly","year":"1997","unstructured":"Kelly FP (1997) Charging and rate control for elastic traffic. Eur Trans Telecommun 8: 33\u201337","journal-title":"Eur Trans Telecommun"},{"key":"389_CR20","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1057\/palgrave.jors.2600523","volume":"49","author":"FP Kelly","year":"1998","unstructured":"Kelly FP, Maulloo AK, Tan DKH (1998) Rate control in communication networks: shadow prices, proportional fairness and stability. J Oper Res Soc 49: 237\u2013252","journal-title":"J Oper Res Soc"},{"key":"389_CR21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1049\/ip-sen:19990154","volume":"146","author":"P Key","year":"1999","unstructured":"Key P, McAuley D (1999) Differential QoS and pricing in networks: where flow-control meets game theory. IEE Proc Softw 146: 39\u201343","journal-title":"IEE Proc Softw"},{"key":"389_CR22","doi-asserted-by":"crossref","unstructured":"Kunniyur S, Srikant R (2000) End-to-end congestion control: utility functions, random losses and ECN marks. In: Proceedings of IEEE INFOCOM 2000","DOI":"10.1109\/INFCOM.2000.832529"},{"issue":"4","key":"389_CR23","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1109\/TWC.2004.830826","volume":"3","author":"HJ Kushner","year":"2004","unstructured":"Kushner HJ, Whiting PA (2004) Convergence of proportional-fair sharing algorithms under general conditions. IEEE Trans Wirel Commun 3(4): 1250\u20131259","journal-title":"IEEE Trans Wirel Commun"},{"key":"389_CR24","doi-asserted-by":"crossref","unstructured":"Massouli\u00e9 L, Roberts J (1999) Bandwidth sharing: objectives and algorithms. In: IEEE INFOCOM, pp 1395\u20131403","DOI":"10.1109\/INFCOM.1999.752159"},{"issue":"5","key":"389_CR25","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1109\/26.87140","volume":"39","author":"R Mazumdar","year":"1991","unstructured":"Mazumdar R, Mason LG, Doulgligeris C (1991) Fairness in network optimal flow control: optimality of product forms. IEEE Trans Commun 39(5): 775\u2013782","journal-title":"IEEE Trans Commun"},{"issue":"5","key":"389_CR26","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/90.879343","volume":"8","author":"J Mo","year":"2000","unstructured":"Mo J, Walrand J (2000) Fair end-to-end window-based congestion control. IEEE\/ACM Trans Netw 8(5): 556\u2013567","journal-title":"IEEE\/ACM Trans Netw"},{"key":"389_CR27","doi-asserted-by":"crossref","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"JF Nash Jr","year":"1950","unstructured":"Nash JF Jr (1950) The bargaining problem. Econometrica 18: 155\u2013162","journal-title":"Econometrica"},{"key":"389_CR28","volume-title":"Convex structures and economic theory","author":"H Nikaido","year":"1968","unstructured":"Nikaido H (1968) Convex structures and economic theory. Academic Press, New York"},{"key":"389_CR29","doi-asserted-by":"crossref","unstructured":"Simeone O, Bar-Ness Y (2007) A game-theoretic view on the interference channel with random access. In: Proceedings of 2nd IEEE international symposium on new frontiers in dynamic spectrum access networks. IEEE, Dublin, pp 13\u201321","DOI":"10.1109\/DYSPAN.2007.11"},{"key":"389_CR30","volume-title":"An introductuction to classical real analysis","author":"KR Stromberg","year":"1981","unstructured":"Stromberg KR (1981) An introductuction to classical real analysis. Wadsworth, Belmont, CA"},{"key":"389_CR31","unstructured":"The ATM forum Technical Committee (1996) Traffic management specification, version 4.0. The ATM forum"},{"key":"389_CR32","unstructured":"Touati C, Altman E, Galtier J (2002) Utility based fair bandwidth allocation. In: Proceedings of NPDPA. IASTED, Tsukuba, Japan, pp 126\u2013131"},{"issue":"5","key":"389_CR33","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1109\/90.879352","volume":"8","author":"H Ya\u00efche","year":"2000","unstructured":"Ya\u00efche H, Mazumdar RR, Rosenberg C (2000) A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE\/ACM Trans Netw 8(5): 667\u2013677","journal-title":"IEEE\/ACM Trans Netw"},{"key":"389_CR34","unstructured":"Yang J (2004) Average rate updating mechanism in proportional fair scheduler for HDR. In: IEEE global telecommunications conference, vol 6, pp 3464\u20133466"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0389-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-012-0389-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0389-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T09:39:26Z","timestamp":1561714766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-012-0389-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,11]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["389"],"URL":"https:\/\/doi.org\/10.1007\/s00186-012-0389-2","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,11]]}}}