A Note on Relaxation and Rounding in Algorithmic Mechanism Design.
Salman FadaeiPublished in: CoRR (2016)
Keyphrases
- mechanism design
- linear programming relaxation
- tight upper and lower bounds
- game theory
- incomplete information
- multiagent planning
- knapsack problem
- approximation algorithms
- linear programming
- combinatorial auctions
- mixed integer
- auction mechanisms
- upper bound
- incentive compatible
- moral hazard
- cooperative game theory
- prediction markets
- lower bound
- cooperative
- feasible solution
- optimization problems
- social welfare
- special case
- preference aggregation
- evolutionary algorithm