Games with secure equilibria
Chatterjee, Krishnendu, Henzinger, Thomas A. and Jurdzinski, Marcin (2006) Games with secure equilibria. In: 3rd International Symposium on Formal Methods for Components and Objects, Leiden, NETHERLANDS, NOV 02-05, 2004. Published in: THEORETICAL COMPUTER SCIENCE, 365 (1-2). pp. 67-82.Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.tcs.2006.07.032
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we consider lexicographic objectives: first, each player tries to maximize her own payoff, and then, the player tries to minimize the opponent's payoff. Such objectives arise naturally in the verification of systems with multiple components. There, instead of proving that each component satisfies its specification no matter how the other components behave, it sometimes suffices to prove that each component satisfies its specification provided that the other components satisfy their specifications. We say that a Nash equilibrium is secure if it is an equilibrium with respect to the lexicographic objectives of both players. We prove that in graph games with Borel winning conditions, which include the games that arise in verification, there may be several Nash equilibria, but there is always a unique maximal payoff profile of a secure equilibrium. We show how this equilibrium can be computed in the case of omega-regular winning conditions, and we characterize the memory requirements of strategies that achieve the equilibrium. (c) 2006 Elsevier B.V. All rights reserved.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Journal or Publication Title:||THEORETICAL COMPUTER SCIENCE|
|Publisher:||ELSEVIER SCIENCE BV|
|Official Date:||10 November 2006|
|Number of Pages:||16|
|Page Range:||pp. 67-82|
|Title of Event:||3rd International Symposium on Formal Methods for Components and Objects|
|Location of Event:||Leiden, NETHERLANDS|
|Date(s) of Event:||NOV 02-05, 2004|
Actions (login required)
Downloads per month over past year