Stackelberg network pricing games
From MaRDI portal
Recommendations
Cites work
- A bilevel model of taxation and its application to optimal highway pricing
- A Nonparametric Approach to Multiproduct Pricing
- Algorithmic mechanism design
- Algorithms and Data Structures
- An approximation algorithm for Stackelberg network pricing
- An overview of Stackelberg pricing in networks
- Approximation algorithms and online mechanisms for item pricing
- Automata, Languages and Programming
- Buying cheap is expensive: hardness of non-parametric multi-product pricing
- Combination Can Be Hard: Approximability of the Unique Coverage Problem
- Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands
- On profit-maximizing envy-free pricing
- On Stackelberg pricing with computationally bounded customers
- Pricing bridges to cross a river
- Reducing mechanism design to algorithm design via machine learning
- Single-minded unlimited supply pricing on sparse instances
- Stackelberg network pricing games
- Stackelberg Scheduling Strategies
- Stackelberg strategies for selfish routing in general multicommodity networks
- The effectiveness of Stackelberg strategies and tolls for network congestion games
- The Stackelberg Minimum Spanning Tree Game
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
- Uniform Budgets and the Envy-Free Pricing Problem
Cited in
(25)- Pricing problems with a continuum of customers as stochastic Stackelberg games
- A Stackelberg network game with a large number of followers
- Toll caps in privatized road networks
- Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
- On the Stackelberg knapsack game
- A Stackelberg knapsack game with weight control
- An overview of Stackelberg pricing in networks
- Negative prices in network pricing games
- Stackelberg bipartite vertex cover and the preflow algorithm
- Stackelberg shortest path tree game, revisited
- Stackelberg network pricing is hard to approximate
- Pricing geometric transportation networks
- On Stackelberg pricing with computationally bounded customers
- Specializations and generalizations of the Stackelberg minimum spanning tree game
- Stackelberg network pricing games
- Network pricing: how to induce optimal flows under strategic link operators
- On the Complexity of Stackelberg Matroid Pricing Problems
- Network investment games with Wardrop followers
- Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
- An approximation algorithm for Stackelberg network pricing
- Watch and learn: optimizing from revealed preferences feedback
- Stackelberg Max Closure with Multiple Followers
- Stackelberg packing games
- Stackelberg packing games
- Stackelberg Vertex Cover on a Path
This page was built for publication: Stackelberg network pricing games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429327)
