The following pages link to (Q4537739):
Displaying 23 items.
- Two algorithms for the student-project allocation problem (Q924544) (← links)
- On the stable \(b\)-matching polytope. (Q1414822) (← links)
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- Applications of discrete convex analysis to mathematical economics (Q1769600) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Envy-free matchings with lower quotas (Q1986955) (← links)
- On the set of many-to-one strongly stable fractional matchings (Q2019364) (← links)
- Stable schedule matchings (Q2454577) (← links)
- A general two-sided matching market with discrete concave utility functions (Q2492196) (← links)
- Blockers and antiblockers of stable matchings (Q2637344) (← links)
- Strategyproof allocation mechanisms with endowments and M-convex distributional constraints (Q2680800) (← links)
- A Matroid Approach to Stable Matchings with Lower Quotas (Q2806830) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas (Q2976150) (← links)
- Finding a Stable Allocation in Polymatroid Intersection (Q5108257) (← links)
- (Q5136288) (← links)
- Matroidal Choice Functions (Q5234660) (← links)
- On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market (Q5252230) (← links)
- (Q5743384) (← links)
- Semi-streaming algorithms for submodular matroid intersection (Q5918428) (← links)
- Semi-streaming algorithms for submodular matroid intersection (Q5925648) (← links)
- Efficient matching under general constraints (Q6565039) (← links)
- Solving the maximum popular matching problem with matroid constraints (Q6581613) (← links)
