Approximating the revenue maximization problem with sharp demands
type: Item
instance of: scholarly article
title: Approximating the revenue maximization problem with sharp demands
zbMATH Open document ID: 1356.91049
author: Vittorio Bilò
author: Michele Flammini
author: Gianpiero Monaco
published in: Theoretical Computer Science
publication date: 2017-01-09T00:00:00Z
Mathematics Subject Classification ID: 91B26
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6672922
zbMATH Keywords: envy-freeness
zbMATH Keywords: revenue maximization
zbMATH Keywords: auction with sharp demands
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.12.002
OpenAlex ID: W1561522906
cites work: Automata, Languages and Programming
cites work: Approximating the Revenue Maximization Problem with Sharp Demands
cites work: Uniform Budgets and the Envy-Free Pricing Problem
cites work: Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply
cites work: Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
cites work: Envy-Free Pricing in Multi-item Markets
cites work: On revenue maximization with sharp multi-unit demands
cites work: Optimal Envy-Free Pricing with Metric Substitutability
cites work: Combination Can Be Hard: Approximability of the Unique Coverage Problem
cites work: Pricing Ad Slots with Consecutive Multi-unit Demand
cites work: Multi‐Unit Bayesian Auction with Demand or Budget Constraints
cites work: Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets
cites work: Combinatorial Walrasian Equilibrium
cites work: On profit-maximizing envy-free pricing
cites work: A Nonparametric Approach to Multiproduct Pricing
DOI: 10.1016/J.TCS.2016.12.002
description: scientific article; zbMATH DE number 6672922