arXiv:1910.02693v2 [cs.GT] 12 Mar 2021 eeat hs r aia ah osrce ysatn a starting by constructed paths maximal compute are efficiently These be can relevant. equilibrium an whether is concern cor Courno and exist instance do for equilibria) games, Nash just various now, In (from equilibria Nas exist. strategy always mixed not s a wh about need of reason in existence to strategy guarantees used joint theorem widely Nash’s a been has is natura which game a concept strategic in solution a equilibria Nash of pure equilibrium with Nash concerned is paper This Background 1.1 Introduction 1 nmn cnro fsrtgcitrcin pr rmteq the from apart interaction, strategic of scenarios many In aepolm o oyarxgmsaesrnl NP-hard. strongly are graphs games unweighted polymatrix for for already problems same NP-complete is games these in weights the on conditions imposed the without sw that protection sense ring the corr Ethernet cycles the simple on of G.8032v2 chains recommendation open while networks, area local illnt laseit n,a osqec,a(ue Nas (pure) a consequence, a time. as polynomial and, exist, always length mial coo of idea the capture games strategy These same strategy. the given chose a who picking players from edges the on weights ial,w rv httepolmo eemnn h existe the determining of problem the that prove we Finally, topo network in typical are graphs of classes considered The esuysrtgcgmso egtddrce rps nwhi in graphs, directed weighted on games strategic study We eietf aua lse fgah o hc nt improv finite which for graphs of classes natural identify We oriainGmso egtdDrce Graphs Directed Weighted on Games Coordination nvriyo iepo,Lvrol U.K. Liverpool, Liverpool, of University IU,Uiest fWra,Poland Warsaw, of University MIMUW, W,Asedm h Netherlands, The Amsterdam, CWI, I apr apr India Kanpur, Kanpur, IIT oii Wojtczak Dominik ryzo .Apt R. Krzysztof ui Simon Sunil Abstract 1 epn ontrloutcomes. natural to respond sodt utpeidpnetrnstplg rmthe from topology rings independent multiple to espond nabtayjitsrtg n loigasnl player single a allowing and strategy joint arbitrary an t dnto nteasneo lblycmo strategies. common globally of absence the in rdination .I hscnettecneto an of concept the context this In d. n oue aheulbimmyntee exist. even not may equilibrium Nash a bonuses and eto fteeitneo aheulbi,a important an equilibria, Nash of existence the of uestion qiiru o l nt ae,pr ahequilibria Nash pure games, finite all for equilibrium h qiiru rasrn qiiru a efudin found be can equilibrium strong a or equilibrium h thn.Frsml ylsteerslsaeotmlin optimal are results these cycles simple For itching. ucaso taei omgms ealta pure a that Recall games. form strategic of subclass l umne yafie o-eaieitgrbnsfor bonus integer non-negative fixed a by augmented , optto ae rcneto ae,pr Nash pure games, congestion or games competition t rtgcitrcinbtenrtoa gns Although agents. rational between interaction trategic c ahpae ly etrsos.I sanatural a is It response. best a plays player each ich n ihn oue sue.Ti mle htthe that implies This assumed. bonuses no with and c faNs qiiru ro togequilibrium strong a of or equilibrium Nash a of nce htepyf fapae sdfie stesmo the of sum the as defined is player a of payoff the ch ois ipecce orsodt h oe ring token the to correspond cycles simple logies: mn rcaiinipoeetptso polyno- of paths coalition-improvement or ement mrvmn path improvement is who does not hold a best response to switch to a better strategy at each stage. By definition, every finite improvement path terminates in a Nash equilibrium. In a seminal paper [40], Monderer and Shapley identified the class of finite games in which every improvement path is guaranteed to be finite, and coined this property as the finite improvement property (FIP). These are games with which one can associate a generalised ordinal potential, a function on the set of joint strategies that properly tracks the qualitative change in player