NDLI: Games with secure equilibria

Content Provider	IEEE Xplore Digital Library
Author	Chatterjee, K. Henzinger, T.A. Jurdzinski, M.
Copyright Year	2004
Description	Author affiliation: Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA (Chatterjee, K.; Henzinger, T.A.; Jurdzinski, M.)
Abstract	In 2-player nonzero-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 often 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 objectives, which include the games that arise in verification, there may be several Nash equilibria, but there is always a unique maximal payoff profile of secure equilibria. We show how this equilibrium can be computed in the case of /spl omega/-regular objectives, and we characterize the memory requirements of strategies that achieve the equilibrium.
Sponsorship	IEEE Comput. Soc. Tech. Committee on Math. Found. on Comput
Starting Page	160
Ending Page	169
File Size	561875
Page Count	10
File Format	PDF
ISBN	0769521924
ISSN	10436871
DOI	10.1109/LICS.2004.1319610
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-07-17
Publisher Place	Finland
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Nash equilibrium Computer science Game theory
Content Type	Text
Resource Type	Article
Subject	Mathematics Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Games with secure equilibria (2004)

Games with secure equilibria.

Computing Equilibria in Anonymous Games

A simple algorithm for computing Nash-equilibria in incomplete information games

Parallel Computation of Nash Equilibria in N-Player Games

Games with Secure Equilibria (2004)

The Set of Pareto-Nash Equilibria in Multicriteria Strategic Games

Nash equilibria sets in mixed extended 2x3 games

The Computational Complexity of Nash Equilibria in Concisely Represented Games

Games with secure equilibria

Similar Documents

Games with secure equilibria (2004)

Games with secure equilibria.

Computing Equilibria in Anonymous Games

A simple algorithm for computing Nash-equilibria in incomplete information games

Parallel Computation of Nash Equilibria in N-Player Games

Games with Secure Equilibria (2004)

The Set of Pareto-Nash Equilibria in Multicriteria Strategic Games

Nash equilibria sets in mixed extended 2x3 games

The Computational Complexity of Nash Equilibria in Concisely Represented Games

Games with secure equilibria