2 citations · 5 across the 6 of their papers we have counts for
7 papers
A Note on Relaxation and Rounding in Algorithmic Mechanism Design
Salman Fadaei
In this note, we revisit the \emph{relaxation and rounding} technique employed several times in algorithmic mechanism design. We try to introduce a general framework which covers t…
Generalized Assignment Problem: Truthful Mechanism Design without Money
Salman Fadaei, Martin Bichler
In this paper, we study a problem of truthful mechanism design for a strategic variant of the generalized assignment problem (GAP) in a both payment-free and prior-free environment…
Truthfulness with Value-Maximizing Bidders
Salman Fadaei, Martin Bichler
In markets such as digital advertising auctions, bidders want to maximize value rather than payoff. This is different to the utility functions typically assumed in auction theory a…
Mechanism Design via Dantzig-Wolfe Decomposition
Salman Fadaei
In random allocation rules, typically first an optimal fractional point is calculated via solving a linear program. The calculated point represents a fractional assignment of objec…
A Truthful Mechanism for the Generalized Assignment Problem
Salman Fadaei, Martin Bichler
We propose a truthful-in-expectation, -approximation mechanism for a strategic variant of the generalized assignment problem (GAP). In GAP, a set of items has to be optima…
Fast Convex Decomposition for Truthful Social Welfare Approximation
Dennis Kraft, Salman Fadaei, Martin Bichler
Approximating the optimal social welfare while preserving truthfulness is a well studied problem in algorithmic mechanism design. Assuming that the social welfare of a given mechan…
Maximizing Non-monotone Submodular Set Functions Subject to Different Constraints: Combined Algorithms
Salman Fadaei, MohammadAmin Fazli, MohammadAli Safari
We study the problem of maximizing constrained non-monotone submodular functions and provide approximation algorithms that improve existing algorithms in terms of either the approx…