scholarly journals Matching with floor constraints

2021 ◽  
Vol 16 (3) ◽  
pp. 911-942
Author(s):  
Sumeyra Akin
Keyword(s):  
Additional Condition ◽  
Stable Matching ◽  
Medical Residency ◽  
Matching Markets ◽  
Prominent Feature ◽  
Stable Matchings ◽  
Teacher Assignment ◽  
Is Strategy ◽  
Strategy Proof ◽  
Hard Floor

Floor constraints are a prominent feature of many matching markets, such as medical residency, teacher assignment, and military cadet matching. We develop a theory of matching markets under floor constraints. We introduce a stability notion, which we call floor respecting stability, for markets in which (hard) floor constraints must be respected. A matching is floor respecting stable if there is no coalition of doctors and hospitals that can propose an alternative matching that is feasible and an improvement for its members. Our stability notion imposes the additional condition that a coalition cannot reassign a doctor outside the coalition to another hospital (although she can be fired). This condition is necessary to guarantee the existence of stable matchings. We provide a mechanism that is strategy‐proof for doctors and implements a floor respecting stable matching.

scholarly journals Weighted Matching Markets with Budget Constraints

2019 ◽  
Vol 65 ◽  
pp. 393-421 ◽  
Author(s):  
Anisse Ismaili ◽  
Naoto Hamada ◽  
Yuzhe Zhang ◽  
Takamasa Suzuki ◽  
Makoto Yokoo
Keyword(s):  
Polynomial Time ◽  
Real World ◽  
Stable Matching ◽  
The Other ◽  
Matching Markets ◽  
Pairwise Stability ◽  
Negative Results ◽  
Strategy Proof ◽  
Pareto Efficient ◽  
Coalitional Stability

We investigate markets with a set of students on one side and a set of colleges on the other. A student and college can be linked by a weighted contract that defines the student's wage, while a college's budget for hiring students is limited. Stability is a crucial requirement for matching mechanisms to be applied in the real world. A standard stability requirement is coalitional stability, i.e., no pair of a college and group of students has any incentive to deviate. We find that a coalitionally stable matching is not guaranteed to exist, verifying the coalitional stability for a given matching is coNP-complete, and the problem of finding whether a coalitionally stable matching exists in a given market, is SigmaP2-complete: NPNP-complete. Other negative results also hold when blocking coalitions contain at most two students and one college. Given these computational hardness results, we pursue a weaker stability requirement called pairwise stability, where no pair of a college and single student has an incentive to deviate. Unfortunately, a pairwise stable matching is not guaranteed to exist either. Thus, we consider a restricted market called a typed weighted market, in which students are partitioned into types that induce their possible wages. We then design a strategy-proof and Pareto efficient mechanism that works in polynomial-time for computing a pairwise stable matching in typed weighted markets.

scholarly journals Two-sided strategy-proofness in many-to-many matching markets

2020 ◽  
Author(s):  
Antonio Romero-Medina ◽  
Matteo Triossi
Keyword(s):  
Minimal Condition ◽  
Matching Markets ◽  
Stable Matchings ◽  
Group Strategy ◽  
Proof Rule ◽  
Stable Mechanism ◽  
Strategy Proof ◽  
Strategy Proofness

Abstract We study the existence of group strategy-proof stable rules in many-to-many matching markets under responsiveness of agents’ preferences. We show that when firms have acyclical preferences over workers the set of stable matchings is a singleton, and the worker-optimal stable mechanism is a stable and group strategy-proof rule for firms and workers. Furthermore, acyclicity is the minimal condition guaranteeing the existence of stable and strategy-proof mechanisms in many-to-many matching markets.

scholarly journals Strategic Issues in One-to-One Matching with Externalities

2020 ◽  
pp. 2050015
Author(s):  
Ayşe Mumcu ◽  
Ismail Saglam
Keyword(s):  
Impossibility Result ◽  
Stable Matching ◽  
Matching Problem ◽  
Men And Women ◽  
Strategic Issues ◽  
Stable Mechanism ◽  
Is Strategy ◽  
Strategy Proof ◽  
One To One ◽  
Appl Math

