Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting.

DOI10.4230/LIPIcs.ICALP.2017.46zbMath1441.91018OpenAlexW2741337854MaRDI QIDQ5111377

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

zbMATH Keywords

approximation algorithmsparameterized complexityStackelberg gamesrevenue maximizationalgorithmic pricing

Mathematics Subject Classification ID

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

Related Items (3)

On the Complexity of Stackelberg Matroid Pricing Problems ⋮ On the Stackelberg knapsack game ⋮ Network investment games with Wardrop followers

This page was built for publication: Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting.