The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
type: Item
instance of: scholarly article
title: The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
zbMATH Open document ID: 1390.91136
author: Cristina G. Fernandes
author: Carlos E. Ferreira
author: Álvaro J. P. Franco
author: Rafael C. S. Schouery
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 91B24
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 91B42
zbMATH DE Number: 6872101
zbMATH Keywords: pricing problems
zbMATH Keywords: envy-free allocations
zbMATH Keywords: unit-demand auctions
MaRDI profile type: Publication
full work available at URL: j.disopt.2015.09.003
OpenAlex ID: W2210199651
cites work: A Nonparametric Approach to Multiproduct Pricing
cites work: Automata, Languages and Programming
cites work: Approximation Algorithms for the Max-Buying Problem with Limited Supply
cites work: On profit-maximizing envy-free pricing
cites work: Algorithms and Data Structures
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: Q2934658
cites work: Q3002785
cites work: Relations between average case complexity and approximation complexity
cites work: On Hardness of Pricing Items for Single-Minded Bidders
cites work: On the power of unique 2-prover 1-round games
cites work: Envy-Free Pricing in Multi-item Markets
cites work: Maximum utility product pricing models and algorithms based on reservation price
cites work: Efficient heuristic algorithms for maximum utility product pricing problems
cites work: A bilevel model of taxation and its application to optimal highway pricing
cites work: Mathematical Programs with Optimization Problems in the Constraints
cites work: A polyhedral study of the network pricing problem with connected toll arcs
cites work: Valid inequalities and branch-and-cut for the clique pricing problem
cites work: Bilevel programming and price setting problems
cites work: Decomposition Principle for Linear Programs
cites work: Q3588651
cites work: The Envy-Free Pricing Problem and Unit-Demand Markets
cites work: Random Plane Networks
cites work: Emergence of Scaling in Random Networks
DOI: 10.1016/J.DISOPT.2015.09.003
Recommended article: The Envy-Free Pricing Problem and Unit-Demand Markets
Recommended article: Envy-free pricing with general supply constraints for unit demand consumers
Recommended article: Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare
Recommended article: On profit-maximizing envy-free pricing
Recommended article: On Envy-Free Pareto Efficient Pricing
Recommended article: Uniform Budgets and the Envy-Free Pricing Problem
Recommended article: Optimal Envy-Free Pricing with Metric Substitutability
Recommended article: Envy-free pricing in multi-item markets
Recommended article: Envy-Free Pricing in Multi-item Markets
description: scientific article; zbMATH DE number 6872101