The following pages link to Salman Fadaei (Q408437):
Displayed 6 items.
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
- A simple and fast algorithm for convex decomposition in relax-and-round mechanisms (Q1634087) (← links)
- Generalized assignment problem: truthful mechanism design without money (Q1727952) (← links)
- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets (Q1753496) (← links)
- Truthfulness and Approximation with Value-Maximizing Bidders (Q2819462) (← links)
- Fast Convex Decomposition for Truthful Social Welfare Approximation (Q2936980) (← links)