Quantitative Fairness Games

Alessandro Bianco
(University of Naples, Italy)
Marco Faella
(University of Naples, Italy)
Fabio Mogavero
(University of Naples, Italy)
Aniello Murano
(University of Naples, Italy)

We consider two-player games played on finite colored graphs where the goal is the construction of an infinite path with one of the following frequency-related properties: (i) all colors occur with the same asymptotic frequency, (ii) there is a constant that bounds the difference between the occurrences of any two colors for all prefixes of the path, or (iii) all colors occur with a fixed asymptotic frequency.

These properties can be viewed as quantitative refinements of the classical notion of fair path in a concurrent system, whose simplest form checks whether all colors occur infinitely often. In particular, the first two properties enforce equal treatment of all the jobs involved in the system, while the third one represents a way to assign a given priority to each job. For all the above goals, we show that the problem of checking whether there exists a winning strategy is CoNP-complete.

In Alessandra Di Pierro and Gethin Norman: Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages (QAPL 2010), Paphos, Cyprus, 27-28th March 2010 , Electronic Proceedings in Theoretical Computer Science 28, pp. 48–63.
Published: 26th June 2010.

ArXived at: https://dx.doi.org/10.4204/EPTCS.28.4 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org