Uniform Budgets and the Envy-Free Pricing Problem

DOI10.1007/978-3-540-70575-8_66MaRDI QIDQ3521968zbMATH OpenOpenAlexFDO

Authors Patrick Briest

Publication date 28 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70575-8_66

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Microeconomic theory (price theory and economic markets) (91B24)

Recommendations

• Revenue maximizing envy-free pricing in matching markets with budgets
• On profit-maximizing envy-free pricing
• Buying cheap is expensive: approximability of combinatorial pricing problems
• The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
• Revenue maximizing envy-free fixed-price auctions with budgets

Cited in

(25)

• The complexity of optimal multidimensional pricing for a unit-demand buyer
• The rank pricing problem: models and branch-and-cut algorithms
• The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
• Approximation algorithms for the max-buying problem with limited supply
• On envy-free revenue approximation for combinatorial buyers with budgets
• On fair price discrimination in multi-unit markets
• Pricing lotteries
• Online pricing for multi-type of items
• On social envy-freeness in multi-unit markets
• On envy-free perfect matching
• Stackelberg network pricing games
• Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011
• Envy-free pricing with general supply constraints for unit demand consumers
• On revenue maximization with sharp multi-unit demands
• Envy-free revenue approximation for asymmetric buyers with budgets
• Buying cheap is expensive: hardness of non-parametric multi-product pricing
• The envy-free pricing problem and unit-demand markets
• Buying cheap is expensive: approximability of combinatorial pricing problems
• Pricing problems with buyer preselection
• Approximating the revenue maximization problem with sharp demands
• On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer
• Envy-free pricing in multi-item markets
• Maximizing one-way trading revenue in photovoltaic energy generation
• An algorithmic framework for black-box reductions from Bayesian mechanism design to algorithm design
• Online pricing for bundles of multiple items

This page was built for publication: Uniform Budgets and the Envy-Free Pricing Problem

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