A Fixed-Point Approach to Stable Matchings and Some Applications
From MaRDI portal
Publication:5704116
DOI10.1287/moor.28.1.103.14256zbMath1082.90096OpenAlexW1978696336MaRDI QIDQ5704116
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/aff59c6a75541c63b50c897161a6d29ed8c04c83
Related Items (98)
Strategyproof matching with regional minimum and maximum quotas ⋮ Matching with aggregate externalities ⋮ Median stable matchings in two-sided markets ⋮ A solution to matching with preferences over colleagues ⋮ Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints ⋮ On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering ⋮ The blocking lemma and group incentive compatibility for matching with contracts ⋮ Allocation with Weak Priorities and General Constraints ⋮ Blockers and antiblockers of stable matchings ⋮ The popular matching and condensation problems under matroid constraints ⋮ A Matroid Generalization of the Super-Stable Matching Problem ⋮ Stable matchings and fixed points in trading networks: a note ⋮ Finding a Stable Allocation in Polymatroid Intersection ⋮ Strategy-proof school choice mechanisms with minimum quotas and initial endowments ⋮ Paths to stability for college admissions with budget constraints ⋮ Matching with partially ordered contracts ⋮ Strategy-proof Pareto-improvement ⋮ Matching with waiting times: the German entry-level labor market for lawyers ⋮ The lattice of worker-quasi-stable matchings ⋮ Review of the theory of stable matchings and contract systems ⋮ Stable and meta-stable contract networks ⋮ Complexity of stability in trading networks ⋮ Stable matching: An integer programming approach ⋮ The structure of equilibria in trading networks with frictions ⋮ On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets ⋮ Invariant sets and Knaster-Tarski principle ⋮ Popular Matchings with Ties and Matroid Constraints ⋮ A Note on a Two-Sided Discrete-Concave Market with Possibly Bounded Salaries ⋮ The Stable Roommates Problem with Choice Functions ⋮ WARP and combinatorial choice ⋮ The lattice of envy-free many-to-many matchings with contracts ⋮ Contracts versus salaries in matching: a general result ⋮ On a lemma of Scarf. ⋮ Expectational equilibria in many-to-one matching models with contracts ⋮ Finding all stable matchings with couples ⋮ Why do stable clearinghouses work so well? -- Small sets of stable matchings in typical environments, and the limits-on-manipulation theorem of Demange, Gale and Sotomayor ⋮ On Lattice and DA ⋮ Recent Developments in Discrete Convex Analysis ⋮ Equivalent choice functions and stable mechanisms ⋮ Stable schedule matching under revealed preference. ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ On the stable \(b\)-matching polytope. ⋮ A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas ⋮ Substitutes and stability for matching with contracts ⋮ Understanding the generalized median stable matchings ⋮ The stable roommates problem with choice functions ⋮ Almost stable matchings by truncating the Gale-Shapley algorithm ⋮ Two algorithms for the student-project allocation problem ⋮ A modified deferred acceptance algorithm for many-to-one matching markets with externalities among firms ⋮ A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem ⋮ Kernels in weighted digraphs ⋮ Stable schedule matchings ⋮ Antimatroids induced by matchings ⋮ Strategic disaggregation in matching markets ⋮ Choice function-based two-sided markets: stability, lattice property, path independence and algorithms ⋮ Envy-free matchings with lower quotas ⋮ Local Matching Dynamics in Social Networks ⋮ The lattice of envy-free matchings ⋮ On sequences of iterations of increasing and continuous mappings on complete lattices ⋮ Designing matching mechanisms under constraints: an approach from discrete convex analysis ⋮ A college admissions clearinghouse ⋮ Median stable matching for markets with wages ⋮ Core of the assignment game via fixed point methods ⋮ On the invariance of the set of stable matchings with respect to substitutable preference profiles ⋮ Deferred acceptance algorithms: history, theory, practice, and open questions ⋮ Applications of discrete convex analysis to mathematical economics ⋮ A general two-sided matching market with discrete concave utility functions ⋮ Matching with preferences over colleagues solves classical matching ⋮ The college admissions problem with lower and common quotas ⋮ On Stable Matchings and Flows ⋮ Complexity of finding Pareto-efficient allocations of highest welfare ⋮ Binary operations for the lattice structure in a many-to-many matching model ⋮ On convergence of sequences in complete lattices ⋮ On weighted kernels of two posets. ⋮ Popular matchings with two-sided preference lists and matroid constraints ⋮ The Generalized Median Stable Matchings: Finding Them Is Not That Easy ⋮ The stable \(b\)-matching polytope revisited ⋮ A Matroid Approach to Stable Matchings with Lower Quotas ⋮ Slot-specific priorities with capacity transfers ⋮ Stability and median rationalizability for aggregate matchings ⋮ Quantile stable mechanisms ⋮ The diameter of the stable marriage polytope: bounding from below ⋮ Stable Matching in Large Economies ⋮ Envy-free matchings with one-sided preferences and matroid constraints ⋮ A proof of the Erdös-Sands-Sauer-Woodrow conjecture ⋮ Pareto Stable Matchings under One-Sided Matroid Constraints ⋮ Agreement toward stability in matching markets ⋮ Unnamed Item ⋮ Matroidal Choice Functions ⋮ Lattice structure of the random stable set in many-to-many matching markets ⋮ Deferred Acceptance with Compensation Chains ⋮ Polyhedral Aspects of Stable Marriage ⋮ Popularity, Mixed Matchings, and Self-Duality ⋮ Dynamic reserves in matching markets ⋮ An improved algorithm for testing substitutability of weak preferences ⋮ On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market ⋮ Unnamed Item ⋮ Bipartite choices
This page was built for publication: A Fixed-Point Approach to Stable Matchings and Some Applications
