Two-Person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies

@article{endre2026,
  title        = {{Two-Person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies}},
  author       = {Endre Boros et al.},
  journal      = {Dynamic Games and Applications},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1007/s13235-026-00699-x},
}

TY  - JOUR
TI  - Two-Person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies
AU  - al., Endre Boros et
JO  - Dynamic Games and Applications
PY  - 2026
ER  -

Endre Boros et al. (2026). Two-Person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies. *Dynamic Games and Applications*. https://doi.org/https://doi.org/10.1007/s13235-026-00699-x

Endre Boros et al.. "Two-Person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies." *Dynamic Games and Applications* (2026). https://doi.org/https://doi.org/10.1007/s13235-026-00699-x.

Two-Person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies
Endre Boros et al. · Dynamic Games and Applications · 2026
https://doi.org/https://doi.org/10.1007/s13235-026-00699-x