The Bakers and Millers Game with restricted baker locations always has a pure Nash equilibrium, computable in polynomial time, with tight bounds on how far equilibria are from optimal coverage.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Bakers and Millers Game with Restricted Locations
The Bakers and Millers Game with restricted baker locations always has a pure Nash equilibrium, computable in polynomial time, with tight bounds on how far equilibria are from optimal coverage.