Pages that link to "Item:Q1975360"

The following pages link to Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) (Q1975360):

Displaying 37 items.

• Improving schools through school choice: a market design approach (Q337801) (← links)
• On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets (Q404743) (← links)
• Many-to-many matching with max-min preferences (Q477355) (← links)
• The stability of many-to-many matching with max-min preferences (Q500490) (← links)
• The blocking lemma and strategy-proofness in many-to-many matchings (Q523460) (← links)
• Equitable representation and recruitment (Q537577) (← links)
• Stable multi-skill workforce assignments (Q744637) (← links)
• Agreement toward stability in matching markets (Q766251) (← links)
• Friend of my friend: network formation with two-hop benefit (Q904688) (← links)
• On the stable \(b\)-matching polytope. (Q1414822) (← links)
• An algorithm to compute the full set of many-to-many stable matchings. (Q1431789) (← links)
• The stable fixtures problem with payments (Q1651275) (← links)
• The stable \(b\)-matching polytope revisited (Q1801060) (← links)
• Student admissions and faculty recruitment (Q1885915) (← links)
• Faster algorithms for stable allocation problems (Q1959735) (← links)
• Three-sided matching problem with mixed preferences (Q2060065) (← links)
• Matching and scheduling of student-company-talks for a university it-speed dating event (Q2167666) (← links)
• The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
• The diameter of the stable marriage polytope: bounding from below (Q2305917) (← links)
• Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720) (← links)
• The stable fixtures problem -- a many-to-many extension of stable roommates (Q2384396) (← links)
• Efficient resource allocation under multi-unit demand (Q2437801) (← links)
• Characterizations of the optimal stable allocation mechanism (Q2467483) (← links)
• Blockers and antiblockers of stable matchings (Q2637344) (← links)
• Stable allocations and partially ordered sets (Q2684044) (← links)
• Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem (Q2815443) (← links)
• The Stable Fixtures Problem with Payments (Q2827801) (← links)
• Finding a minimum-regret many-to-many Stable Matching (Q2868914) (← links)
• The Generalized Stable Allocation Problem (Q3605501) (← links)
• On Lattice and DA (Q4606763) (← links)
• Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem (Q4995102) (← links)
• New and simple algorithms for stable flow problems (Q5915793) (← links)
• Affinely representable lattices, stable matchings, and choice functions (Q5918423) (← links)
• Affinely representable lattices, stable matchings, and choice functions (Q5925643) (← links)
• A note on many-to-many matchings and stable allocations (Q5962526) (← links)
• Review of the theory of stable matchings and contract systems (Q6039790) (← links)
• Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains (Q6565042) (← links)