A warm-started iterated best response algorithm computes approximate equilibria for lexicographic preference games about 100 to 1000 times faster than the baseline MCP solver in small traffic simulations, but optimality is only measured as agreement between successive iterations.
Posetal games: Efficiency, existence, and refinement of equilibria in games with prioritized metrics,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
extension 1
citation-polarity summary
fields
eess.SY 1years
2025 1verdicts
CONDITIONAL 1roles
extension 1polarities
extend 1representative citing papers
citing papers explorer
-
Approximate solutions to games of ordered preference
A warm-started iterated best response algorithm computes approximate equilibria for lexicographic preference games about 100 to 1000 times faster than the baseline MCP solver in small traffic simulations, but optimality is only measured as agreement between successive iterations.