Stable schedule matching under revealed preference.

From MaRDI portal
Publication:1414616


DOI10.1016/S0022-0531(03)00096-6zbMath1068.91059MaRDI QIDQ1414616

David Gale, Ahmet U. Alkan

Publication date: 4 December 2003

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


91B68: Matching models


Related Items

On Lattice and DA, Stable Matching in Large Economies, On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market, A coloring property for stable allocations, Median stable matchings in two-sided markets, School choice with controlled choice constraints: hard bounds versus soft bounds, Dominant strategy implementation of stable rules, A many-to-many `rural hospital theorem', Fractional matching markets, Probabilistic stable rules and Nash equilibrium in two-sided matching problems, Contract design and stability in many-to-many matching, Stability and Nash implementation in matching markets with couples, Agreement toward stability in matching markets, Contracts versus salaries in matching: a general result, Monotonicity and Nash implementation in matching markets with contracts, The object allocation problem with random priorities, Incentivizing resilience in financial networks, Fractional solutions for capacitated NTU-games, with applications to stable matchings, A college admissions clearinghouse, Applications of discrete convex analysis to mathematical economics, Stable matchings and preferences of couples, Matching with partially ordered contracts, The integral stable allocation problem on graphs, Substitutes and stability for matching with contracts, The stable roommates problem with choice functions, Graduate admission with financial support, Von Neumann-Morgenstern stable sets in matching problems, Strategy-proof Pareto-improvement, Stable schedule matchings, Fair and efficient student placement with couples, Characterizations of the optimal stable allocation mechanism, A general two-sided matching market with discrete concave utility functions, A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas



Cites Work