{"type":"ScholarlyArticle","title":"An FPTAS for Computing Nash Equilibrium in Resource Graph Games","authors":[{"name":"Hau Chan","slug":"hau-chan","given":"Hau","family":"Chan","affiliation":"University of Nebraska-Lincoln , Lincoln , NE 68588"},{"name":"Albert Xin Jiang","slug":"albert-xin-jiang","given":"Albert Xin","family":"Jiang","affiliation":"Trinity University , San Antonio , TX 78212"}],"abstract":"We consider the problem of computing a mixed-strategy Nash equilibrium (MSNE) in resource graph games (RGGs), a compact representation for games with an exponential number of strategies. In an RGG, each player's pure strategy is a subset of resources, represented by a binary vector, and her pure strategy set is represented compactly using  a set of linear inequality constraints. Given the pure strategies of the players, each player's utility depends on the resource graph and the numbers of times the neighboring resources are used. RGGs are general enough to capture a wide variety of games studied in literature, including congestion games and security games.In this paper, we provide the first Fully Polytnomial Time Approximation Scheme (FPTAS) for computing an MSNE in any symmetric multilinear RGG where its constraint moralized resource graph (a graph formed between the moralized resource graph and the constraints defining the strategy polytope) has bounded treewidth. Our FPTAS can be generalized to compute optimal MSNE, and to games with a constant number of player types. As a consequence, our FPTAS provides new approximation results for security games, network congestion games, and bilinear games.","doi":"10.24963/ijcai.2018/21","url":"https://ijcai.org/proceedings/2018/21","pdf":"https://ijcai.org/proceedings/2018/0021.pdf","markdown":"https://ijcai.org/proceedings/2018/21.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/21","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":21,"pages":{"first":152,"last":158},"keywords":["Agent-based and Multi-agent Systems: Algorithmic Game Theory","Agent-based and Multi-agent Systems: Noncooperative Games"],"videos":[],"references":[{"position":1,"raw":"[Ahmadinejad et al., 2016] Amir Mahdi Ahmadinejad, Sina Dehghani, Mohammad Taghi Hajiaghayi, Brendan Lucier, Hamid Mahini, and Saeed Seddighin. From duels to bat- tlefields: Computing equilibria of blotto and other games. In Proceedings of the Thirtieth AAAI Conference on Arti- ficial Intelligence, AAAI'16, pages 369-375, 2016.","title":"From duels to battlefields: Computing equilibria of blotto and other games","authors":"Sina Amir Mahdi Ahmadinejad, Mohammad Taghi Dehghani, Brendan Hajiaghayi, Hamid Lucier, Saeed Mahini, Seddighin","year":"2016","venue":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI'16","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Barman et al., 2015] Siddharth Barman, Katrina Ligett, and Georgios Piliouras. Approximating nash equilibria in tree polymatrix games. In International Symposium on Algo- rithmic Game Theory, pages 285-296, 2015.","title":"Approximating nash equilibria in tree polymatrix games","authors":"Siddharth Barman, Katrina Ligett, Georgios Piliouras","year":"2015","venue":"International Symposium on Algorithmic Game Theory","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Chan and Jiang, 2016] Hau Chan and Albert Xin Jiang. Congestion games with polytopal strategy spaces. In Pro- ceedings of the Twenty-Fifth International Joint Confer- ence on Artificial Intelligence, IJCAI'16, pages 165-171, 2016.","title":"Congestion games with polytopal strategy spaces","authors":"Chan, Jiang ; ] Hau, Chan, Albert Xin, Jiang","year":"2016","venue":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI'16","doi":null,"url":null,"internal_url":"/proceedings/2016/31"},{"position":4,"raw":"[Chan et al., 2016] Hau Chan, Albert Xin Jiang, Kevin Leyton-Brown, and Ruta Mehta. Multilinear games. In Web and Internet Economics: 12th International Confer- ence, WINE 2016, Montreal, Canada, December 11-14, 2016, Proceedings, pages 44-58, 2016.","title":"Multilinear games","authors":"Albert Xin Hau Chan, Kevin Jiang, Ruta Leyton-Brown, Mehta","year":"2016","venue":"Web and Internet Economics: 12th International Conference, WINE 2016","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chen and Deng, 2006] Xi Chen and Xiaotie Deng. Settling the complexity of 2-player Nash-equilibrium. In FOCS: Proceedings of the Annual IEEE Symposium on Founda- tions of Computer Science, pages 261-272, 2006.","title":"Settling the complexity of 2-player Nash-equilibrium","authors":"Chen, Deng, Xi Chen, Xiaotie Deng","year":"2006","venue":"FOCS: Proceedings of the Annual IEEE Symposium on Foundations of Computer Science","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Daskalakis et al., 2006a] Constantinos Daskalakis, Alex Fabrikant, and Christos H. Papadimitriou. The game world is flat: The complexity of nash equilibria in succinct games. In Proceedings of the 33rd International Confer- ence on Automata, Languages and Programming -Volume Part I, ICALP'06, pages 513-524, 2006.","title":"The game world is flat: The complexity of nash equilibria in succinct games","authors":"Daskalakis","year":"2006","venue":"Proceedings of the 33rd International Conference on Automata, Languages and Programming -Volume Part I, ICALP'06","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Daskalakis et al., 2006b] Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou. The complexity of computing a Nash equilibrium. In STOC: Proceedings of the Annual ACM Symposium on Theory of Computing, pages 71-78, 2006.","title":"The complexity of computing a Nash equilibrium","authors":"Daskalakis","year":"2006","venue":"STOC: Proceedings of the Annual ACM Symposium on Theory of Computing","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Del Pia et al., 2017] Alberto Del Pia, Michael Ferris, and Carla Michini. Totally unimodular congestion games. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '17, pages 577-588, 2017.","title":"Totally unimodular congestion games","authors":"Alberto Del, Pia, Michael Ferris, Carla Michini","year":"2017","venue":"Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '17","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Fabrikant et al., 2004] Alex Fabrikant, Christos Papadim- itriou, and Kunal Talwar. The complexity of pure Nash equilibria. In STOC: Proceedings of the Annual ACM Sym- posium on Theory of Computing, pages 604-612, 2004.","title":"The complexity of pure Nash equilibria","authors":"Alex Fabrikant, Christos Papadimitriou, Kunal Talwar","year":"2004","venue":"STOC: Proceedings of the Annual ACM Symposium on Theory of Computing","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Garg et al., 2011] Jugal Garg, Albert Xin Jiang, and Ruta Mehta. Bilinear games: Polynomial time algorithms for rank based subclasses. In Proceedings of the 7th Inter- national Conference on Internet and Network Economics, WINE'11, pages 399-407, 2011.","title":"Bilinear games: Polynomial time algorithms for rank based subclasses","authors":"Jugal Garg, Albert Xin Jiang, Ruta Mehta","year":"2011","venue":"Proceedings of the 7th International Conference on Internet and Network Economics, WINE'11","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Immorlica et al., 2011] Nicole Immorlica, Adam Tauman Kalai, Brendan Lucier, Ankur Moitra, Andrew Postle- waite, and Moshe Tennenholtz. Dueling algorithms. In Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, STOC '11, pages 215-224, 2011.","title":"Dueling algorithms","authors":"Nicole Immorlica, Adam Tauman Kalai, Brendan Lucier, Ankur Moitra, Andrew Postlewaite, Moshe Tennenholtz","year":"2011","venue":"Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, STOC '11","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Jiang et al., 2017] Albert Jiang, Hau Chan, and Kevin Leyton-Brown. Resource graph games: A compact rep- resentation for games with structured strategy spaces. In Proceedings of the Thirty-First AAAI Conference on Arti- ficial Intelligence, AAAI'17, pages 572-578, 2017.","title":"Resource graph games: A compact representation for games with structured strategy spaces","authors":"Albert Jiang, Hau Chan, Kevin Leyton-Brown","year":"2017","venue":"Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, AAAI'17","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Korzhyk et al., 2010] Dmytro Korzhyk, Vincent Conitzer, and Ronald Parr. Complexity of computing optimal stack- elberg strategies in security resource allocation games. In Proceedings of the Twenty-Fourth AAAI Conference on Ar- tificial Intelligence, AAAI'10, pages 805-810, 2010.","title":"Complexity of computing optimal stackelberg strategies in security resource allocation games","authors":"Korzhyk","year":"2010","venue":"Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI'10","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Korzhyk et al., 2011a] Dmytro Korzhyk, Vincent Conitzer, and Ronald Parr. Security games with multiple attacker resources. In Proceedings of the Twenty-Second Inter- national Joint Conference on Artificial Intelligence, IJ- CAI'11, pages 273-279, 2011.","title":"Security games with multiple attacker resources","authors":"Korzhyk","year":"2011","venue":"Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJ-CAI'11","doi":null,"url":null,"internal_url":"/proceedings/2011/56"},{"position":15,"raw":"[Korzhyk et al., 2011b] Dmytro Korzhyk, Zhengyu Yin, Christopher Kiekintveld, Vincent Conitzer, and Milind Tambe. Stackelberg vs. nash in security games: An extended investigation of interchangeability, equivalence, and uniqueness. J. Artif. Int. Res., 41(2):297-327, 2011.","title":"Stackelberg vs. nash in security games: An extended investigation of interchangeability, equivalence, and uniqueness","authors":"Korzhyk","year":"2011","venue":"J. Artif. Int. Res","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Nash, 1951] John F. Nash. Non-cooperative games. The Annals of Mathematics, 54(2):286-295, 1951.","title":"Non-cooperative games","authors":"John F Nash","year":"1951","venue":"The Annals of Mathematics","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Rabinovich et al., 2009] Zinovi Rabinovich, Enrico Gerd- ing, Maria Polukarov, and Nicholas R. Jennings. Gener- alised fictitious play for a continuum of anonymous play- ers. In IJCAI: Proceedings of the International Joint Con- ference on Artificial Intelligence, pages 245-250, 2009.","title":"Generalised fictitious play for a continuum of anonymous players","authors":"Rabinovich","year":"2009","venue":"IJCAI: Proceedings of the International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2009/50"},{"position":18,"raw":"[Rosenthal, 1973] Robert W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2:65-67, 1973.","title":"A class of games possessing pure-strategy Nash equilibria","authors":"Robert W Rosenthal","year":"1973","venue":"International Journal of Game Theory","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Tambe, 2011] Milind Tambe. Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned. Cam- bridge University Press, 2011.","title":"Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned","authors":"Milind Tambe","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}