Pages that link to "Item:Q4376202"
From MaRDI portal
The following pages link to Of Stable Marriages and Graphs, and Strategy and Polytopes (Q4376202):
Displaying 21 items.
- Equitable representation and recruitment (Q537577) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
- A note on ex-ante stable lotteries (Q1787357) (← links)
- Student admissions and faculty recruitment (Q1885915) (← links)
- On the stable marriage polytope (Q1910547) (← links)
- Stable matchings and linear programming (Q1923201) (← links)
- A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games (Q1959733) (← links)
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) (Q1975360) (← links)
- Bipartite choices (Q2105872) (← links)
- The diameter of the stable marriage polytope: bounding from below (Q2305917) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- Preference swaps for the stable matching problem (Q2699977) (← links)
- Stable and crossing structures (Q2711192) (← links)
- Finding all stable pairs and solutions to the many-to-many stable matching problem (Q2815443) (← links)
- Nash equilibrium in stable matching problems (Q2860080) (← links)
- Total Dual Integrality of Rothblum's Description of the Stable-Marriage Polyhedron (Q3168964) (← links)
- Stable Matchings, Optimal Assignments, and Linear Programming (Q4286935) (← links)
- Polyhedral Aspects of Stable Marriage (Q5244861) (← links)
- On the set of stable matchings in a bipartite graph (Q6078002) (← links)
- Unique stable matchings (Q6176757) (← links)
- Finding all stable matchings with assignment constraints (Q6665678) (← links)
