Approximating the revenue maximization problem with sharp demands

DOI10.1016/J.TCS.2016.12.002MaRDI QIDQ501665zbMATHOpenAlexFDO

Authors Vittorio Bilò, Michele Flammini, Gianpiero Monaco

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

zbMATH Keywords

revenue maximizationenvy-freenessauction with sharp demands

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)

Recommendations

• Approximating the revenue maximization problem with sharp demands
• On revenue maximization with sharp multi-unit demands
• Approximate revenue maximization with multiple items
• Envy-Free Pricing in Multi-item Markets
• Envy-free pricing in multi-item markets

Cites work

• A Nonparametric Approach to Multiproduct Pricing
• Approximating the revenue maximization problem with sharp demands
• Automata, Languages and Programming
• Combination Can Be Hard: Approximability of the Unique Coverage Problem
• Combinatorial Walrasian equilibrium
• Envy-Free Pricing in Multi-item Markets
• Improved hardness results for profit maximization pricing problems with unlimited supply
• Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets
• Multi-unit Bayesian auction with demand or budget constraints
• On profit-maximizing envy-free pricing
• On revenue maximization with sharp multi-unit demands
• Optimal envy-free pricing with metric substitutability
• Pricing ad slots with consecutive multi-unit demand
• Uniform Budgets and the Envy-Free Pricing Problem

Cited in

(9)

• Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations
• Sampling and Representation Complexity of Revenue Maximization
• On fair price discrimination in multi-unit markets
• A closer look at two conjectures about irregular marginal revenue
• On social envy-freeness in multi-unit markets
• Approximating the revenue maximization problem with sharp demands
• Pricing problems with buyer preselection
• Improved two sample revenue guarantees via mixed-integer linear programming
• On revenue maximization with sharp multi-unit demands

This page was built for publication: Approximating the revenue maximization problem with sharp demands

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501665)