Trading probability for fairness

DOI10.1007/3-540-45793-3_20MaRDI QIDQ4411830zbMATH OpenFDO

Authors Marcin Jurdziński, Orna Kupferman, Thomas A. Henzinger

Publication date 10 July 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2471/24710292.htm

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of game theory (91A80)

Recommendations

• Qualitative concurrent parity games
• Concurrent games and semi-random determinacy
• Qualitative analysis of concurrent mean-payoff games
• Quantitative solution of -regular games
• Qualitative concurrent parity games: bounded rationality

Cited in

(5)

• Concurrent reachability games
• Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
• Fair adversaries and randomization in two-player games
• An \(O(n^2)\) time algorithm for alternating Büchi games
• On fairness and randomness

This page was built for publication: Trading probability for fairness

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