Quantitative Fairness Games

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.

[1]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[2]  Thomas A. Henzinger,et al.  Finitary fairness , 1998, TOPL.

[3]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[4]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[5]  Aniello Murano,et al.  Balanced Paths in Colored Graphs , 2009, MFCS.

[6]  Wolfgang Thomas,et al.  On the Synthesis of Strategies in Infinite Games , 1995, STACS.

[7]  Luca de Alfaro,et al.  From Fairness to Chance , 1998, PROBMIV.

[8]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[9]  Krishnendu Chatterjee,et al.  Finitary winning in ω-regular games , 2009, TOCL.

[10]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[11]  Amir Pnueli,et al.  Impartiality, Justice and Fairness: The Ethics of Concurrent Termination , 1981, ICALP.

[12]  Rupak Majumdar,et al.  Code aware resource management , 2005, Formal Methods Syst. Des..

[13]  Robert McNaughton,et al.  Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.

[14]  Marta Kwiatkowska,et al.  Survey of fairness notions , 1989 .

[15]  Adel Al-maasarani,et al.  Priority-Based Scheduling and Evaluation of Precedence Graphs with Communication Times , 1993 .

[16]  Adel Mohammed Adel Al-Massarani,et al.  Priority-based scheduling and evaluation of precedence graphs with communication times , 1993 .

[17]  Krishnendu Chatterjee,et al.  Finitary Winning in omega-Regular Games , 2006, TACAS.