Pages that link to "Item:Q4286935"
From MaRDI portal
The following pages link to Stable Matchings, Optimal Assignments, and Linear Programming (Q4286935):
Displaying 50 items.
- Stable matchings of teachers to schools (Q329714) (← links)
- Integer programming methods for special college admissions problems (Q346530) (← links)
- Stable marriages and search frictions (Q402071) (← links)
- Task assignment with controlled and autonomous agents (Q459176) (← links)
- Fractional matching markets (Q516999) (← links)
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties (Q528863) (← links)
- Pairwise kidney exchange (Q813943) (← links)
- A unified approach to finding good stable matchings in the hospitals/residents setting (Q930917) (← links)
- Linear programming brings marital bliss (Q1122480) (← links)
- Stable matchings and linear inequalities (Q1336634) (← links)
- Ordinal efficiency and dominated sets of assignments. (Q1411037) (← links)
- On the stable \(b\)-matching polytope. (Q1414822) (← links)
- On a cutting plane heuristic for the stable roommates problem and its applications (Q1577118) (← links)
- A polynomial-time algorithm for the bistable roommates problem (Q1604203) (← links)
- Satisfied two-sided matching: a method considering elation and disappointment of agents (Q1626247) (← links)
- The object allocation problem with random priorities (Q1651226) (← links)
- Competitive pricing and the core: with reference to matching (Q1651304) (← links)
- ``Almost-stable'' matchings in the hospitals/residents problem with couples (Q1701229) (← links)
- Stability, optimality and manipulation in matching problems with weighted preferences (Q1736594) (← links)
- On stable matchings and flows (Q1736598) (← links)
- A note on ex-ante stable lotteries (Q1787357) (← links)
- Perfect matching interdiction problem restricted to a stable vertex (Q1794725) (← links)
- The stable \(b\)-matching polytope revisited (Q1801060) (← links)
- On the stable marriage polytope (Q1910547) (← links)
- Canonical monotone decompositions of fractional stable matchings (Q1914090) (← links)
- Stable matchings and linear programming (Q1923201) (← links)
- Existence of stable outcomes and the lattice property for a unified matching market (Q1974049) (← links)
- On a characterization of stable matchings (Q1978730) (← links)
- Compromises and rewards: stable and non-manipulable probabilistic matching (Q2002058) (← links)
- On the set of many-to-one strongly stable fractional matchings (Q2019364) (← links)
- Lattice structure of the random stable set in many-to-many matching markets (Q2078071) (← links)
- Stable matching of student-groups to dormitories (Q2140313) (← links)
- Welfare theorems for random assignments with priorities (Q2212739) (← links)
- Too good to fire: non-assortative matching to play a dynamic game (Q2212776) (← links)
- Stable fractional matchings (Q2238635) (← links)
- A note on the lattice structure for matching markets via linear programming (Q2246170) (← links)
- The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching (Q2291153) (← links)
- A characterization of strongly stable fractional matchings (Q2307322) (← links)
- An enhanced approach for two-sided matching with 2-tuple linguistic multi-attribute preference (Q2318614) (← links)
- Random matching under priorities: stability and no envy concepts (Q2325654) (← links)
- Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720) (← links)
- Jointly stable matchings (Q2424832) (← links)
- Characterizations of the optimal stable allocation mechanism (Q2467483) (← links)
- A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion (Q2482673) (← links)
- Monotonicity and consistency in matching markets (Q2491082) (← links)
- Blockers and antiblockers of stable matchings (Q2637344) (← links)
- Disjoint stable matchings in linear time (Q2672428) (← links)
- The vigilant eating rule: a general approach for probabilistic economic design with constraints (Q2675446) (← links)
- Stable allocations and partially ordered sets (Q2684044) (← links)
- Marriage market with indifferences: a linear programming approach (Q2687690) (← links)
