{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:15:37Z","timestamp":1740122137445,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T00:00:00Z","timestamp":1566604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T00:00:00Z","timestamp":1566604800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10458-019-09420-2","type":"journal-article","created":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T16:02:23Z","timestamp":1566662543000},"page":"798-820","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multi-player flow games"],"prefix":"10.1007","volume":"33","author":[{"given":"Shibashis","family":"Guha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8201-286X","authenticated-orcid":false,"given":"Gal","family":"Vardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,24]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Agarwal, S., Kodialam, M. S., & Lakshman, T. V. (2013). Traffic engineering in software defined networks. In Proceedings of 32nd IEEE international conference on computer communications, pp. 2211\u20132219.","key":"9420_CR1","DOI":"10.1109\/INFCOM.2013.6567024"},{"key":"9420_CR2","volume-title":"Network flows: Theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Englewood Cliffs: Prentice Hall."},{"unstructured":"Almagor, S., Avni, G., & Kupferman, O. (2015). Automatic generation of quality specifications. In Proceedings of 26th international conference on concurrency theory, vol.\u00a042, pp. 325\u2013339.","key":"9420_CR3"},{"issue":"4","key":"9420_CR4","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., & Roughgarden, T. (2008). The price of stability for network design with fair cost allocation. SIAM Journal on Computing, 38(4), 1602\u20131623.","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Armbruster, A., Gosnell, M., McMillin, B., & Crow, M. L. (2005). Power transmission control using distributed max-flow. In Computer software and applications conference, 2005. COMPSAC 2005. 29th annual international, vol.\u00a01, pp. 256\u2013263. IEEE.","key":"9420_CR5","DOI":"10.1109\/COMPSAC.2005.121"},{"key":"9420_CR6","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TSE.1983.234958","volume":"4","author":"TY Cheung","year":"1983","unstructured":"Cheung, T. Y. (1983). Graph traversal techniques and the maximum flow problem in distributed computation. IEEE Transactions on Software Engineering, 4, 504\u2013512.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"9420_CR7","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms. Cambridge: MIT Press."},{"issue":"5","key":"9420_CR8","first-page":"1277","volume":"11","author":"EA Dinic","year":"1970","unstructured":"Dinic, E. A. (1970). Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Mathematics Doklady, 11(5), 1277\u20131280. (English translation by RF. Rinehart).","journal-title":"Soviet Mathematics Doklady"},{"issue":"2","key":"9420_CR9","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., & Karp, R. M. (1972). Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2), 248\u2013264.","journal-title":"Journal of the ACM"},{"issue":"4","key":"9420_CR10","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"Even, S., Itai, A., & Shamir, A. (1976). On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing, 5(4), 691\u2013703.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"9420_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00446-005-0122-y","volume":"18","author":"J Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Papadimitriou, C. H., Sami, R., & Shenker, S. (2005). A BGP-based mechanism for lowest-cost routing. Distributed Computing, 18(1), 61\u201372.","journal-title":"Distributed Computing"},{"issue":"3","key":"9420_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8(3), 399\u2013404.","journal-title":"Canadian Journal of Mathematics"},{"key":"9420_CR13","doi-asserted-by":"crossref","DOI":"10.1515\/9781400875184","volume-title":"Flows in networks","author":"LR Ford","year":"1962","unstructured":"Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton University Press."},{"doi-asserted-by":"crossref","unstructured":"Goldberg, A. V., Tardos, \u00c9., & Tarjan, R. E. (1989). Network flow algorithms. Technical report, DTIC Document.","key":"9420_CR14","DOI":"10.21236\/ADA214689"},{"issue":"4","key":"9420_CR15","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A. V., & Tarjan, R. E. (1988). A new approach to the maximum-flow problem. Journal of the ACM, 35(4), 921\u2013940.","journal-title":"Journal of the ACM"},{"issue":"3","key":"9420_CR16","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1287\/moor.7.3.476","volume":"7","author":"E Kalai","year":"1982","unstructured":"Kalai, E., & Zemel, E. (1982). Totally balanced games and games of flow. Mathematics of Operations Research, 7(3), 476\u2013478.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"9420_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., & Papadimitriou, C. (2009). Worst-case equilibria. Computer Science Review, 3(2), 65\u201369.","journal-title":"Computer Science Review"},{"unstructured":"Kupferman, O., Vardi, G., & Vardi, M. Y. (2017). Flow games. In Proceedings of 37th conference on foundations of software technology and theoretical computer science, vol.\u00a093 of Leibniz international proceedings in informatics (LIPIcs), pp. 38:38\u201338:16.","key":"9420_CR18"},{"doi-asserted-by":"crossref","unstructured":"Lichtenstein, O., & Pnueli, A. (1985). Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of 12th ACM symposium on principles of programming languages, pp. 97\u2013107.","key":"9420_CR19","DOI":"10.1145\/318593.318622"},{"doi-asserted-by":"crossref","unstructured":"Nash, J. F. (1950). Equilibrium points in n-person games. In Proceedings of the National Academy of Sciences of the USA.","key":"9420_CR20","DOI":"10.1073\/pnas.36.1.48"},{"key":"9420_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., & Vazirani, V. V. (2007). Algorithmic game theory. Cambridge: Cambridge University Press."},{"key":"9420_CR22","first-page":"1","volume-title":"Automata, Languages and Programming","author":"Christos H. Papadimitriou","year":"2001","unstructured":"Papadimitriou, C. H. (2001). Algorithms, games, and the internet. In Proceedings of 33rd ACM symposium on theory of computing, pp. 749\u2013753."},{"doi-asserted-by":"crossref","unstructured":"Pnueli, A., & Rosner, R. (1989). On the synthesis of a reactive module. In Proceedings of 16th ACM symposium on principles of programming languages, pp. 179\u2013190.","key":"9420_CR23","DOI":"10.1145\/75277.75293"},{"issue":"3","key":"9420_CR24","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"\u00c9 Tardos","year":"1985","unstructured":"Tardos, \u00c9. (1985). A strongly polynomial minimum cost circulation algorithm. Combinatorica, 5(3), 247\u2013255.","journal-title":"Combinatorica"},{"issue":"2","key":"9420_CR25","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/2602204.2602216","volume":"44","author":"S Vissicchio","year":"2014","unstructured":"Vissicchio, S., Vanbever, L., & Bonaventure, O. (2014). Opportunities and research challenges of hybrid software defined networks. Computer Communication Review, 44(2), 70\u201375.","journal-title":"Computer Communication Review"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-019-09420-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-019-09420-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-019-09420-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,17]],"date-time":"2021-01-17T10:28:37Z","timestamp":1610879317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-019-09420-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,24]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["9420"],"URL":"https:\/\/doi.org\/10.1007\/s10458-019-09420-2","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2019,8,24]]},"assertion":[{"value":"24 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}