Algorithms and Data Structures

DOI10.1007/11534273zbMath1161.68877MaRDI QIDQ5394270

Vladlen Koltun, Jason D. Hartline

Publication date: 25 October 2006

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

Full work available at URL: https://doi.org/10.1007/11534273

Mathematics Subject Classification ID

91B24: Microeconomic theory (price theory and economic markets)

68W25: Approximation algorithms

Related Items

On stackelberg pricing with computationally bounded customers, On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer, Envy-free pricing in multi-item markets, Unnamed Item, On revenue maximization with sharp multi-unit demands, The Stackelberg minimum spanning tree game, On the complexity of a bundle pricing problem, On the complexity of the highway problem, Price strategy implementation, Optimal bundle pricing with monotonicity constraint, Reducing mechanism design to algorithm design via machine learning, The complexity of optimal multidimensional pricing for a unit-demand buyer, The envy-free pricing problem, unit-demand markets and connections with the network pricing problem, On fair price discrimination in multi-unit markets, On social envy-freeness in multi-unit markets, Selling multiple correlated goods: revenue maximization and menu-size complexity, On envy-free perfect matching, Stackelberg network pricing games, Extreme value theorems for optimal multidimensional pricing, Envy-free pricing with general supply constraints for unit demand consumers, Pricing on Paths: A PTAS for the Highway Problem, Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets