{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T02:23:17Z","timestamp":1790907797251,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642108402","type":"print"},{"value":"9783642108419","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10841-9_33","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T12:14:44Z","timestamp":1260274484000},"page":"362-373","source":"Crossref","is-referenced-by-count":8,"title":["Nash Dynamics in Congestion Games with Similar Resources"],"prefix":"10.1007","author":[{"given":"Anand","family":"Bhalgat","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tanmoy","family":"Chakraborty","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. In: FOCS, pp. 613\u2013622 (2006)","DOI":"10.1109\/FOCS.2006.55"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V.S., Skopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: ACM Conference on Electronic Commerce, pp. 264\u2013273 (2008)","DOI":"10.1145\/1386790.1386832"},{"key":"33_CR3","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate nash equilibria in congestion games. In: SODA, pp. 169\u2013178 (2007)"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. In: STACS, pp. 349\u2013360 (2006)","DOI":"10.1007\/11672142_28"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure nash equilibria. In: STOC, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"issue":"5","key":"33_CR6","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1109\/JSAC.2006.872884","volume":"24","author":"M.X. Goemans","year":"2006","unstructured":"Goemans, M.X., Li, L., Mirrokni, V.S., Thottan, M.: Market sharing games applied to content distribution in ad hoc networks. IEEE Journal on Selected Areas in Communications\u00a024(5), 1020\u20131033 (2006)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"1","key":"33_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. Comput. Syst. Sci.\u00a037(1), 79\u2013100 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Noncooperative games. Annals of Mathematics\u00a054, 289\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"33_CR10","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? J. ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"ACM"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of pure nash equilibria. In: STOC, pp. 355\u2013364 (2008)","DOI":"10.1145\/1374376.1374428"},{"key":"33_CR12","volume-title":"Algorithmic Game Theory","author":"E. Tardos","year":"2007","unstructured":"Tardos, E., Wexler, T.: Network formation games and the potential function method. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, ch.\u00a019. Cambridge University, Cambridge (2007)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10841-9_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:35:35Z","timestamp":1606167335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}