Pages that link to "Item:Q1753285"
From MaRDI portal
The following pages link to The lattice of envy-free matchings (Q1753285):
Displaying 14 items.
- Envy-free matchings with lower quotas (Q1986955) (← links)
- College admissions with ties and common quotas: integer programming approach (Q2077946) (← links)
- Lattice structure of the random stable set in many-to-many matching markets (Q2078071) (← links)
- Entering classes in the college admissions model (Q2212783) (← links)
- The envy-free matching problem with pairwise preferences (Q2234784) (← links)
- Random matching under priorities: stability and no envy concepts (Q2325654) (← links)
- The lattice of worker-quasi-stable matchings (Q2675448) (← links)
- Envy-freeness and relaxed stability: hardness and approximation algorithms (Q5925588) (← links)
- Constrained-optimal tradewise-stable outcomes in the one-sided assignment game: a solution concept weaker than the core (Q6063093) (← links)
- The lattice of envy-free many-to-many matchings with contracts (Q6145086) (← links)
- Envy-free matchings in bipartite graphs and their applications to fair division (Q6154777) (← links)
- Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective (Q6162047) (← links)
- Optimal cost-based allocations under two-sided preferences (Q6182910) (← links)
- Popular critical matchings in the many-to-many setting (Q6199405) (← links)
