Axioms for deferred acceptance
From MaRDI portal
Publication:3564693
Recommendations
Cited in
(69)- Object allocation via immediate-acceptance: characterizations and an affirmative action application
- Gender consistent resolving rules in marriage problems
- On lexicographic choice
- An alternative characterization of the deferred acceptance algorithm
- Some further properties of the cumulative offer process
- Efficiency, stability, and commitment in senior level job matching markets
- A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences
- Resource allocation on the basis of priorities under multi-unit demand
- Valuation monotonicity, fairness and stability in assignment problems
- Serial dictatorship mechanisms with reservation prices: heterogeneous objects
- Sequential school choice: theory and evidence from the field and lab
- Axiomatic foundations of the core for games in effectiveness form
- A new fairness notion in the assignment of indivisible resources
- Deferred acceptance algorithm with retrade
- Equivalence theorem in matching with contracts
- On stable and efficient mechanisms for priority-based allocation problems
- Essentially stable matchings
- Serial dictatorship mechanisms with reservation prices
- Evolution and Rawlsian social choice in matching
- Top trading cycles, consistency, and acyclic priorities for house allocation with existing tenants
- The modified Boston mechanism
- Incentives in landing slot problems
- Partnership-enhancement and stability in matching problems
- New axioms for deferred acceptance
- When preference misreporting is harm[less]ful?
- Preference profiles for efficiency, fairness, and consistency in school choice problems
- Efficient resource allocation under multi-unit demand
- The ``Boston school-choice mechanism: an axiomatic approach
- Characterizations of the sequential priority rules in the assignment of object types
- Making just school assignments
- Alternative characterizations of Boston mechanism
- Alternative characterizations of the top trading cycles rule in housing markets
- School choice with preference rank classes
- Object allocation via deferred-acceptance: strategy-proofness and comparative statics
- An alternative characterization of top trading cycles
- Fictitious students creation incentives in school choice problems
- School choice with controlled choice constraints: hard bounds versus soft bounds
- Dominant strategy implementation of stable rules
- Comparing school choice mechanisms by interim and ex-ante welfare
- The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods
- A new perspective on Kesten's school choice with consent idea
- On capacity-filling and substitutable choice rules
- Deferred acceptance with compensation chains
- Delayed Acceptance ABC-SMC
- Strategy-proofness makes the difference: deferred-acceptance with responsive priorities
- Two school systems, one district: what to do when a unified admissions process is impossible
- Stable and extremely unequal
- A modification aimed at reducing the manipulability and inefficiency of the Boston school choice mechanism
- Singles monotonicity and stability in one-to-one matching problems
- On the efficiency and fairness of deferred acceptance with single tie-breaking
- Regret-free truth-telling in school choice with consent
- On the consistency of deferred acceptance when priorities are acceptant substitutable
- A characterization of the top trading cycles mechanism for the school choice problem
- New axioms for immediate acceptance
- Characterizations of the cumulative offer process
- A necessary and sufficient condition for weak Maskin monotonicity in an allocation problem with indivisible goods
- Choice or competition: does integration benefit everyone?
- Improving the deferred acceptance with minimal compromise
- Some new characterizations of top trading cycles
- When do reforms meet fairness concerns in school admissions?
- Gradual matching with affirmative action
- Market design with deferred acceptance: a recipe for characterizations
- Credibility of group manipulation in random assignments
- Local non-bossiness
- Assigning tasks to pairs
- Simple manipulations of Walrasian equilibrium rules in assignment problems
- Decentralized college admissions under single application
- Constrained stability in two-sided matching markets
- Impossibility of stable and nonbossy matching mechanisms
This page was built for publication: Axioms for deferred acceptance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564693)
