Allocation with Weak Priorities and General Constraints

DOI10.1287/OPRE.2022.2329OpenAlexW4285006267MaRDI QIDQ5058045FDOQ5058045

Author name not available (Why is that?)

Publication date: 1 December 2022

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2022.2329

zbMATH Keywords

stabilityprioritycomplex constraints

Mathematics Subject Classification ID

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

Cites Work

• Generalized Nash equilibrium problems
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
• The Core of an N Person Game
• College Admissions and the Stability of Marriage
• A Fixed-Point Approach to Stable Matchings and Some Applications
• Algorithms and Computation
• A new solution to the random assignment problem.
• Substitutes and stability for matching with contracts
• Assignment problems with complementarities
• Approximate Random Allocation Mechanisms
• Algorithmics of Matching Under Preferences
• Fractional solutions for capacitated NTU-games, with applications to stable matchings
• Assignment Mechanisms Under Distributional Constraints
• What matters in school choice tie-breaking? How competition guides design
• Placement Optimization in Refugee Resettlement

Cited In (2)

• Optimal priority assignment with hard constraint
• Random assignment under weak preferences

This page was built for publication: Allocation with Weak Priorities and General Constraints

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