Algorithms and Data Structures

DOI10.1007/11534273zbMath1161.68877OpenAlexW3010016474MaRDI 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

Microeconomic theory (price theory and economic markets) (91B24) Approximation algorithms (68W25)

Related Items (22)

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

This page was built for publication: Algorithms and Data Structures