Pages that link to "Item:Q5944742"
From MaRDI portal
The following pages link to On preferences over subsets and the lattice structure of stable matchings (Q5944742):
Displayed 26 items.
- The blocking lemma and group incentive compatibility for matching with contracts (Q309845) (← links)
- On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets (Q404743) (← links)
- Dominant strategy implementation of stable rules (Q417718) (← links)
- A many-to-many `rural hospital theorem' (Q462856) (← links)
- The blocking lemma and strategy-proofness in many-to-many matchings (Q523460) (← links)
- The blocking lemma for a many-to-one matching model (Q617603) (← links)
- Restabilizing matching markets at senior level (Q705941) (← links)
- Agreement toward stability in matching markets (Q766251) (← links)
- Stable schedule matching under revealed preference. (Q1414616) (← links)
- The presence of lattice theory in discrete problems of mathematical social sciences. Why. (Q1414820) (← links)
- An algorithm to compute the full set of many-to-many stable matchings. (Q1431789) (← links)
- Time horizons, lattice structures, and welfare in multi-period matching markets (Q1756324) (← links)
- On lexicographic choice (Q1788027) (← links)
- Choice stabilities in the graph model for conflict resolution (Q2140291) (← links)
- Rationalizable choice functions (Q2206803) (← links)
- Untruthful dominant strategies for the deferred acceptance algorithm (Q2275655) (← links)
- Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720) (← links)
- Von Neumann-Morgenstern stable sets in matching problems (Q2373788) (← links)
- Pareto stability in two-sided many-to-many matching with weak preferences (Q2425160) (← links)
- Characterizations of the optimal stable allocation mechanism (Q2467483) (← links)
- Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration (Q2482665) (← links)
- On the invariance of the set of stable matchings with respect to substitutable preference profiles (Q2482670) (← links)
- On Lattice and DA (Q4606763) (← links)
- On Capacity-Filling and Substitutable Choice Rules (Q4958546) (← links)
- Affinely representable lattices, stable matchings, and choice functions (Q5918423) (← links)
- Affinely representable lattices, stable matchings, and choice functions (Q5925643) (← links)