The following pages link to Masoud Seddighin (Q1739116):
Displayed 15 items.
- Expand the shares together: envy-free mechanisms with a small number of cuts (Q1739119) (← links)
- Maximin share guarantee for goods with positive externalities (Q2244422) (← links)
- Rent division among groups (Q2327142) (← links)
- Approximate minimum diameter (Q2412413) (← links)
- Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
- Approximate competitive equilibrium with generic budget (Q2670929) (← links)
- Fair Allocation of Indivisible Goods to Asymmetric Agents (Q4611397) (← links)
- Fair Allocation of Indivisible Goods: Improvement (Q4958554) (← links)
- Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) (← links)
- Improved Algorithms for Edit Distance and LCS: Beyond Worst Case (Q5146877) (← links)
- Unit Covering in Color-Spanning Set Model (Q5176571) (← links)
- Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier (Q5236256) (← links)
- On the Distortion Value of Elections with Abstention (Q5856473) (← links)
- (Q6126361) (← links)
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem (Q6152666) (← links)