{"type":"ScholarlyArticle","title":"An Abstraction-Refinement Methodology for Reasoning about Network Games","authors":[{"name":"Guy Avni","slug":"guy-avni","given":"Guy","family":"Avni","affiliation":"IST Austria"},{"name":"Shibashis Guha","slug":"shibashis-guha","given":"Shibashis","family":"Guha","affiliation":"The Hebrew University"},{"name":"Orna Kupferman","slug":"orna-kupferman","given":"Orna","family":"Kupferman","affiliation":"The Hebrew University"}],"abstract":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an over-approximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. Our experimental results demonstrate the efficiency of the methodology.","doi":"10.24963/ijcai.2017/11","url":"https://ijcai.org/proceedings/2017/11","pdf":"https://ijcai.org/proceedings/2017/0011.pdf","markdown":"https://ijcai.org/proceedings/2017/11.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/11","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":11,"pages":{"first":70,"last":76},"keywords":["Agent-based and Multi-agent Systems: Noncooperative Games","Agent-based and Multi-agent Systems: Formal verification, validation and synthesis"],"videos":[],"references":[{"position":1,"raw":"[Albers et al., 2014] S. Albers, S. Eilts, E. Even-Dar, Y. Mansour, and L. Roditty. On nash equilibria for a network creation game. ACM Trans. Economics and Comput., 2(1):2:1-2:27, 2014.","title":"On nash equilibria for a network creation game","authors":"S Albers, S Eilts, E Even-Dar, Y Mansour, L Roditty","year":"2014","venue":"ACM Trans. Economics and Comput","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Almagor et al., 2015] S. Almagor, G. Avni, and O. Kupferman. Repairing multi-player games. In Proc. 26th CONCUR, pages 325-339, 2015.","title":"Repairing multi-player games","authors":"S Almagor, G Avni, O Kupferman","year":"2015","venue":"Proc. 26th CONCUR","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Alur et al., 2002] R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. JACM, 49(5):672-713, 2002.","title":"Alternating-time temporal logic","authors":"R Alur, T A Henzinger, O Kupferman","year":"2002","venue":"JACM","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Anshelevich et al., 2008] E. Anshelevich, A. Dasgupta, J. Klein- berg, E. Tardos, T. Wexler, and T. Roughgarden. The price of stability for network design with fair cost allocation. SIAM J. Comput., 38(4):1602-1623, 2008.","title":"The price of stability for network design with fair cost allocation","authors":"E Anshelevich, A Dasgupta, J Kleinberg, E Tardos, T Wexler, T Roughgarden","year":"2008","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Avni and Kupferman, 2012] G. Avni and O. Kupferman. Making weighted containment feasible: A heuristic based on simulation and abstraction. In Proc. 23rd CONCUR, pages 84-99, 2012.","title":"Making weighted containment feasible: A heuristic based on simulation and abstraction","authors":"G Avni, O Kupferman","year":"2012","venue":"Proc. 23rd CONCUR","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Avni et al., 2016a] G. Avni, T.A. Henzinger, and O. Kupferman. Dynamic resource allocation games. In Proc. 9th SAGT, pages 153-166, 2016.","title":"Dynamic resource allocation games","authors":"Avni","year":"2016","venue":"Proc. 9th SAGT","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Avni et al., 2016b] G. Avni, O. Kupferman, and T. Tamir. Network-formation games with regular objectives. I&C, 251:165-178, 2016.","title":"Network-formation games with regular objectives","authors":"Avni","year":"2016","venue":"I&C","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Ball and Kupferman, 2006] T. Ball and O. Kupferman. An abstraction-refinement framework for multi-agent systems. In Proc. 21st LICS, 2006.","title":"An abstraction-refinement framework for multi-agent systems","authors":"T Ball, O Kupferman","year":"2006","venue":"Proc. 21st LICS","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Brihaye et al., 2012] T. Brihaye, V. Bruyère, J. De Pril, and H. Gimbert. On subgame perfection in quantitative reachability games. LMCS, 9(1), 2012.","title":"On subgame perfection in quantitative reachability games","authors":"T Brihaye, V Bruyère, J De Pril, H Gimbert","year":"2012","venue":"LMCS","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Brown and Sandholm, 2015] N. Brown and T. Sandholm. Simul- taneous abstraction and equilibrium finding in games. In Proc. 24th IJCAI, pages 489-496, 2015.","title":"Simultaneous abstraction and equilibrium finding in games","authors":"N Brown, T Sandholm","year":"2015","venue":"Proc. 24th IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/75"},{"position":11,"raw":"[Bruns and Godefroid, 1999] G. Bruns and P. Godefroid. Model checking partial state spaces with 3-valued temporal logics. In Proc. 11th CAV, pages 274-287, 1999.","title":"Model checking partial state spaces with 3-valued temporal logics","authors":"G Bruns, P Godefroid","year":"1999","venue":"Proc. 11th CAV","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Chatterjee et al., 2004] K. Chatterjee, R. Majumdar, and M. Jur- dzinski. On Nash equilibria in stochastic games. In Proc. 13th CSL, pages 26-40, 2004.","title":"On Nash equilibria in stochastic games","authors":"K Chatterjee, R Majumdar, M Jurdzinski","year":"2004","venue":"Proc. 13th CSL","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Chatterjee et al., 2006] K. Chatterjee, T. A. Henzinger, and M. Ju- rdzinski. Games with secure equilibria. TCS, 365(1-2):67-82, 2006.","title":"Games with secure equilibria","authors":"K Chatterjee, T A Henzinger, M Jurdzinski","year":"2006","venue":"TCS","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Chatterjee et al., 2007] K. Chatterjee, T. A. Henzinger, and N. Piterman. Strategy logic. In Proc. 18th CONCUR, pages 59- 73, 2007.","title":"Strategy logic","authors":"K Chatterjee, T A Henzinger, N Piterman","year":"2007","venue":"Proc. 18th CONCUR","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Chatterjee, 2006] K. Chatterjee. Nash equilibrium for upward- closed objectives. In Proc. 15th CSL, pages 271-286, 2006.","title":"Nash equilibrium for upwardclosed objectives","authors":"K Chatterjee","year":"2006","venue":"Proc. 15th CSL","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Clarke et al., 1999] E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.","title":"Model Checking","authors":"E M Clarke, O Grumberg, D Peled","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Clarke et al., 2003] E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement for symbolic model checking. JACM, 50(5):752-794, 2003.","title":"Counterexample-guided abstraction refinement for symbolic model checking","authors":"E M Clarke, O Grumberg, S Jha, Y Lu, H Veith","year":"2003","venue":"JACM","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Cousot and Cousot, 1977] P. Cousot and R. Cousot. Abstract in- terpretation: a unified lattice model for the static analysis of pro- grams by construction or approximation of fixpoints. In Proc. 4th POPL, pages 238-252. ACM, 1977.","title":"Abstract interpretation: a unified lattice model for the static analysis of programs by construction or approximation of fixpoints","authors":"P Cousot, R Cousot","year":"1977","venue":"Proc. 4th POPL","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Dams et al., 1997] D. Dams, R. Gerth, and O. Grumberg. Ab- stract interpretation of reactive systems. TOPLAS, 19(2):253- 291, 1997.","title":"Abstract interpretation of reactive systems","authors":"D Dams, R Gerth, O Grumberg","year":"1997","venue":"TOPLAS","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[de Alfaro et al., 2004] L. de Alfaro, P. Godefroid, and R. Ja- gadeesan. Three-valued abstractions of games: Uncertainty, but with precision. In Proc. 19th LICS, pages 170-179, 2004.","title":"Three-valued abstractions of games: Uncertainty, but with precision","authors":"De Alfaro","year":"2004","venue":"Proc. 19th LICS","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Fabrikant et al., 2003] A. Fabrikant, A. Luthra, E. Maneva, C. Pa- padimitriou, and S. Shenker. On a network creation game. In PODC, pages 347-351, 2003.","title":"On a network creation game","authors":"A Fabrikant, A Luthra, E Maneva, C Papadimitriou, S Shenker","year":"2003","venue":"PODC","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Fabrikant et al., 2004] A. Fabrikant, C. Papadimitriou, and K. Tal- war. The complexity of pure nash equilibria. In Proc. 36th STOC, pages 604-612, 2004.","title":"The complexity of pure nash equilibria","authors":"A Fabrikant, C Papadimitriou, K Talwar","year":"2004","venue":"Proc. 36th STOC","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Fisman et al., 2010] D. Fisman, O. Kupferman, and Y. Lustig. Ra- tional synthesis. In Proc. 16th TACAS, pages 190-204, 2010.","title":"Rational synthesis","authors":"D Fisman, O Kupferman, Y Lustig","year":"2010","venue":"Proc. 16th TACAS","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Gilpin and Sandholm, 2007a] A. Gilpin and T. Sandholm. Bet- ter automated abstraction techniques for imperfect information games, with application to texas hold'em poker. In Proc. 6th AA- MAS, pages 1168-1175, 2007.","title":"Better automated abstraction techniques for imperfect information games, with application to texas hold'em poker","authors":"Sandholm Gilpin, A Gilpin, T Sandholm","year":"2007","venue":"Proc. 6th AA-MAS","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Gilpin and Sandholm, 2007b] A. Gilpin and T. Sandholm. Loss- less abstraction of imperfect information games. JACM, 54(5):25, 2007.","title":"Lossless abstraction of imperfect information games","authors":"Sandholm Gilpin, A Gilpin, T Sandholm","year":"2007","venue":"JACM","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Gilpin et al., 2008] A. Gilpin, T. Sandholm, and T. B. Sørensen. A heads-up no-limit texas hold'em poker player: Discretized bet- ting models and automatically generated equilibrium-finding pro- grams. In Proc. 7th AAMAS, pages 911-918, 2008.","title":"A heads-up no-limit texas hold'em poker player: Discretized betting models and automatically generated equilibrium-finding programs","authors":"A Gilpin, T Sandholm, T B Sørensen","year":"2008","venue":"Proc. 7th AAMAS","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Hagberg et al., 2008] A. A. Hagberg, D. A. Schult, and P.J. Swart. Exploring network structure, dynamics, and function using Net- workX. In Proc. 7th SciPy, pages 11-15, 2008.","title":"Exploring network structure, dynamics, and function using Net-workX","authors":"A A Hagberg, D A Schult, P J Swart","year":"2008","venue":"Proc. 7th SciPy","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Henzinger et al., 2000] T.A. Henzinger, R. Majumdar, F.Y.C. Mang, and J-F Raskin. Abstract interpretation of game prop- erties. In Proc. 7th SAS, pages 245-252, 2000.","title":"Abstract interpretation of game properties","authors":"T A Henzinger, R Majumdar, F Y C Mang, J-F Raskin","year":"2000","venue":"Proc. 7th SAS","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Johnson et al., 1988] D. S. Johnson, C. H. Papadimtriou, and M. Yannakakis. How easy is local search? JCSS, 37(1):79-100, 1988.","title":"How easy is local search?","authors":"D S Johnson, C H Papadimtriou, M Yannakakis","year":"1988","venue":"JCSS","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Kupferman and Tamir, 2017] O. Kupferman and T. Tamir. Hierar- chical network formation games. In Proc. 23rd TACAS, pages 229-246, 2017.","title":"Hierarchical network formation games","authors":"O Kupferman, T Tamir","year":"2017","venue":"Proc. 23rd TACAS","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Larsen, 1989] K.G. Larsen. Modal specifications. In Automatic Verification Methods for Finite State Systems, Proc. Int. Work- shop, pages 232-246, 1989.","title":"Modal specifications","authors":"K G Larsen","year":"1989","venue":"Automatic Verification Methods for Finite State Systems","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Meyers, 2006] C. A. Meyers. Network Flow Problems and Con- gestion Games: Complexity and Approximation Results. PhD thesis, MIT, 2006.","title":"Network Flow Problems and Congestion Games: Complexity and Approximation Results","authors":"C A Meyers","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Rosenthal, 1973] R. W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. IJGT, 2:65-67, 1973.","title":"A class of games possessing pure-strategy Nash equilibria","authors":"R W Rosenthal","year":"1973","venue":"IJGT","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Roughgarden and Tardos, 2002] T. Roughgarden and E. Tardos. How bad is selfish routing? JACM, 49(2):236-259, 2002.","title":"How bad is selfish routing?","authors":"T Roughgarden, E Tardos","year":"2002","venue":"JACM","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Shoham and Grumberg, 2004] S. Shoham and O. Grumberg. Monotonic abstraction-refinement for CTL. In Proc. 10th TACAS, pages 546-560, 2004.","title":"Monotonic abstraction-refinement for CTL","authors":"S Shoham, O Grumberg","year":"2004","venue":"Proc. 10th TACAS","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Syrgkanis, 2010] V. Syrgkanis. The complexity of equilibria in cost sharing games. In WINE, pages 366-377, 2010.","title":"The complexity of equilibria in cost sharing games","authors":"V Syrgkanis","year":"2010","venue":"WINE","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Tardos and Wexler, 2007] E. Tardos and T. Wexler. Algorithmic Game Theory. Cambridge University Press, 2007. Chapter 19: Network Formation Games and the Potential Function Method.","title":"Algorithmic Game Theory","authors":"E Tardos, T Wexler","year":"2007","venue":"Network Formation Games and the Potential Function Method","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Vissicchio et al., 2014] S. Vissicchio, L. Vanbever, and O. Bonaventure. Opportunities and research challenges of hybrid software defined networks. Computer Communication Review, 44(2):70-75, 2014.","title":"Opportunities and research challenges of hybrid software defined networks","authors":"S Vissicchio, L Vanbever, O Bonaventure","year":"2014","venue":"Computer Communication Review","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}