Assignment problems with complementarities

DOI10.1016/j.jet.2016.04.006zbMath1371.91117OpenAlexW3123151482MaRDI QIDQ308621

Mohammad Hasan, M. Dambrine

Publication date: 6 September 2016

Published in: Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jet.2016.04.006

zbMATH Keywords

envy-freecomplementaritiesstrategy-proofmechanismefficientone sided matching

Mathematics Subject Classification ID

Individual preferences (91B08) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (13)

Overlapping multiple object assignments ⋮ The generalized random priority mechanism with budgets ⋮ Interdistrict school choice: a theory of student assignment ⋮ Allocation with Weak Priorities and General Constraints ⋮ Constrained random matching ⋮ Relative entropy and envy-free allocation ⋮ Non-monetary coordination mechanisms for time slot allocation in warehouse delivery ⋮ Multi resource allocation with partial preferences ⋮ Centralized allocation in multiple markets ⋮ Foundations of pseudomarkets: Walrasian equilibria for discrete resources ⋮ Random assignments of bundles ⋮ A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences ⋮ A Simple and Approximately Optimal Mechanism for a Buyer with Complements

Cites Work

• Strategy-proof, efficient, and nonbossy quota allocations
• Incentives in the probabilistic serial mechanism
• Random assignment of multiple indivisible objects
• The ellipsoid method and its consequences in combinatorial optimization
• Indivisible commodities and general equilibrium theory
• Decentralizing lottery allocations in markets with indivisible commodities
• Degree bounded matroids and submodular flows
• Gross substitutes and complements: a simple generalization
• Envy-freeness and implementation in large economies
• Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems
• Stability in Large Matching Markets with Complementarities
• Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
• Approximate Random Allocation Mechanisms
• Equilibria and Indivisibilities: Gross Substitutes and Complements
• Lectures on Polytopes
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Quasi-Equilibria in Markets with Non-Convex Preferences
• A new solution to the random assignment problem.

This page was built for publication: Assignment problems with complementarities