{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:10:10Z","timestamp":1746295810694,"version":"3.40.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_44","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"513-524","source":"Crossref","is-referenced-by-count":1,"title":["On the Performance of Mildly Greedy Players in Cut Games"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Mauro","family":"Paladini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. Journal of the ACM\u00a055(6) (2008)","DOI":"10.1145\/1455248.1455249"},{"key":"44_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: Proceedings of the 9th ACM Conference on Electronic Commerce (EC), pp. 264\u2013273. ACM Press (2008)","DOI":"10.1145\/1386790.1386832"},{"key":"44_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-10841-9_33","volume-title":"Internet and Network Economics","author":"A. Bhalgat","year":"2009","unstructured":"Bhalgat, A., Chakraborty, T., Khanna, S.: Nash Dynamics in Congestion Games with Similar Resources. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 362\u2013373. Springer, Heidelberg (2009)"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Bhalgat, A., Chakraborty, T., Khanna, S.: Approximating Pure Nash Equilibrium in Cut, Party Affiliation, and Satisfiability Games. In: Proceedings of the 11th ACM Conference on Electronic Commerce (EC), pp. 73\u201382. ACM Press (2010)","DOI":"10.1145\/1807342.1807353"},{"key":"44_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-38016-7_18","volume-title":"Approximation and Online Algorithms","author":"V. Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, V.: A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol.\u00a07846, pp. 215\u2013228. Springer, Heidelberg (2013)"},{"issue":"1","key":"44_CR6","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s00224-010-9309-0","volume":"49","author":"V. Bil\u00f2","year":"2011","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Moscardelli, L.: Performance of One-Round Walks in Linear Congestion Games. Theory of Computing Systems\u00a049(1), 24\u201345 (2011)","journal-title":"Theory of Computing Systems"},{"key":"44_CR7","unstructured":"Bil\u00f2, V., Flammini, M., Monaco, G., Moscardelli, L.: Some Anomalies of Farsighted Strategic Behavior. Theory of Computing Systems (to appear)"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. In: Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 532\u2013541. IEEE Computer Society (2011)","DOI":"10.1109\/FOCS.2011.50"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. In: Proceedings of the ACM Conference on Electronic Commerce (EC), pp. 284\u2013301. ACM Press (2012)","DOI":"10.1145\/2229012.2229036"},{"issue":"3","key":"44_CR10","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s00453-010-9427-8","volume":"61","author":"I. Caragiannis","year":"2011","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight Bounds for Selfish and Greedy Load Balancing. Algorithmica\u00a061(3), 606\u2013637 (2011)","journal-title":"Algorithmica"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.: Settling the Complexity of Computing Two-Player Nash Equilibria. Journal of ACM\u00a056(3) (2009)","DOI":"10.1145\/1516512.1516516"},{"issue":"2","key":"44_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.geb.2009.05.004","volume":"71","author":"S. Chien","year":"2001","unstructured":"Chien, S., Sinclair, A.: Convergence to Approximate Nash Equilibria in Congestion Games. Games and Economic Behavior\u00a071(2), 315\u2013327 (2001)","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"44_CR13","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s00453-010-9449-2","volume":"61","author":"G. Christodoulou","year":"2011","unstructured":"Christodoulou, G., Koutsoupias, E., Spirakis, P.G.: On the Performance of Approximate Equilibria in Congestion Games. Algorithmica\u00a061(1), 116\u2013140 (2011)","journal-title":"Algorithmica"},{"key":"44_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2012.02.033","volume":"438","author":"G. Christodoulou","year":"2012","unstructured":"Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and Approximation in Potential Games. Theoretical Computer Science\u00a0438, 13\u201327 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"44_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/1461928.1461951","volume":"52","author":"K. Daskalakis","year":"2009","unstructured":"Daskalakis, K., Goldberg, P.W., Papadimitriou, C.H.: The Complexity of Computing a Nash Equilibrium. Communications of ACM\u00a052(2), 89\u201397 (2009)","journal-title":"Communications of ACM"},{"key":"44_CR16","unstructured":"Daskalakis, K., Papadimitriou, C.H.: Three-Player Games Are Hard. Electronic Colloquium on Computational Complexity (ECCC)\u00a0(139) (2005)"},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The Complexity of Pure Nash Equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 604\u2013612. ACM Press (2004)","DOI":"10.1145\/1007352.1007445"},{"issue":"3","key":"44_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/2229163.2229169","volume":"8","author":"A. Fanelli","year":"2012","unstructured":"Fanelli, A., Flammini, M., Moscardelli, L.: The Speed of Convergence in Congestion Games Under Best-response Dynamics. ACM Transactions on Algorithms\u00a08(3), 25 (2012)","journal-title":"ACM Transactions on Algorithms"},{"issue":"5","key":"44_CR19","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00446-011-0145-5","volume":"24","author":"A. Fanelli","year":"2011","unstructured":"Fanelli, A., Moscardelli, L.: On Best-response Dynamics in Weighted Congestion Games with Polynomial Delays. Distributed Computing\u00a024(5), 245\u2013254 (2011)","journal-title":"Distributed Computing"},{"key":"44_CR20","doi-asserted-by":"crossref","unstructured":"Goemans, M.X., Mirrokni, V.S., Vetta, A.: Sink Equilibria and Convergence. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 142\u2013154. IEEE Computer Society (2005)","DOI":"10.1109\/SFCS.2005.68"},{"key":"44_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"44_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-27821-4_17","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"V.S. Mirrokni","year":"2004","unstructured":"Mirrokni, V.S., Vetta, A.: Convergence Issues in Competitive Games. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX and RANDOM 2004. LNCS, vol.\u00a03122, pp. 183\u2013194. Springer, Heidelberg (2004)"},{"key":"44_CR23","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":"44_CR24","doi-asserted-by":"crossref","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of Pure Nash Equilibria. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 355\u2013364. ACM Press (2008)","DOI":"10.1145\/1374376.1374428"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:49:10Z","timestamp":1746294550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}