Approximating the revenue maximization problem with sharp demands
From MaRDI portal
Publication:501665
DOI10.1016/J.TCS.2016.12.002zbMath1356.91049OpenAlexW1561522906MaRDI QIDQ501665
Vittorio Bilò, Gianpiero Monaco, Michele Flammini
Publication date: 9 January 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.12.002
Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)
Related Items (3)
Unnamed Item ⋮ On fair price discrimination in multi-unit markets ⋮ On social envy-freeness in multi-unit markets
Cites Work
- Unnamed Item
- On revenue maximization with sharp multi-unit demands
- Pricing Ad Slots with Consecutive Multi-unit Demand
- Optimal Envy-Free Pricing with Metric Substitutability
- Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply
- Approximating the Revenue Maximization Problem with Sharp Demands
- A Nonparametric Approach to Multiproduct Pricing
- Combination Can Be Hard: Approximability of the Unique Coverage Problem
- Combinatorial Walrasian Equilibrium
- Uniform Budgets and the Envy-Free Pricing Problem
- Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets
- Envy-Free Pricing in Multi-item Markets
- Multi‐Unit Bayesian Auction with Demand or Budget Constraints
- Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
- Automata, Languages and Programming
This page was built for publication: Approximating the revenue maximization problem with sharp demands
