Stable schedule matching under revealed preference.
From MaRDI portal
Publication:1414616
Recommendations
Cites work
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- A Fixed-Point Approach to Stable Matchings and Some Applications
- A class of multipartner matching markets with a strong lattice structure
- College Admissions and the Stability of Marriage
- Comparative statics in matching markets
- Competitive equilibrium in an exchange economy with indivisibilities
- Job Matching, Coalition Formation, and Gross Substitutes
- On preferences over subsets and the lattice structure of stable matchings
- Path Independence, Rationality, and Social Choice
- Stability and Polarization of Interests in Job Matching
- The College Admissions Problem Revisited
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- The Stable Allocation (or Ordinal Transportation) Problem
- The assignment game. I: The core
- Three remarks on the many-to-many stable matching problem
- Walrasian equilibrium with gross substitutes
Cited in
(48)- Stability and Nash implementation in matching markets with couples
- Applications of discrete convex analysis to mathematical economics
- A general two-sided matching market with discrete concave utility functions
- Monotonicity and Nash implementation in matching markets with contracts
- Stable matchings and preferences of couples
- A coloring property for stable allocations
- Fractional solutions for capacitated NTU-games, with applications to stable matchings
- School choice with controlled choice constraints: hard bounds versus soft bounds
- Substitutes and stability for matching with contracts
- Matching with partially ordered contracts
- Characterizations of the optimal stable allocation mechanism
- Finding a stable allocation in polymatroid intersection
- Von Neumann-Morgenstern stable sets in matching problems
- Review of the theory of stable matchings and contract systems
- scientific article; zbMATH DE number 1841882 (Why is no real title available?)
- Dominant strategy implementation of stable rules
- Contract design and stability in many-to-many matching
- Comparative statics for size-dependent discounts in matching markets
- The integral stable allocation problem on graphs
- The object allocation problem with random priorities
- Graduate admission with financial support
- Incentivizing resilience in financial networks
- Interdistrict school choice: a theory of student assignment
- Probabilistic stable rules and Nash equilibrium in two-sided matching problems
- Stable schedule matching under revealed preference
- Stable matching: An integer programming approach
- Contracts versus salaries in matching: a general result
- On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
- Rationalizable choice functions
- On lattice and DA
- Agreement toward stability in matching markets
- On stable assignments generated by choice functions of mixed type
- Fractional matching markets
- A many-to-many `rural hospital theorem'
- Stable schedule matchings
- A college admissions clearinghouse
- A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
- On capacity-filling and substitutable choice rules
- Stable matching in large economies
- The vigilant eating rule: a general approach for probabilistic economic design with constraints
- Fair and efficient student placement with couples
- A theory of fair random allocation under priorities
- Quantile stable mechanisms
- Median stable matchings in two-sided markets
- The stable roommates problem with choice functions
- Substitutes and stability for many-to-many matching with contracts
- Choice functions on posets
- Strategy-proof Pareto-improvement
This page was built for publication: Stable schedule matching under revealed preference.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1414616)
