{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:55Z","timestamp":1740122395641,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T00:00:00Z","timestamp":1543449600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003549","name":"Orsz\u00e1gos Tudom\u00e1nyos Kutat\u00e1si Alapprogramok","doi-asserted-by":"publisher","award":["124171","108947"],"award-info":[{"award-number":["124171","108947"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fels\u0151oktat\u00e1si Int\u00e9zm\u00e9nyi Kiv\u00e1l\u00f3s\u00e1gi Program","award":["BME FIKP-MI\/SC"],"award-info":[{"award-number":["BME FIKP-MI\/SC"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10878-018-0366-7","type":"journal-article","created":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T10:41:47Z","timestamp":1543488107000},"page":"72-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hitting a path: a generalization of weighted connectivity via game theory"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8159-0839","authenticated-orcid":false,"given":"D\u00e1vid","family":"Szeszl\u00e9r","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,29]]},"reference":[{"key":"366_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511760778","volume-title":"Network security: a decision and game-theoretic approach","author":"T Alpcan","year":"2010","unstructured":"Alpcan T, Ba\u015far T (2010) Network security: a decision and game-theoretic approach. Cambridge University Press, Cambridge"},{"key":"366_CR2","doi-asserted-by":"publisher","unstructured":"Ba\u00efou M, Barahona F (2018) Faster algorithms for security games on matroids. Algorithmica. \n                    https:\/\/doi.org\/10.1007\/s00453-018-0466-x","DOI":"10.1007\/s00453-018-0466-x"},{"key":"366_CR3","doi-asserted-by":"crossref","unstructured":"Calinescu G, Kapoor S, Quinn M, Shin J (2012) Adversary games in secure\/reliable network routing. In: Proceedings of game theory for networks: second international ICST conference, GameNets 2011, Shanghai, China. Springer, Berlin, pp 249-264","DOI":"10.1007\/978-3-642-30373-9_18"},{"issue":"3","key":"366_CR4","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01240739","volume":"11","author":"E Cohen","year":"1994","unstructured":"Cohen E, Megiddo N (1994) Algorithms and complexity analysis for some flow problems. Algorithmica 11(3):320\u2013340","journal-title":"Algorithmica"},{"issue":"3","key":"366_CR5","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/3828.3829","volume":"32","author":"WH Cunningham","year":"1985","unstructured":"Cunningham WH (1985) Optimal attack and reinforcement of a network. J ACM (JACM) 32(3):549\u2013561","journal-title":"J ACM (JACM)"},{"key":"366_CR6","doi-asserted-by":"crossref","unstructured":"Gueye A, Walrand J C, Anantharam V (2010) Design of network topology in an adversarial environment. In: Proceedings of the 1st international conference on decision and game theory for security, GameSec10, Berlin, Germany, pp 1\u201320","DOI":"10.1007\/978-3-642-17197-0_1"},{"key":"366_CR7","unstructured":"Gueye A, Walrand J C, Anantharam V (2011) A network topology design game: how to choose communication links in an adversarial environment. In: Proceedings of the 2nd international ICST conference on game theory for networks, GameNets, vol 11"},{"issue":"2","key":"366_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0020-0190(83)90031-5","volume":"16","author":"D Gusfield","year":"1983","unstructured":"Gusfield D (1983) Connectivity and edge-disjoint spanning trees. Inf Process Lett 16(2):87\u201389","journal-title":"Inf Process Lett"},{"key":"366_CR9","volume-title":"Game theory in wireless and communication networks: theory, models, and applications","author":"Z Han","year":"2012","unstructured":"Han Z (2012) Game theory in wireless and communication networks: theory, models, and applications. Cambridge University Press, Cambridge"},{"key":"366_CR10","unstructured":"Laszka A, Szeszl\u00e9r D (2015) Hide and seek in digital communication: the steganography game. In: Proceedings 9th Hungarian\u2013Japanese symposium on discrete mathematics and its applications, Fukuoka, Japan, pp 126\u2013136"},{"issue":"16","key":"366_CR11","doi-asserted-by":"publisher","first-page":"3047","DOI":"10.1016\/j.gaceta.2008.07.003","volume":"52","author":"R Machado","year":"2008","unstructured":"Machado R, Tekinay S (2008) A survey of game-theoretic approaches in wireless sensor networks. Comput Netw 52(16):3047\u20133061","journal-title":"Comput Netw"},{"issue":"3","key":"366_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/2480741.2480742","volume":"45","author":"MH Manshaei","year":"2013","unstructured":"Manshaei MH, Zhu Q, Alpcan T, Bacsar T, Hubaux JP (2013) Game theory meets network security and privacy. ACM Comput Surv (CSUR) 45(3):25","journal-title":"ACM Comput Surv (CSUR)"},{"key":"366_CR13","volume-title":"Understanding and using linear programming","author":"J Matou\u0161ek","year":"2007","unstructured":"Matou\u0161ek J, G\u00e4rtner B (2007) Understanding and using linear programming. Springer, Berlin"},{"issue":"1","key":"366_CR14","first-page":"295","volume":"100","author":"JV Neumann","year":"1928","unstructured":"Neumann JV (1928) Zur Theorie der Gesellschaftsspiele. Math Ann 100(1):295\u2013320","journal-title":"Zur Theorie der Gesellschaftsspiele. Math Ann"},{"key":"366_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1142\/9789814354363_0016","volume-title":"Complexity in numerical optimization","author":"T Radzik","year":"1993","unstructured":"Radzik T (1993) Parametric flows, weighted means of cuts and fractional combinatorial optimization. In: Pardalos P (ed) Complexity in numerical optimization. World Scientific Co., Singapore, pp 351\u2013386"},{"key":"366_CR16","volume-title":"Combinatorial optimization: polyhedra and efficiency, algorithms and combinatorics","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency, algorithms and combinatorics, vol 24. Springer, Berlin"},{"issue":"1","key":"366_CR17","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10107-016-1011-9","volume":"161","author":"D Szeszl\u00e9r","year":"2017","unstructured":"Szeszl\u00e9r D (2017) Security games on matroids. Math Program 161(1):347\u2013364","journal-title":"Math Program"},{"key":"366_CR18","unstructured":"Szeszl\u00e9r D (2017) Measuring graph robustness via game theory. In: Proceedings 10th Japanese\u2013Hungarian symposium on discrete mathematics and its applications, Budapest, pp 473\u2013482"},{"key":"366_CR19","volume-title":"Security and game theory: algorithms, deployed systems, lessons learned","author":"M Tambe","year":"2012","unstructured":"Tambe M (2012) Security and game theory: algorithms, deployed systems, lessons learned. Cambridge University Press, New York"},{"issue":"2","key":"366_CR20","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1287\/opre.43.2.243","volume":"43","author":"A Washburn","year":"1995","unstructured":"Washburn A, Wood K (1995) Two-person zero-sum games for network interdiction. Oper Res 43(2):243\u2013251","journal-title":"Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0366-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0366-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0366-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,28]],"date-time":"2019-11-28T19:08:01Z","timestamp":1574968081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0366-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,29]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["366"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0366-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,11,29]]},"assertion":[{"value":"29 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}