On the Complexity of Stackelberg Matroid Pricing Problems

DOI10.1007/978-3-030-48966-3_7MaRDI QIDQ5041182zbMATH OpenOpenAlexFDO

Authors Toni Böhnlein, Oliver Schaudt

Publication date 13 October 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-48966-3_7

zbMATH Keywords

algorithmic pricingmatroidsrevenue maximizationStackelberg games

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• Stackelberg packing games
• Stackelberg packing games
• Stackelberg network pricing games
• Stackelberg network pricing games
• Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting

Cites work

• A bilevel model of taxation and its application to optimal highway pricing
• An approximation algorithm for Stackelberg network pricing
• An overview of Stackelberg pricing in networks
• Bilevel programming and price setting problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• scientific article; zbMATH DE number 5047784 (Why is no real title available?)
• On Stackelberg pricing with computationally bounded customers
• Reducibility among combinatorial problems
• Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
• Specializations and generalizations of the Stackelberg minimum spanning tree game
• Stackelberg bipartite vertex cover and the preflow algorithm
• Stackelberg network pricing games
• Stackelberg network pricing is hard to approximate
• Stackelberg packing games
• Stackelberg shortest path tree game, revisited
• The Stackelberg minimum spanning tree game
• The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs

Cited in

(4)

• Negative prices in network pricing games
• Hardness of Graph Pricing Through Generalized Max-Dicut
• The pricing problem. Part II: Computational complexity
• Stackelberg packing games

This page was built for publication: On the Complexity of Stackelberg Matroid Pricing Problems

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