Formal Methods for Components and Objects

DOI10.1007/11561163zbMATH Open1143.68447OpenAlexW4298853841MaRDI QIDQ5897449FDOQ5897449

Authors: Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdziński 

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11561163

Recommendations

• Games with secure equilibria
• CONCUR 2005 – Concurrency Theory
• Secure equilibria in weighted games
• On equilibria in quantitative games with reachability/safety objectives
• Computer Science Logic

Mathematics Subject Classification ID

Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)

Cited In (19)

• Reaching Your Goal Optimally by Playing at Random with No Memory
• Optimal strategies in weighted limit games
• Games with a Weak Adversary
• Nash equilibrium strategies revisited in software release games
• Title not available (Why is that?)
• The Theory of Universal Graphs for Infinite Duration Games
• Robust equilibria in mean-payoff games
• Buying optimal payoffs in bi-matrix games
• Games where you can play optimally with arena-independent finite memory
• Existence of secure equilibrium in multi-player games with perfect information
• Security games over lexicographic orders
• Beyond Nash equilibrium: solution concepts for the 21st century
• Games with secure equilibria
• Secure equilibria in weighted games
• Solution of the Hotelling's game in secure strategies
• Parameterized linear temporal logics meet costs: still not costlier than LTL
• Better reply security and existence of equilibria in differential games
• Preemption Games with Private Information
• Title not available (Why is that?)

This page was built for publication: Formal Methods for Components and Objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897449)