{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:59:28Z","timestamp":1725728368057},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_25","type":"book-chapter","created":{"date-parts":[[2013,6,2]],"date-time":"2013-06-02T21:03:04Z","timestamp":1370206984000},"page":"283-297","source":"Crossref","is-referenced-by-count":0,"title":["Potential Functions in Strategic Games"],"prefix":"10.1007","author":[{"given":"Paul G.","family":"Spirakis","sequence":"first","affiliation":[]},{"given":"Panagiota N.","family":"Panagopoulou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-92185-1_16","volume-title":"Internet and Network Economics","author":"V. Bil\u00f2","year":"2008","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Moscardelli, L.: Graphical Congestion Games. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 70\u201381. Springer, Heidelberg (2008)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Chen, X., Xiaotie, D.: Settling the complexity of two-player Nash equilibrium. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 261\u2013272 (2006)","DOI":"10.1109\/FOCS.2006.69"},{"key":"25_CR3","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 169\u2013178 (2007)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"D\u00edaz, J., Goldberg, L.A., Mertzios, G.B., Richerby, D., Serna, M.J., Spirakis, P.G.: Approximating fixation probabilities in the generalized Moran process. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 954\u2013960 (2012)","DOI":"10.1137\/1.9781611973099.76"},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1998.1587","volume":"57","author":"U. Feige","year":"1998","unstructured":"Feige, U., Kilian, J.: Zero knowledge and the chromatic number. J. Comput. System Sci.\u00a057(2), 187\u2013199 (1998)","journal-title":"J. Comput. System Sci."},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-642-10841-9_29","volume-title":"Internet and Network Economics","author":"D. Fotakis","year":"2009","unstructured":"Fotakis, D., Gkatzelis, V., Kaporis, A.C., Spirakis, P.G.: The Impact of Social Ignorance on Weighted Congestion Games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 316\u2013327. Springer, Heidelberg (2009)"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s00224-009-9198-2","volume":"47","author":"D. Fotakis","year":"2010","unstructured":"Fotakis, D., Kaporis, A.C., Spirakis, P.G.: Atomic congestion games: fast, myopic and concurrent. Theory Comput. Syst.\u00a047(1), 38\u201359 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"25_CR8","first-page":"52","volume":"4","author":"D. Fotakis","year":"2008","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.G.: Atomic congestion games among coalitions. ACM Transactions on Algorithms (TALG) 4(4), article No. 52 (2008)","journal-title":"ACM Transactions on Algorithms (TALG)"},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D. Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.G.: Selfish unsplittable flows. Theoretical Computer Science\u00a0348(2), 226\u2013239 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"502","DOI":"10.2307\/1426671","volume":"14","author":"B. Hajek","year":"1982","unstructured":"Hajek, B.: Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability\u00a014(3), 502\u2013525 (1982)","journal-title":"Advances in Applied Probability"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J. He","year":"2001","unstructured":"He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence\u00a0127, 57\u201385 (2001)","journal-title":"Artificial Intelligence"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1038\/nature03204","volume":"433","author":"E. Lieberman","year":"2005","unstructured":"Lieberman, E., Hauert, C., Nowak, M.A.: Evolutionary dynamics on graphs. Nature\u00a0433, 312\u2013316 (2005)","journal-title":"Nature"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.: Potential games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Non-cooperative games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"issue":"3","key":"25_CR15","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences\u00a048(3), 498\u2013532 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Panagopoulou, P.N., Spirakis, P.G.: Algorithms for pure Nash equilibria in weighted congestion games. ACM Journal of Experimental Algorithmics 11 (2006)","DOI":"10.1145\/1187436.1216584"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-92182-0_19","volume-title":"Algorithms and Computation","author":"P.N. Panagopoulou","year":"2008","unstructured":"Panagopoulou, P.N., Spirakis, P.G.: A game theoretic approach for efficient graph coloring. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 183\u2013195. Springer, Heidelberg (2008)"},{"issue":"9","key":"25_CR18","doi-asserted-by":"publisher","first-page":"771","DOI":"10.4169\/amer.math.monthly.119.09.771","volume":"119","author":"P.N. Panagopoulou","year":"2012","unstructured":"Panagopoulou, P.N., Spirakis, P.G.: Playing a game to bound the chromatic number. The American Mathematical Monthly\u00a0119(9), 771\u2013778 (2012)","journal-title":"The American Mathematical Monthly"},{"key":"25_CR19","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"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journals of Mathematics\u00a05, 285\u2013308 (1955)","journal-title":"Pacific Journals of Mathematics"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1137\/0317054","volume":"17","author":"D. Topkis","year":"1979","unstructured":"Topkis, D.: Equilibrium points in nonzero-sum n-person submodular games. SIAM Journal of Control and Optimization\u00a017, 773\u2013787 (1979)","journal-title":"SIAM Journal of Control and Optimization"},{"issue":"6","key":"25_CR22","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.jmateco.2011.10.002","volume":"47","author":"H. Uno","year":"2011","unstructured":"Uno, H.: Strategic complementarities and nested potential games. Journal of Mathematical Economics\u00a047(6), 728\u2013732 (2011)","journal-title":"Journal of Mathematical Economics"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:18:41Z","timestamp":1557749921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}