The envy-free pricing problem, unit-demand markets and connections with the network pricing problem

DOI10.1016/j.disopt.2015.09.003zbMath1390.91136OpenAlexW2210199651MaRDI QIDQ1751179

Carlos E. Ferreira, Cristina G. Fernandes, Álvaro J. P. Franco, Rafael C. S. Schouery

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.09.003

zbMATH Keywords

pricing problemsenvy-free allocationsunit-demand auctions

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Microeconomic theory (price theory and economic markets) (91B24) Consumer behavior, demand theory (91B42) Approximation algorithms (68W25)

Related Items (7)

Mixed-integer formulations for the capacitated rank pricing problem with envy ⋮ On envy-free perfect matching ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ The rank pricing problem: models and branch-and-cut algorithms ⋮ The rank pricing problem with ties ⋮ Approximation algorithms for the max-buying problem with limited supply ⋮ Competitive location and pricing on a line with metric transportation costs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient heuristic algorithms for maximum utility product pricing problems
• Maximum utility product pricing models and algorithms based on reservation price
• Valid inequalities and branch-and-cut for the clique pricing problem
• A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
• A polyhedral study of the network pricing problem with connected toll arcs
• Emergence of Scaling in Random Networks
• Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply
• The Envy-Free Pricing Problem and Unit-Demand Markets
• Decomposition Principle for Linear Programs
• A Nonparametric Approach to Multiproduct Pricing
• Uniform Budgets and the Envy-Free Pricing Problem
• Relations between average case complexity and approximation complexity
• On the power of unique 2-prover 1-round games
• Envy-Free Pricing in Multi-item Markets
• On Hardness of Pricing Items for Single-Minded Bidders
• Random Plane Networks
• Algorithms and Data Structures
• Approximation Algorithms for the Max-Buying Problem with Limited Supply
• Automata, Languages and Programming
• Mathematical Programs with Optimization Problems in the Constraints
• Bilevel programming and price setting problems

This page was built for publication: The envy-free pricing problem, unit-demand markets and connections with the network pricing problem