Pages that link to "Item:Q1190600"

The following pages link to Characterization of stable matchings as extreme points of a polytope (Q1190600):

Displaying 50 items.

• Integer programming methods for special college admissions problems (Q346530) (← links)
• Stable marriages and search frictions (Q402071) (← links)
• Fractional matching markets (Q516999) (← links)
• Complexity of the sex-equal stable marriage problem (Q689901) (← links)
• Characterization of super-stable matchings (Q832893) (← links)
• Stable matchings and linear inequalities (Q1336634) (← links)
• One-node cutsets and the dominating set polytope (Q1356733) (← 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)
• An elementary integrality proof of Rothblum's stable matching formulation (Q1709952) (← links)
• Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
• Stable marriage and roommates problems with restricted edges: complexity and approximability (Q1751156) (← links)
• Matching with indifferences: a comparison of algorithms in the context of course allocation (Q1753433) (← links)
• Popular edges and dominant matchings (Q1800997) (← links)
• The stable \(b\)-matching polytope revisited (Q1801060) (← links)
• Courtship and linear programming (Q1805218) (← links)
• Canonical monotone decompositions of fractional stable matchings (Q1914090) (← links)
• Stable matchings and linear programming (Q1923201) (← links)
• Bistable versions of the marriages and roommates problems (Q1970204) (← links)
• Existence of stable outcomes and the lattice property for a unified matching market (Q1974049) (← 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 fractional matchings (Q2238635) (← links)
• The rank pricing problem with ties (Q2239986) (← links)
• A note on the lattice structure for matching markets via linear programming (Q2246170) (← links)
• A characterization of strongly stable fractional matchings (Q2307322) (← links)
• Random matching under priorities: stability and no envy concepts (Q2325654) (← links)
• Blockers and antiblockers of stable matchings (Q2637344) (← links)
• Stable allocations and partially ordered sets (Q2684044) (← links)
• Marriage market with indifferences: a linear programming approach (Q2687690) (← links)
• A Matroid Approach to Stable Matchings with Lower Quotas (Q2806830) (← links)
• A Polyhedral Description of Kernels (Q3186539) (← links)
• Popularity, Mixed Matchings, and Self-Duality (Q5000640) (← links)
• Understanding Popular Matchings via Stable Matchings (Q5028352) (← links)
• An extendable stable matching algorithm of a kind of bipartite graph (Q5069846) (← links)
• Quasi-Popular Matchings, Optimality, and Extended Formulations (Q5076707) (← links)
• (Q5091034) (← links)
• Polyhedral Aspects of Stable Marriage (Q5244861) (← links)
• (Q5743384) (← links)
• Affinely representable lattices, stable matchings, and choice functions (Q5918423) (← links)
• Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)
• Affinely representable lattices, stable matchings, and choice functions (Q5925643) (← links)
• Efficiency and stability of probabilistic assignments in marriage problems (Q5964688) (← links)
• Stable matching: An integer programming approach (Q6053647) (← links)
• On the set of stable matchings in a bipartite graph (Q6078002) (← links)
• Maximum matchings and popularity (Q6490278) (← links)