Computing pure Nash equilibria in network revenue management games
From MaRDI portal
Publication:1656431
DOI10.1007/s00291-018-0507-5zbMath1397.90209OpenAlexW2784465000MaRDI QIDQ1656431
Publication date: 10 August 2018
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-018-0507-5
Mixed integer programming (90C11) Noncooperative games (91A10) Linear programming (90C05) Management decision making, including multiple objectives (90B50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing approximate Nash equilibria in general network revenue management games
- Airline revenue management games with simultaneous price and quantity competition
- An option-based revenue management procedure for strategic airline alliances
- Network capacity management under competition
- Finding all equilibria in games of strategic complements
- The theory and practice of revenue management
- Approximate nucleolus-based revenue sharing in airline alliances
- Enumeration of All Extreme Equilibria of Bimatrix Games
- The complexity of computing a Nash equilibrium
- Revenue Management Games: Horizontal and Vertical Competition
- Settling the complexity of computing two-player Nash equilibria
- Algorithms for pure Nash equilibria in weighted congestion games
- Airline seat allocation competition
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
- Equilibrium Points of Bimatrix Games
- Equilibrium points in n -person games
- Optimality and Degeneracy in Linear Programming
- Mathematical programming for network revenue management revisited
This page was built for publication: Computing pure Nash equilibria in network revenue management games