Quantitative fairness games

MaRDI QIDQ5151033zbMATH OpenFDO

Authors Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano

Publication date 16 February 2021

Full work available at URL http://eptcs.web.cse.unsw.edu.au/paper.cgi?QAPL2010.4

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) 2-person games (91A05) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• Quantitatively fair scheduling
• Cost-parity and cost-Streett games
• Balanced Paths in Colored Graphs
• Qualitative analysis of concurrent mean-payoff games
• Concurrent games and semi-random determinacy

Cited in

(3)

• Quantitative games with interval objectives
• Balanced Paths in Colored Graphs
• Quantitatively fair scheduling

This page was built for publication: Quantitative fairness games

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