Computing approximate Nash equilibria in general network revenue management games

DOI10.1016/j.ejor.2014.02.045zbMath1338.91046OpenAlexW2077264097MaRDI QIDQ296621

W. Grauberger, Alf Kimms

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.02.045

zbMATH Keywords

competitionalgorithmic game theoryapproximate Nash equilibrianetwork revenue management

Mathematics Subject Classification ID

Noncooperative games (91A10) Applications of game theory (91A80) Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10)

Related Items (5)

Airline revenue management games with simultaneous price and quantity competition ⋮ Computing pure Nash equilibria in network revenue management games ⋮ Finding multiple Nash equilibria via machine learning-supported Gröbner bases ⋮ Frequency competition among airlines on coordinated airports network ⋮ Revenue management under joint pricing and capacity allocation competition

Uses Software

• Gambit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fair revenue sharing mechanisms for strategic passenger airline alliances
• An option-based revenue management procedure for strategic airline alliances
• Network capacity management under competition
• Simulation of stochastic demand data streams for network revenue management problems
• Network capacity control using self-adjusting bid-prices
• A note on approximate Nash equilibria
• Polynomial algorithms for approximating Nash equilibria of bimatrix games
• On the complexity of the parity argument and other inefficient proofs of existence
• The theory and practice of revenue management
• Approximate nucleolus-based revenue sharing in airline alliances
• Enumeration of All Extreme Equilibria of Bimatrix Games
• A Randomized Linear Programming Method for Computing Network Bid Prices
• Revenue Management Games: Horizontal and Vertical Competition
• Settling the complexity of computing two-player Nash equilibria
• Airline seat allocation competition
• Equilibrium Points of Bimatrix Games
• Algorithmic Game Theory
• Equilibrium points in n -person games
• Mathematical programming for network revenue management revisited

This page was built for publication: Computing approximate Nash equilibria in general network revenue management games