Stackelberg pricing games with congestion effects
From MaRDI portal
Publication:6120892
DOI10.1007/s10107-021-01672-9OpenAlexW3186210839MaRDI QIDQ6120892
Publication date: 21 February 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-021-01672-9
Hierarchical games (including Stackelberg games) (91A65) Applications of game theory (91A80) Microeconomic theory (price theory and economic markets) (91B24) Potential and congestion games (91A14)
Cites Work
- Unnamed Item
- Unnamed Item
- Sensitivity of Wardrop equilibria
- Price and capacity competition
- Toll caps in privatized road networks
- Leadership in singleton congestion games: what is hard and what is easy
- A generalization of Brouwer's fixed point theorem
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- The Impact of Oligopolistic Competition in Networks
- Investment and Market Structure in Industries with Congestion
- How bad is selfish routing?
- Minimum-Cost Network Design with (Dis)economies of Scale
- The complexity of pure Nash equilibria
- Network design problem with congestion effects: A case of bilevel programming
- Existence of Nash Equilibrium in n Person Games without Quasi-Concavity
- On the Existence of Pure and Mixed Strategy Nash Equilibria in Discontinuous Games
- Network-Optimized Road Pricing: Part II: Algorithms and Examples
- Network-Optimized Road Pricing: Part I: A Parable and a Model
- Games With Discontinuous Payoffs: A Strengthening of Reny's Existence Theorem
- Network investment games with Wardrop followers
- Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency
- Complexity and Approximation of the Continuous Network Design Problem
This page was built for publication: Stackelberg pricing games with congestion effects
