Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders
Isa Emin HafalirR. RaviAmin SayediPublished in: CoRR (2009)
Keyphrases
- multi unit
- combinatorial auctions
- pareto optimal
- budget constraints
- mechanism design
- social welfare
- vickrey clarke groves
- multi objective
- resource allocation
- multi objective optimization
- multiple objectives
- sealed bid auctions
- expected utility
- bidding strategies
- strategy proof
- nash equilibrium
- nsga ii
- approximation algorithms
- quasi linear
- sealed bid
- evolutionary algorithm
- coalition formation
- special case
- auction mechanisms
- mathematical programming
- auction protocol
- cooperative
- optimal solution
- incentive compatibility
- objective function
- computational complexity
- knapsack problem
- search engine
- genetic algorithm