{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:24:31Z","timestamp":1725888271783},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592497"},{"type":"electronic","value":"9783319592503"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59250-3_36","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T09:04:39Z","timestamp":1495530279000},"page":"442-454","source":"Crossref","is-referenced-by-count":1,"title":["Equilibrium Computation in Atomic Splittable Singleton Congestion Games"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Harks","sequence":"first","affiliation":[]},{"given":"Veerle","family":"Timmermans","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"issue":"6","key":"36_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1455248.1455249","volume":"55","author":"H Ackermann","year":"2008","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6), 1\u201322 (2008)","journal-title":"J. ACM"},{"issue":"17","key":"36_CR2","doi-asserted-by":"crossref","first-page":"1552","DOI":"10.1016\/j.tcs.2008.12.035","volume":"410","author":"H Ackermann","year":"2009","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: Pure Nash equilibria in player-specific and weighted congestion games. Theoret. Comput. Sci. 410(17), 1552\u20131563 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"36_CR3","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.2014.0688","volume":"40","author":"U Bhaskar","year":"2015","unstructured":"Bhaskar, U., Fleischer, L., Hoy, D., Huang, C.-C.: Equilibria of atomic flow games are not unique. Math. Oper. Res. 40(3), 634\u2013654 (2015)","journal-title":"Math. Oper. Res."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Efficient computation of approximate pure Nash equilibria in congestion games. In: FOCS, Palm Springs, CA, USA, pp. 532\u2013541 (2011)","DOI":"10.1109\/FOCS.2011.50"},{"issue":"1","key":"36_CR5","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/2614687","volume":"3","author":"I Caragiannis","year":"2015","unstructured":"Caragiannis, I., Fanelli, A., Gravin, N., Skopalik, A.: Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure. ACM Trans. Econ. Comput. 3(1), 2 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"3","key":"36_CR6","doi-asserted-by":"crossref","first-page":"14:1","DOI":"10.1145\/1516512.1516516","volume":"56","author":"X Chen","year":"2009","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3), 14:1\u201314:55 (2009)","journal-title":"J. ACM"},{"issue":"2","key":"36_CR7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.geb.2009.05.004","volume":"71","author":"S Chien","year":"2011","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. Games Econom. Behav. 71(2), 315\u2013327 (2011)","journal-title":"Games Econom. Behav."},{"issue":"6","key":"36_CR8","doi-asserted-by":"crossref","first-page":"1421","DOI":"10.1287\/opre.1080.0653","volume":"57","author":"R Cominetti","year":"2009","unstructured":"Cominetti, R., Correa, J.R., Stier-Moses, N.E.: The impact of oligopolistic competition in networks. Oper. Res. 57(6), 1421\u20131437 (2009)","journal-title":"Oper. Res."},{"issue":"1","key":"36_CR9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195\u2013259 (2009)","journal-title":"SIAM J. Comput."},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-662-53354-3_2","volume-title":"Algorithmic Game Theory","author":"A Deligkas","year":"2016","unstructured":"Deligkas, A., Fearnley, J., Spirakis, P.: Lipschitz continuity and approximate equilibria. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 15\u201326. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-53354-3_2"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Babai, L. (ed.) STOC, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"issue":"3","key":"36_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1978782.1978786","volume":"7","author":"M Gairing","year":"2011","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Routing (un-)splittable flow in games with player-specific linear latency functions. ACM Trans. Algorithms 7(3), 1\u201331 (2011)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"36_CR13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0377-2217(91)90300-K","volume":"54","author":"H Groenevelt","year":"1991","unstructured":"Groenevelt, H.: Two algorithms for maximizing a separable concave function over a polymatroid feasible region. Eur. J. Oper. Res. 54(2), 227\u2013236 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"36_CR14","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1007\/s00224-010-9269-4","volume":"48","author":"T Harks","year":"2011","unstructured":"Harks, T.: Stackelberg strategies and collusion in network games with splittable flow. Theory Comput. Syst. 48, 781\u2013802 (2011)","journal-title":"Theory Comput. Syst."},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-13129-0_14","volume-title":"Web and Internet Economics","author":"T Harks","year":"2014","unstructured":"Harks, T., Klimm, M., Peis, B.: Resource competition on integral polymatroids. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 189\u2013202. Springer, Cham (2014). doi: 10.1007\/978-3-319-13129-0_14"},{"key":"36_CR16","unstructured":"Harks, T., Klimm, M., Peis, B.: Sensitivity analysis for convex separable optimization over integral polymatroids (2016). https:\/\/arxiv.org\/pdf\/1611.05372.pdf"},{"key":"36_CR17","unstructured":"Harks, T., Timmermans, V.: Equilibrium computation in atomic splittable singleton congestion games (2016). https:\/\/arxiv.org\/pdf\/1612.00190.pdf"},{"key":"36_CR18","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/net.3230150303","volume":"15","author":"A Haurie","year":"1985","unstructured":"Haurie, A., Marcotte, P.: On the relationship between Nash-Cournot and Wardrop equilibria. Networks 15, 295\u2013308 (1985)","journal-title":"Networks"},{"issue":"4","key":"36_CR19","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s00224-012-9421-4","volume":"52","author":"C-C Huang","year":"2013","unstructured":"Huang, C.-C.: Collusion in atomic splittable routing games. Theory Comput. Syst. 52(4), 763\u2013801 (2013)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"36_CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/9.557575","volume":"42","author":"Y Korilis","year":"1997","unstructured":"Korilis, Y., Lazar, A., Orda, A.: Capacity allocation under noncooperative routing. IEEE Trans. Aut. Contr. 42(3), 309\u2013325 (1997)","journal-title":"IEEE Trans. Aut. Contr."},{"issue":"7","key":"36_CR21","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1109\/49.414643","volume":"13","author":"YA Korilis","year":"1995","unstructured":"Korilis, Y.A., Lazar, A.A., Orda, A.: Architecting noncooperative networks. IEEE J. Sel. Areas Commun. 13(7), 1241\u20131251 (1995)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), San Diego, California, USA, June 9\u201312, pp. 36\u201341 (2003)","DOI":"10.1145\/779928.779933"},{"issue":"11","key":"36_CR23","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1057\/jors.1987.175","volume":"38","author":"P Marcotte","year":"1987","unstructured":"Marcotte, P.: Algorithms for the network oligopoly problem. J. Oper. Res. Soc. 38(11), 1051\u20131065 (1987)","journal-title":"J. Oper. Res. Soc."},{"key":"36_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-45046-4_30","volume-title":"Web and Internet Economics","author":"F Meunier","year":"2013","unstructured":"Meunier, F., Pradeau, T.: A lemke-like algorithm for the multiclass network equilibrium problem. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 363\u2013376. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-45046-4_30"},{"key":"36_CR25","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1109\/90.251910","volume":"1","author":"A Orda","year":"1993","unstructured":"Orda, A., Rom, R., Shimkin, N.: Competitive routing in multi-user communication networks. IEEE\/ACM Trans. Network. 1, 510\u2013521 (1993)","journal-title":"IEEE\/ACM Trans. Network."},{"key":"36_CR26","doi-asserted-by":"crossref","unstructured":"A. D. Pia, M. Ferris, and C. Michini. Totally unimodular congestion games. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (to appear, 2017)","DOI":"10.1137\/1.9781611974782.37"},{"issue":"1","key":"36_CR27","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/moor.1060.0229","volume":"32","author":"O Richman","year":"2007","unstructured":"Richman, O., Shimkin, N.: Topological uniqueness of the Nash equilibrium for selfish routing with atomic users. Math. Oper. Res. 32(1), 215\u2013232 (2007)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"36_CR28","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R Rosenthal","year":"1973","unstructured":"Rosenthal, R.: A class of games possessing pure-strategy Nash equilibria. Internat. J. Game Theor. 2(1), 65\u201367 (1973)","journal-title":"Internat. J. Game Theor."},{"key":"36_CR29","doi-asserted-by":"crossref","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of pure Nash equilibria. In: Proceedings of the 40th Annual ACM Syposium Theory Computing, pp. 355\u2013364 (2008)","DOI":"10.1145\/1374376.1374428"},{"key":"36_CR30","doi-asserted-by":"crossref","unstructured":"Tran-Thanh, L., Polukarov, M., Chapman, A., Rogers, A., Jennings, N.: On the existence of pure strategy Nash equilibria in integer-splittable weighted congestion games. In: Persiano, G. (ed.) SAGT, pp. 236\u2013253 (2011)","DOI":"10.1007\/978-3-642-24829-0_22"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59250-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T19:50:15Z","timestamp":1569354615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59250-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592497","9783319592503"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59250-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}