We consider strategic issues in one-to-one matching with externalities. We show that no core (stable) mechanism is strategy-proof, extending an impossibility result of [Roth, A. E. [1982] The economics of matching: Stability and incentives, Math. Oper. Res. 7(4), 617–628] obtained in the absence of externalities. Moreover, we show that there are no limits on successful manipulation of preferences by coalitions of men and women, in contrast with the result of [Demange, G., Gale, D. and Sotomayor, M. [1987] A further note on the stable matching problem, Discrete Appl. Math. 16(3), 217–222] obtained in the absence of externalities.

Sequential Preference Revelation in Incomplete Information Settings

2021 ◽  
Vol 13 (1) ◽  
pp. 116-147
Author(s):  
James Schummer ◽  
Rodrigo A. Velez
Keyword(s):  
Incomplete Information ◽  
Real World ◽  
Private Information ◽  
Allocation Rules ◽  
Is Strategy ◽  
Strategy Proof ◽  
Simultaneous Move

Strategy-proof allocation rules incentivize truthfulness in simultaneous move games, but real world mechanisms sometimes elicit preferences sequentially. Surprisingly, even when the underlying rule is strategy-proof and nonbossy, sequential elicitation can yield equilibria where agents have a strict incentive to be untruthful. This occurs only under incomplete information, when an agent anticipates that truthful reporting would signal false private information about others’ preferences. We provide conditions ruling out this phenomenon, guaranteeing all equilibrium outcomes to be welfare-equivalent to truthful ones. (JEL C73, D45, D82, D83)

Stable Matching with Double Infinity of Workers and Firms

2018 ◽  
Vol 19 (2) ◽  
Author(s):  
Matías Fuentes ◽  
Fernando Tohmé
Keyword(s):  
Stable Matching ◽  
Pareto Optimal ◽  
Stable Matchings ◽  
Large Market ◽  
Countably Infinite

Abstract In this paper we analyze the existence of stable matchings in a two-sided large market in which workers are assigned to firms. The market has a continuum of workers while the set of firms is countably infinite. We show that, under certain reasonable assumptions on the preference correspondences, stable matchings not only exist but are also Pareto optimal.

Near-Feasible Stable Matchings with Couples

2018 ◽  
Vol 108 (11) ◽  
pp. 3154-3169 ◽  
Author(s):  
Thành Nguyen ◽  
Rakesh Vohra
Keyword(s):  
Medical Students ◽  
Stable Matching ◽  
Teaching Hospitals ◽  
Matching Problem ◽  
Stable Matchings ◽  
Student Preferences

The National Resident Matching program seeks a stable matching of medical students to teaching hospitals. With couples, stable matchings need not exist. Nevertheless, for any student preferences, we show that each instance of a matching problem has a “nearby” instance with a stable matching. The nearby instance is obtained by perturbing the capacities of the hospitals. In this perturbation, aggregate capacity is never reduced and can increase by at most four. The capacity of each hospital never changes by more than two. (JEL C78, D47, I11, J41, J44)

scholarly journals Adapting Stable Matchings to Evolving Preferences

2020 ◽  
Vol 34 (02) ◽  
pp. 1830-1837 ◽  
Author(s):  
Robert Bredereck ◽  
Jiehua Chen ◽  
Dušan Knop ◽  
Junjie Luo ◽  
Rolf Niedermeier
Keyword(s):  
Computational Complexity ◽  
Computational Cost ◽  
Modern Society ◽  
Stable Matching ◽  
Stable Marriage ◽  
Fixed Parameter Tractability ◽  
Stable Matchings ◽  
Changing Environments ◽  
Fixed Parameter ◽  
Comprehensive Picture

