On revenue maximization with sharp multi-unit demands
From MaRDI portal
Publication:266046
DOI10.1007/s10878-014-9817-yzbMath1341.91101arXiv1210.0203OpenAlexW2075022665MaRDI QIDQ266046
Paul W. Goldberg, Xiaotie Deng, Ning Chen, Jinshan Zhang
Publication date: 13 April 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.0203
Auctions, bargaining, bidding and selling, and other market models (91B26) Consumer behavior, demand theory (91B42)
Related Items
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare, Unnamed Item, Approximating the revenue maximization problem with sharp demands, On fair price discrimination in multi-unit markets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strategy-proof, efficient, and nonbossy quota allocations
- Multi-unit auctions with uniform prices
- Walrasian equilibrium with gross substitutes
- Vickrey auctions with reserve pricing
- The assignment game. I: The core
- Pricing Ad Slots with Consecutive Multi-unit Demand
- Optimal Envy-Free Pricing with Metric Substitutability
- Approximating the Revenue Maximization Problem with Sharp Demands
- Uniform Budgets and the Envy-Free Pricing Problem
- Single-minded unlimited supply pricing on sparse instances
- Combinatorial Auctions with Verification Are Tractable
- Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets
- On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
- Algorithms and Data Structures
- Envy-free pricing in multi-item markets
