On Stackelberg pricing with computationally bounded customers

DOI10.1002/NET.20457MaRDI QIDQ4648689zbMATH OpenOpenAlexFDO

Authors Patrick Briest, Luciano Gualà, Martin Hoefer, Carmine Ventre

Publication date 15 November 2012

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20457

zbMATH Keywords

algorithmic pricingknapsackprimal-dual algorithmsset coverStackelberg game

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Applications of game theory (91A80) Microeconomic theory (price theory and economic markets) (91B24) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

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

Cites work

• A bilevel model of taxation and its application to optimal highway pricing
• A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
• Algorithms and Data Structures
• An approximation algorithm for Stackelberg network pricing
• Approximation algorithms and online mechanisms for item pricing
• Automata, Languages and Programming
• Buying cheap is expensive: hardness of non-parametric multi-product pricing
• Combination Can Be Hard: Approximability of the Unique Coverage Problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Linear tolls suffice: new bounds and algorithms for tolls in single source networks
• On profit-maximizing envy-free pricing
• On profit-maximizing pricing for the highway and tollbooth problems
• Optimal envy-free pricing with metric substitutability
• Reducing mechanism design to algorithm design via machine learning
• Single-minded unlimited supply pricing on sparse instances
• Stackelberg network pricing games
• The Stackelberg minimum spanning tree game
• The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs

Cited in

(14)

• Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree
• Tight bounds on the relative performances of pricing mechanisms in storable good markets
• The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
• Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
• On the Stackelberg knapsack game
• A Stackelberg knapsack game with weight control
• Stackelberg network pricing games
• Stackelberg bipartite vertex cover and the preflow algorithm
• Specializations and generalizations of the Stackelberg minimum spanning tree game
• Stackelberg network pricing games
• On the Complexity of Stackelberg Matroid Pricing Problems
• Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
• Stackelberg packing games
• Solution techniques for bi-level knapsack problems

This page was built for publication: On Stackelberg pricing with computationally bounded customers

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