{"type":"ScholarlyArticle","title":"Nash Equilibria in Concurrent Games with Lexicographic Preferences","authors":[{"name":"Julian Gutierrez","slug":"julian-gutierrez","given":"Julian","family":"Gutierrez","affiliation":"University of Oxford"},{"name":"Aniello Murano","slug":"aniello-murano","given":"Aniello","family":"Murano","affiliation":"Università degli Studi di Napoli \"Federico II\""},{"name":"Giuseppe Perelli","slug":"giuseppe-perelli","given":"Giuseppe","family":"Perelli","affiliation":"University of Oxford"},{"name":"Sasha Rubin","slug":"sasha-rubin","given":"Sasha","family":"Rubin","affiliation":"Università degli Studi di Napoli \"Federico II\""},{"name":"Michael Wooldridge","slug":"michael-wooldridge","given":"Michael","family":"Wooldridge","affiliation":"University of Oxford"}],"abstract":"We study concurrent games with finite-memory strategies where  players are given a Buchi and a mean-payoff objective, which are  related by a lexicographic order: a player first prefers to satisfy  its Buchi objective, and then prefers to minimise costs, which are  given by a mean-payoff function.  In particular, we show that deciding the  existence of a strict Nash equilibrium in such games is decidable,  even if players' deviations are implemented as infinite memory  strategies.","doi":"10.24963/ijcai.2017/148","url":"https://ijcai.org/proceedings/2017/148","pdf":"https://ijcai.org/proceedings/2017/0148.pdf","markdown":"https://ijcai.org/proceedings/2017/148.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/148","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":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":148,"pages":{"first":1067,"last":1073},"keywords":["Agent-based and Multi-agent Systems: Formal verification, validation and synthesis","Agent-based and Multi-agent Systems: Agent Theories and Models","Knowledge Representation, Reasoning, and Logic: Game Theory"],"videos":[],"references":[{"position":1,"raw":"[Alechina et al., 2015] Natasha Alechina, Brian Logan, Nguyen Hoang Nga, and Franco Raimondi. Model-Checking for Resource-Bounded ATL with Production and Consumption of Resources. CoRR, abs/1504.06766, 2015.","title":"Model-Checking for Resource-Bounded ATL with Production and Consumption of Resources","authors":"Natasha Alechina, Brian Logan, Nguyen Hoang, Nga, Franco Raimondi","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alur et al., 2002] Rajeev Alur, Thomas Henzinger, and Orna Kupferman. Alternating-Time Temporal Logic. Journal of the ACM, 49(5):672-713, 2002.","title":"Alternating-Time Temporal Logic","authors":"Rajeev Alur, Thomas Henzinger, Orna Kupferman","year":"2002","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bang-Jensen and Gutin, 2008] Jorgen Bang-Jensen and Gregory Gutin. Digraphs: theory, algorithms and applications. Springer, 2008.","title":"Digraphs: theory, algorithms and applications","authors":"Bang-Jensen, Gutin","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bloem et al., 2009] Roderick Bloem, Krishnendu Chatterjee, Thomas Henzinger, and Barbara Jobstmann. Better Quality in Synthesis through Quantitative Objectives. In CAV'09, pages 140-156, 2009.","title":"Better Quality in Synthesis through Quantitative Objectives","authors":"Roderick Bloem, Krishnendu Chatterjee, Thomas Henzinger, Barbara Jobstmann","year":"2009","venue":"CAV'09","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bouyer et al., 2015] Patricia Bouyer, Romain Brenguier, Nicolas Markey, and Michael Ummels. Pure Nash Equilibria in Concurrent Deterministic Games. Logical Methods in Computer Science, 11(2), 2015.","title":"Pure Nash Equilibria in Concurrent Deterministic Games","authors":"Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels","year":"2015","venue":"Logical Methods in Computer Science","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bruyère et al., 2014] Veronique Bruyère, Noemie Meunier, and Jean-Francois Raskin. Secure equilibria in weighted games. In CSL-LICS'14, pages 26:1-26:26, 2014.","title":"Secure equilibria in weighted games","authors":"Veronique Bruyère, Noemie Meunier, Jean-Francois Raskin","year":"2014","venue":"CSL-LICS'14","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bulling and Goranko, 2013] Nils Bulling and Valentin Goranko. How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about Multi-Player Games (Extended Abstract). In SR'13, pages 33-41, 2013.","title":"How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about Multi-Player Games (Extended Abstract)","authors":"Goranko Bulling, Nils Bulling, Valentin Goranko","year":"2013","venue":"SR'13","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chatterjee and Doyen, 2012] Krishnendu Chatterjee and Laurent Doyen. Energy parity games. Theor. Comput. Sci., 458:49-60, 2012.","title":"Energy parity games","authors":"Krishnendu Chatterjee, Laurent Doyen","year":"2012","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Chatterjee et al., 2005] Krishnendu Chatterjee, Thomas Henzinger, and Marcin Jurdzinski. Mean-Payoff Parity Games. In LICS'05, pages 178-187, 2005. [Ehrenfeucht and Mycielski, 1979] Andrzej Ehrenfeucht and Jan Mycielski. Positional strategies for mean payoff games. International Journal of Game Theory, 8(2):109-113, 1979.","title":"Andrzej Ehrenfeucht and Jan Mycielski. Positional strategies for mean payoff games","authors":"Krishnendu Chatterjee, Thomas Henzinger, Marcin Jurdzinski","year":"1979","venue":"LICS'05","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Fisman et al., 2010] Dana Fisman, Orna Kupferman, and Yoad Lustig. Rational synthesis. In TACAS'10, pages 190-204. Springer, 2010.","title":"Rational synthesis","authors":"Dana Fisman, Orna Kupferman, Yoad Lustig","year":"2010","venue":"TACAS'10","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gutierrez et al., 2015] Julian Gutierrez, Paul Harrenstein, and Michael Wooldridge. Iterated Boolean games. Inf. Comput., 242:53-79, 2015.","title":"Iterated Boolean games","authors":"Julian Gutierrez, Paul Harrenstein, Michael Wooldridge","year":"2015","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Kosaraju and Sullivan, 1988] Sambasiva Rau Kosaraju and Gregory Sullivan. Detecting Cycles in Dynamic Draphs in Polynomial Time. In STOC'88, pages 398-406. ACM, 1988.","title":"Detecting Cycles in Dynamic Draphs in Polynomial Time","authors":"Sambasiva Rau, Kosaraju, Gregory Sullivan","year":"1988","venue":"STOC'88","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kupferman et al., 2016] Orna Kupferman, Giuseppe Perelli, and Moshe Vardi. Synthesis with Rational Environments. Ann. Math. Artif. Intell., 78(1):3-20, 2016.","title":"Synthesis with Rational Environments","authors":"Orna Kupferman, Giuseppe Perelli, Moshe Vardi","year":"2016","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Matousek and Gärtner, 2007] Jiri Matousek and Bernd Gärtner. Understanding and Using Linear Programming. Springer Science & Business Media, 2007.","title":"Understanding and Using Linear Programming","authors":"Gärtner Matousek","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Pnueli and Rosner, 1989] Amir Pnueli and Roni Rosner. On the Synthesis of a Reactive Module. In POPL'89, pages 179-190. ACM, 1989.","title":"On the Synthesis of a Reactive Module","authors":"Rosner Pnueli, Amir Pnueli, Roni Rosner","year":"1989","venue":"POPL'89","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Rosner, 1991] Roni Rosner. Modular Synthesis of Reactive Systems. PhD thesis, Weizmann, 1991.","title":"Modular Synthesis of Reactive Systems","authors":"Roni Rosner","year":"1991","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Ummels and Wojtczak, 2011] Michael Ummels and Dominik Wojtczak. The Complexity of Nash Equilibria in Limit-Average Games. In CONCUR'11, pages 482-496, 2011.","title":"The Complexity of Nash Equilibria in Limit-Average Games","authors":"Michael Ummels, Dominik Wojtczak","year":"2011","venue":"CONCUR'11","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Wooldridge et al., 2016] Michael Wooldridge, Julian Gutierrez, Paul Harrenstein, Enrico Marchioni, Giuseppe Perelli, and Alexis Toumi. Rational Verification: From Model Checking to Equilibrium Checking. In AAAI'16, pages 4184-4191, 2016.","title":"Rational Verification: From Model Checking to Equilibrium Checking","authors":"Michael Wooldridge, Julian Gutierrez, Paul Harrenstein, Enrico Marchioni, Giuseppe Perelli, Alexis Toumi","year":"2016","venue":"AAAI'16","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}