Quantitative Fairness Games

  title={Quantitative Fairness Games},
  author={A. Bianco and M. Faella and F. Mogavero and A. Murano},
  • A. Bianco, M. Faella, +1 author A. Murano
  • Published in QAPL 2010
  • Mathematics, Computer Science
  • 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… CONTINUE READING
    Quantitatively fair scheduling
    • 1
    • PDF


    Publications referenced by this paper.
    Infinite Games Played on Finite Graphs
    • 313
    • PDF
    Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees
    • 465
    • PDF
    Balanced Paths in Colored Graphs
    • 4
    • PDF
    On the Synthesis of Strategies in Infinite Games
    • 424
    • PDF
    Finitary winning in ω-regular games
    • 98
    • PDF
    Finitary Winning in omega-Regular Games
    • 43
    • PDF
    Finitary fairness
    • 58
    • PDF
    From Fairness to Chance
    • 26
    Integer and Combinatorial Optimization
    • 5,132
    • PDF
    Survey of fairness notions
    • 56