Envy-free pricing in multi-item markets

DOI10.1145/2567923zbMath1322.91032OpenAlexW2029622310MaRDI QIDQ5501961

Ning Chen, Xiaotie Deng

Publication date: 14 August 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2567923

zbMATH Keywords

envy-freenessalgorithmic pricing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Microeconomic theory (price theory and economic markets) (91B24) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

On revenue maximization with sharp multi-unit demands ⋮ Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• The ellipsoid method and its consequences in combinatorial optimization
• The assignment game. I: The core
• The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers
• Optimal Envy-Free Pricing with Metric Substitutability
• Uniform Budgets and the Envy-Free Pricing Problem
• A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
• Combination can be hard
• Single-minded unlimited supply pricing on sparse instances
• On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
• Algorithms and Data Structures
• Automata, Languages and Programming

This page was built for publication: Envy-free pricing in multi-item markets