On the Complexity of Stackelberg Matroid Pricing Problems

DOI10.1007/978-3-030-48966-3_7OpenAlexW3028996080MaRDI QIDQ5041182

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

matroidsStackelberg gamesrevenue maximizationalgorithmic pricing

Mathematics Subject Classification ID

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

Related Items (1)

Negative prices in network pricing games

Cites Work

• 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
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
• Stackelberg network pricing games
• An overview of Stackelberg pricing in networks
• A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
• Stackelberg network pricing is hard to approximate
• On stackelberg pricing with computationally bounded customers
• Reducibility among Combinatorial Problems
• Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting.
• An approximation algorithm for Stackelberg network pricing
• Stackelberg packing games
• Bilevel programming and price setting problems

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