On stackelberg pricing with computationally bounded customers
From MaRDI portal
Publication:4648689
DOI10.1002/net.20457zbMath1251.91032OpenAlexW2091242804MaRDI QIDQ4648689
Martin Hoefer, Patrick Briest, Luciano Gualà, Carmine Ventre
Publication date: 15 November 2012
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20457
Applications of game theory (91A80) Microeconomic theory (price theory and economic markets) (91B24) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
Stackelberg bipartite vertex cover and the preflow algorithm ⋮ On the Complexity of Stackelberg Matroid Pricing Problems ⋮ Solution techniques for bi-level knapsack problems ⋮ Stackelberg network pricing games ⋮ The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs ⋮ Specializations and generalizations of the Stackelberg minimum spanning tree game ⋮ Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting ⋮ On the Stackelberg knapsack game ⋮ Stackelberg packing games ⋮ A Stackelberg knapsack game with weight control
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Stackelberg minimum spanning tree game
- Reducing mechanism design to algorithm design via machine learning
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
- Linear tolls suffice: new bounds and algorithms for tolls in single source networks
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- Optimal Envy-Free Pricing with Metric Substitutability
- Combination Can Be Hard: Approximability of the Unique Coverage Problem
- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
- Single-minded unlimited supply pricing on sparse instances
- On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
- Stackelberg Network Pricing Games
- An approximation algorithm for Stackelberg network pricing
- Algorithms and Data Structures
- Automata, Languages and Programming
This page was built for publication: On stackelberg pricing with computationally bounded customers