Adaptivity to changing environments and constraints is key to success in modern society. We address this by proposing “incrementalized versions” of Stable Marriage and Stable Roommates. That is, we try to answer the following question: for both problems, what is the computational cost of adapting an existing stable matching after some of the preferences of the agents have changed. While doing so, we also model the constraint that the new stable matching shall be not too different from the old one. After formalizing these incremental versions, we provide a fairly comprehensive picture of the computational complexity landscape of Incremental Stable Marriage and Incremental Stable Roommates. To this end, we exploit the parameters “degree of change” both in the input (difference between old and new preference profile) and in the output (difference between old and new stable matching). We obtain both hardness and tractability results, in particular showing a fixed-parameter tractability result with respect to the parameter “distance between old and new stable matching”.

Large Electorates

2011 ◽  
Author(s):  
Michel Balinski ◽  
Rida Laraki
Keyword(s):  
Ordered Set ◽  
Common Language ◽  
Is Strategy ◽  
Strategy Proof

This chapter emphasizes the simplification of majority-ranking, stating that an increased number of judges in the jury or voters in an electorate or use of simplified common language help to simplify majority-values of competitors or candidates. Ordered set grades help obtain majority-value by beginning with the majority-grade or the lower middlemost grade and following alternating grades. Unambiguous order among the competitors can be determined with certainty given an increased number of judges or voters and relatively few grades. The competitor’s majority-gauge, which is strategy-proof-in-grading, is explained with the help of a theorem. Upper, lower, and difference tie-breaking rules that are strategy-proof-in-grading share properties with the majority-gauge-ranking.

scholarly journals Beyond Truth-Telling: Preference Estimation with Centralized School Choice and College Admissions

2019 ◽  
Vol 109 (4) ◽  
pp. 1486-1529 ◽  
Author(s):  
Gabrielle Fack ◽  
Julien Grenet ◽  
Yinghua He
Keyword(s):  
School Choice ◽  
Test Scores ◽  
Real Life ◽  
Truth Telling ◽  
Student Preferences ◽  
Ex Post ◽  
Is Strategy ◽  
Deferred Acceptance ◽  
Strategy Proof ◽  
Novel Approaches

We propose novel approaches to estimating student preferences with data from matching mechanisms, especially the Gale-Shapley deferred acceptance. Even if the mechanism is strategy-proof, assuming that students truthfully rank schools in applications may be restrictive. We show that when students are ranked strictly by some ex ante known priority index (e.g., test scores), stability is a plausible and weaker assumption, implying that every student is matched with her favorite school/college among those she qualifies for ex post. The methods are illustrated in simulations and applied to school choice in Paris. We discuss when each approach is more appropriate in real-life settings. (JEL D11, D12, D82, I23)

scholarly journals STRATEGY-PROOF JUDGMENT AGGREGATION

2007 ◽  
Vol 23 (3) ◽  
pp. 269-300 ◽  
Author(s):  
FRANZ DIETRICH ◽  
CHRISTIAN LIST
Keyword(s):  
Deliberative Democracy ◽  
Judgment Aggregation ◽  
Impossibility Theorem ◽  
Is Strategy ◽  
Theoretic Concept ◽  
Game Theoretic ◽  
Strategy Proof ◽  
Strategy Proofness

Which rules for aggregating judgments on logically connected propositions are manipulable and which not? In this paper, we introduce a preference-free concept of non-manipulability and contrast it with a preference-theoretic concept of strategy-proofness. We characterize all non-manipulable and all strategy-proof judgment aggregation rules and prove an impossibility theorem similar to the Gibbard--Satterthwaite theorem. We also discuss weaker forms of non-manipulability and strategy-proofness. Comparing two frequently discussed aggregation rules, we show that “conclusion-based voting” is less vulnerable to manipulation than “premise-based voting”, which is strategy-proof only for “reason-oriented” individuals. Surprisingly, for “outcome-oriented” individuals, the two rules are strategically equivalent, generating identical judgments in equilibrium. Our results introduce game-theoretic considerations into judgment aggregation and have implications for debates on deliberative democracy.

Sign in / Sign up

Export Citation Format

Share Document