UNSPECIFIED (2004) On Nash equilibria in stochastic games. In: 18th International Workshop on Computer Science Logic/13th Annual Conference of the European-Association-for-Computer-Science-Logic, SEP 20-24, 2004, Karpacz, POLAND.

Full text not available from this repository.

Abstract

We study infinite stochastic games played by n-players on a finite graph with goals given by sets of infinite traces. The games are stochastic (each player simultaneously and independently chooses an action at each round, and the next state is determined by a probability distribution depending on the current state and the chosen actions), infinite (the game continues for an infinite number of rounds), nonzero sum (the players' goals are not necessarily conflicting), and undiscounted. We show that if each player has a reachability objective, that is, if the goal for each player i is to visit some subset R-i of the states, then there exists an epsilon-Nash equilibrium in memoryless strategies, for every epsilon > 0. However, exact Nash equilibria need not exist. We study the complexity of finding such Nash equilibria, and show that the payoff of some epsilon-Nash equilibrium in memoryless strategies can be epsilon-approximated in NP. We study the important subclass of n-player turn-based probabilistic games, where at each state at most one player has a nontrivial choice of moves. For turn-based probabilistic games, we show the existence of epsilon-Nash equilibria in pure strategies for games where the objective of player i is a Borel set B-i of infinite traces. However, exact Nash equilibria may not exist. For the special case of omega-regular objectives, we show exact Nash equilibria exist, and can be computed in NP when the omega-regular objectives are expressed as parity objectives.

Item Type:	Conference Item (UNSPECIFIED)
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Series Name:	LECTURE NOTES IN COMPUTER SCIENCE
Journal or Publication Title:	COMPUTER SCIENCE LOGIC, PROCEEDINGS
Publisher:	SPRINGER-VERLAG BERLIN
ISBN:	3-540-23024-6
ISSN:	0302-9743
Editor:	Marcinkowski, J and Tarlecki, A
Date:	2004
Volume:	3210
Number of Pages:	15
Page Range:	pp. 26-40
Publication Status:	Published
Title of Event:	18th International Workshop on Computer Science Logic/13th Annual Conference of the European-Association-for-Computer-Science-Logic
Location of Event:	Karpacz, POLAND
Date(s) of Event:	SEP 20-24, 2004
URI:	http://wrap.warwick.ac.uk/id/eprint/7911

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item