# Quantitative Fairness Games

@inproceedings{Bianco2010QuantitativeFG, title={Quantitative Fairness Games}, author={A. Bianco and M. Faella and F. Mogavero and A. Murano}, booktitle={QAPL}, year={2010} }

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

3 Citations

Emptiness and Universality Problems in Timed Automata with Positive Frequency

- Computer Science, Mathematics
- 2011

- 5
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 37 REFERENCES

Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees

- Mathematics, Computer Science
- 1998

- 465
- PDF