Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting

DOI10.1007/s10107-020-01495-0OpenAlexW3017263481MaRDI QIDQ2020618

Oliver Schaudt, Toni Böhnlein, Stefan Kratsch

Publication date: 23 April 2021

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-020-01495-0

zbMATH Keywords

approximation algorithmsparameterized complexityStackelberg gamesrevenue maximizationalgorithmic pricing

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Related Items (2)

Stackelberg packing games ⋮ Stackelberg Max Closure with Multiple Followers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stackelberg bipartite vertex cover and the preflow algorithm
• Specializations and generalizations of the Stackelberg minimum spanning tree game
• The Stackelberg minimum spanning tree game
• Which problems have strongly exponential complexity?
• The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
• Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments
• Stackelberg network pricing games
• An overview of Stackelberg pricing in networks
• A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
• Integer Programming with a Fixed Number of Variables
• Stackelberg network pricing is hard to approximate
• On stackelberg pricing with computationally bounded customers
• An approximation algorithm for Stackelberg network pricing
• Dynamic and Nonuniform Pricing Strategies for Revenue Maximization
• Recovering a Function from a Dini Derivative

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