{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T05:41:29Z","timestamp":1740807689995,"version":"3.38.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,12,10]],"date-time":"2010-12-10T00:00:00Z","timestamp":1291939200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1007\/s11432-010-4145-z","type":"journal-article","created":{"date-parts":[[2010,12,10]],"date-time":"2010-12-10T06:41:28Z","timestamp":1291963288000},"page":"12-22","source":"Crossref","is-referenced-by-count":1,"title":["Restrictive mechanism of flow control among non-cooperative Internet users"],"prefix":"10.1007","volume":"54","author":[{"given":"Jun","family":"Tao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YiFei","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,10]]},"reference":[{"key":"4145_CR1","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.cor.2004.06.005","volume":"33","author":"E. Altman","year":"2006","unstructured":"Altman E, Boulogne T, Azouzi R E, et al. A survey on networking games in telecommunications. Comput Oper Res, 2006, 33: 286\u2013311","journal-title":"Comput Oper Res"},{"key":"4145_CR2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/game.1996.0074","volume":"16","author":"E. J. Friedmn","year":"1996","unstructured":"Friedmn E J, Shenker S. Learning and implemention on the Inernet. Game Econ Behav, 1996, 16: 65\u201376","journal-title":"Game Econ Behav"},{"key":"4145_CR3","doi-asserted-by":"crossref","unstructured":"Shneidman J, Parkes D, Massoulie L. Faithfulness in internet algorithms. In: Proc. SIGCOMM Workshop on Practice and Theory of Incentives and Game Theory in Networked Systems (PINS\u201904), Portland, Oregon, USA, 2004. 220\u2013227","DOI":"10.1145\/1016527.1016537"},{"key":"4145_CR4","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden T, Tardos E. How bad is selfish routing? J ACM, 2002, 49: 236\u2013259","journal-title":"J ACM"},{"key":"4145_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1049\/ip-sen:19990154","volume":"146","author":"P. B. Key","year":"1999","unstructured":"Key P B, McAulcy D R. Differential QoS and pricing in network: where flow control meets game theory. IEE Proc Softw, 1999, 146: 39\u201343","journal-title":"IEE Proc Softw"},{"key":"4145_CR6","unstructured":"Garg R, Kamra A, Khurana V. Eliciting cooperation form selfish users: a game-theoretic approach towards congestion control in communication networks. Technical Report RI01001, IBM India Research Lab, April 2001. Available at http:\/\/www.research.ibm.com\/resources\/papersearch.html"},{"key":"4145_CR7","doi-asserted-by":"crossref","unstructured":"Karp R, Koutsoupias E, Papadimitriou C, et al. Optimization problems in congestion control. In: Proc. of 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, 2000. 66\u201374","DOI":"10.1109\/SFCS.2000.892066"},{"key":"4145_CR8","doi-asserted-by":"crossref","unstructured":"Christin N, Grossklags J, Chuang J. Near rationality and competitive equilibria in networked systems. In: Proceedings of the ACM SIGCOMM Workshop on Practice and Theory of Incentives in Networked Systems Table of Contents, Portland, Oregon, USA, 2004. 213\u2013219","DOI":"10.1145\/1016527.1016536"},{"key":"4145_CR9","unstructured":"Lai K, Feldman M, Stoica I, et al. Incentives for cooperation in peer-to-peer networks. In: Workshop on Economics of Peer-to-Peer Systems (P2PEcon\u201903), Berkeley, USA, 2003"},{"key":"4145_CR10","first-page":"3573","volume-title":"IEEE International Conference on Communications (ICC)","author":"Y. Chen","year":"2008","unstructured":"Chen Y, Teo K H, Kishore S, et al. A game-theoretic framework for interference management through cognitive sensing. In: IEEE International Conference on Communications (ICC). Washington DC: IEEE Computer Society, 2008. 3573\u20133577"},{"key":"4145_CR11","first-page":"241","volume":"34","author":"J. Tao","year":"2006","unstructured":"Tao J, Wu Q L, Wu Q. Application research of network resource allocation algorithm based on non-cooperative bidding game. Chin J Elect, 2006, 34: 241\u2013246","journal-title":"Chin J Elect"},{"key":"4145_CR12","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/JSAC.2006.872882","volume":"24","author":"M. Feldman","year":"2006","unstructured":"Feldman M, Papadimitriou C, Chuang J, et al. Free-riding and whitewashing in peer to peer systems. IEEE J Select Areas Commun, 2006, 24: 1010\u20131019","journal-title":"IEEE J Select Areas Commun"},{"key":"4145_CR13","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/JSAC.2006.872875","volume":"24","author":"L. He","year":"2006","unstructured":"He L, Walrand J. Pricing and revenue sharing strategies for internet service providers. IEEE J Select Areas Commun, 2006, 24: 942\u2013951","journal-title":"IEEE J Select Areas Commun"},{"key":"4145_CR14","volume-title":"Evolutionary Games and Equilibrium Selection","author":"L. Samuelson","year":"1997","unstructured":"Samuelson L. Evolutionary Games and Equilibrium Selection. Cambridge, MA: MIT Press, 1997"},{"key":"4145_CR15","unstructured":"Basar T, Srikant R. Revenue-maximizing pricing and capacity expansion in a many-users regime. In: Proc. IEEE INFOCOM 2002, New York, 2002. 1556\u20131563"},{"key":"4145_CR16","first-page":"169","volume-title":"Nonlinear Programming","author":"D. P. Bertsekas","year":"1995","unstructured":"Bertsekas D P. Nonlinear Programming. Belmont, MA: Athena Scientific, 1995. 169\u2013177"},{"key":"4145_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/INFOCOM.2006.320","volume-title":"Proceedings of Infocom 2006: 25th IEEE International Conference on Computer Communications","author":"E. Efstathiou","year":"2006","unstructured":"Efstathiou E, Frangoudis P, Polyzos G. Stimulating participation in wireless community networks. In: Proceedings of Infocom 2006: 25th IEEE International Conference on Computer Communications. Piscataway: IEEE Press, 2006. 1\u201313"},{"key":"4145_CR18","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.1109\/INFCOM.2007.170","volume-title":"INFOCOM 2007. 26th IEEE International Conference on Computer Communications","author":"M. Felegyhazi","year":"2007","unstructured":"Felegyhazi M, Cagalj M, Bidokhti S S, et al. Non-cooperative multi-radio channel allocation in wireless networks. In: INFOCOM 2007. 26th IEEE International Conference on Computer Communications. Piscataway: IEEE Press, 2007. 1442\u20131450"},{"key":"4145_CR19","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/moor.1040.0091","volume":"29","author":"R. Johari","year":"2004","unstructured":"Johari R, Tsitsiklis J N. Efficiency loss in a network resource allocation game. Math Operat Res, 2004, 29: 407\u2013435","journal-title":"Math Operat Res"},{"key":"4145_CR20","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/9.989076","volume":"47","author":"J. Richard","year":"2002","unstructured":"Richard J, Venkat A. Optimal routing control: repeated game approach. IEEE Trans Automat Control, 2002, 47: 437\u2013450","journal-title":"IEEE Trans Automat Control"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4145-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-010-4145-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4145-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T16:37:00Z","timestamp":1740760620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-010-4145-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,10]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["4145"],"URL":"https:\/\/doi.org\/10.1007\/s11432-010-4145-z","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"type":"print","value":"1674-733X"},{"type":"electronic","value":"1869-1919"}],"subject":[],"published":{"date-parts":[[2010,12,10]]}}}