Pages that link to "Item:Q2806830"

The following pages link to A Matroid Approach to Stable Matchings with Lower Quotas (Q2806830):

Displaying 18 items.

• The popular matching and condensation problems under matroid constraints (Q346527) (← links)
• Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
• Envy-free matchings with lower quotas (Q1986955) (← links)
• Popular matchings with two-sided preference lists and matroid constraints (Q2290635) (← links)
• Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
• Popularity in the generalized hospital residents setting (Q2399378) (← links)
• Strategy-proof school choice mechanisms with minimum quotas and initial endowments (Q2409677) (← links)
• A note on the serial dictatorship with project closures (Q2450713) (← links)
• A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas (Q2976150) (← links)
• A Matroid Generalization of the Super-Stable Matching Problem (Q5084102) (← links)
• Stable Matching with Proportionality Constraints (Q5129207) (← links)
• (Q5136288) (← links)
• Pareto Stable Matchings under One-Sided Matroid Constraints (Q5232161) (← links)
• Matroidal Choice Functions (Q5234660) (← links)
• Envy-freeness and relaxed stability: hardness and approximation algorithms (Q5925588) (← links)
• Strategyproof mechanism for two-sided matching with resource allocation (Q6098859) (← links)
• Popular critical matchings in the many-to-many setting (Q6199405) (← links)
• Reallocation mechanisms under distributional constraints in the full preference domain (Q6609180) (← links)