Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting

DOI10.4230/LIPICS.ICALP.2017.46zbMATH Open1441.91018OpenAlexW2741337854MaRDI QIDQ5111377FDOQ5111377

Toni Böhnlein, Oliver Schaudt, Stefan Kratsch

Publication date: 27 May 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.46

Recommendations

• Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
• Stackelberg network pricing games
• Stackelberg network pricing games
• On Stackelberg pricing with computationally bounded customers
• Stackelberg packing games

zbMATH Keywords

approximation algorithmsStackelberg gamesparameterized complexityrevenue maximizationalgorithmic pricing

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Hierarchical games (including Stackelberg games) (91A65) Parameterized complexity, tractability and kernelization (68Q27)

Cited In (6)

• On the Complexity of Stackelberg Matroid Pricing Problems
• On the Stackelberg knapsack game
• Network investment games with Wardrop followers
• On Revenue Maximization for Agents with Costly Information Acquisition
• Stackelberg packing games
• Maximal revenue with multiple goods: Nonmonotonicity and other observations

This page was built for publication: Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111377)