{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T00:19:03Z","timestamp":1774484343712,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,7,4]],"date-time":"2013-07-04T00:00:00Z","timestamp":1372896000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10100-013-0316-5","type":"journal-article","created":{"date-parts":[[2013,7,3]],"date-time":"2013-07-03T05:18:44Z","timestamp":1372828724000},"page":"743-762","source":"Crossref","is-referenced-by-count":2,"title":["Traffic routing oligopoly"],"prefix":"10.1007","volume":"23","author":[{"given":"D\u00e1vid","family":"Csercsik","sequence":"first","affiliation":[]},{"given":"Bal\u00e1zs","family":"Sziklai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,4]]},"reference":[{"key":"316_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, Boulognea T, El-Azouzi R, Jimenez T, Wynter L (2006) A survey on networking games in telecommunications. Comput Oper Res 33:286\u2013311","journal-title":"Comput Oper Res"},{"key":"316_CR2","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/MSP.2008.929286","volume":"25","author":"N Devroye","year":"2008","unstructured":"Devroye N, Vu M, Tarokh V (2008) Cognitive radio networks: highlights of information theoretic limits, models and design. IEEE Signal Process Mag 25:12\u201323","journal-title":"IEEE Signal Process Mag"},{"key":"316_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-540-45138-9_2","volume-title":"Mathematical foundations of computer science 2003, lecture notes in computer science","author":"R Feldmann","year":"2003","unstructured":"Feldmann R, Gairing M, Lucking T, Monien B, Rode M (2003) Selfish routing in non-cooperative networks: a survey. In: Rovan B, Vojt\u00e1s P (eds) Mathematical foundations of computer science 2003, lecture notes in computer science, vol 2747. Springer, Berlin, Heidelberg, pp 21\u201345"},{"issue":"1","key":"316_CR4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ejor.2012.02.036","volume":"221","author":"M Grabisch","year":"2012","unstructured":"Grabisch M, Funaki Y (2012) A coalition formation value for games in partition function form. Eur J Oper Res 221(1):175\u2013185","journal-title":"Eur J Oper Res"},{"key":"316_CR5","doi-asserted-by":"crossref","unstructured":"Karakostas G, Kolliopoulos S (2009) Stackelberg strategies for selfish routing in general multicommodity networks. Algorithmica 53:132\u2013153","DOI":"10.1007\/s00453-007-9018-5"},{"key":"316_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/0-387-23466-7_5","volume-title":"Advances in pervasive computing and networking","author":"A Khandani","year":"2005","unstructured":"Khandani A, Modiano E, Abounadi J, Zheng L (2005) Cooperative routing in wireless networks. In: Szymanski B, Bulent Y (eds) Advances in pervasive computing and networking. Springer, US, pp 97\u2013117"},{"key":"316_CR7","doi-asserted-by":"crossref","first-page":"2185","DOI":"10.1109\/TCOMM.2007.908538","volume":"55","author":"A Khandani","year":"2007","unstructured":"Khandani A, Abounadi J, Modiano E, Zheng L (2007) Cooperative routing in static wireless networks. IEEE Trans Commun 55:2185\u20132192","journal-title":"IEEE Trans Commun"},{"key":"316_CR8","doi-asserted-by":"crossref","unstructured":"K\u00f3czy L\u00c1 (2007) A recursive core for partition function form games. Theory Decis 63(1):41\u201351","DOI":"10.1007\/s11238-007-9030-x"},{"issue":"1","key":"316_CR9","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.geb.2008.04.002","volume":"66","author":"L\u00c1 K\u00f3czy","year":"2009","unstructured":"K\u00f3czy L\u00c1 (2009) Sequential coalition formation and the core in the presence of externalities. Games Econ Behav 66(1):559\u2013565","journal-title":"Games Econ Behav"},{"key":"316_CR10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1109\/90.554730","volume":"5","author":"Y Korilis","year":"1997","unstructured":"Korilis Y, Lazar A, Orda A (1997) Achieving network optima using stackelberg routing strategies. IEEE\/ACM Trans Netw 5:161\u2013173","journal-title":"IEEE\/ACM Trans Netw"},{"key":"316_CR11","doi-asserted-by":"crossref","unstructured":"Koutsoupias E, Papadimitriou C (2009) Worst-case equilibria. Comput Sci Rev 3(2):65\u201369","DOI":"10.1016\/j.cosrev.2009.04.003"},{"key":"316_CR12","doi-asserted-by":"crossref","unstructured":"Nisan N, Roughgarden T, Tardos E, Vazirani V (2007) Algorithmic game theory. Cambridge University Press, 32 Avenue of the Americas, New York, NY 10013\u20132473, USA","DOI":"10.1017\/CBO9780511800481"},{"key":"316_CR13","volume-title":"The economics of welfare","author":"A Pigou","year":"1920","unstructured":"Pigou A (1920) The economics of welfare. Macmillan, London"},{"key":"316_CR14","doi-asserted-by":"crossref","unstructured":"Roughgarden T (2005) Selfish routing and the price of anarchy. MIT Press, 55 Hayward Street Cambridge, MA 02142\u20131493 USA","DOI":"10.21236\/ADA637949"},{"key":"316_CR15","doi-asserted-by":"crossref","unstructured":"Roughgarden T (2006) Selfish routing and the price of anarchy. Tech. report, Department of Computer Science, Stanford University. http:\/\/theory.stanford.edu\/tim\/papers\/optima.pdf","DOI":"10.21236\/ADA637949"},{"issue":"4","key":"316_CR16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1002\/nav.3800100126","volume":"10","author":"RM Thrall","year":"1963","unstructured":"Thrall RM, Lucas WF (1963) $$n$$ n -person games in partition function form. Naval Res Logist Q 10(4):281\u2013298","journal-title":"Naval Res Logist Q"},{"key":"316_CR17","first-page":"325","volume":"1","author":"J Wardrop","year":"1952","unstructured":"Wardrop J (1952) Some theoretical aspects of road traffic research communication networks. Proc Inst Civil Eng 1:325\u2013378","journal-title":"Proc Inst Civil Eng"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-013-0316-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-013-0316-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-013-0316-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T20:21:48Z","timestamp":1563308508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-013-0316-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,4]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["316"],"URL":"https:\/\/doi.org\/10.1007\/s10100-013-0316-5","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,4]]}}}