On envy-free perfect matching

DOI10.1016/J.DAM.2018.03.034zbMath1410.91352OpenAlexW2795778997WikidataQ130010181 ScholiaQ130010181MaRDI QIDQ2414450

Claudio Arbib, Mustafa Çelebi Pinar, Oya Ekin Karaşan

Publication date: 17 May 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/52962

zbMATH Keywords

assignmentperfect matchingshortest path problemWalrasian equilibriumenvy-free pricing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General equilibrium theory (91B50) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68)

Related Items (2)

Competitive location and pricing on a line with metric transportation costs ⋮ On complexity classes of envy-free pricing problems: a short survey

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum utility product pricing models and algorithms based on reservation price
• Optimization and mechanism design
• Optimal product design using conjoint analysis: Computational complexity and algorithms
• Walrasian equilibrium with gross substitutes
• The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
• Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply
• A Nonparametric Approach to Multiproduct Pricing
• Uniform Budgets and the Envy-Free Pricing Problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• Algorithms and Data Structures

This page was built for publication: On envy-free perfect matching