Nash Equilibrium in Concurrent Games with Lexicographic Preferences. Gutierrez, J., Murano, A., Perelli, G., Rubin, S., & Wooldridge, M. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pages 1067–1073, 2017.
Nash Equilibrium in Concurrent Games with Lexicographic Preferences. [link]Paper  abstract   bibtex   
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.
@inproceedings
{
	C-GMPRW17,
	author				=	{Julian Gutierrez and Aniello Murano and Giuseppe Perelli and Sasha Rubin and Michael Wooldridge},
	title					=	{Nash Equilibrium in Concurrent Games with Lexicographic Preferences.},
	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.},
	booktitle			=	{Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August 19-25, 2017},
	pages     		= {1067--1073},
	year      		= {2017},
	url_paper			= {https://www.ijcai.org/Proceedings/2017/148},
}

Downloads: 0