A formulation of combinatorial auction via reverse convex programming.
Henry SchellhornPublished in: Adv. Decis. Sci. (2005)
Keyphrases
- convex programming
- combinatorial auctions
- linear programming
- semidefinite programming
- interior point methods
- multi unit
- convex optimization
- kernel learning
- resource allocation
- winner determination
- mathematical programming
- quadratic programming
- set covering
- approximation algorithms
- primal dual
- auction protocol
- mechanism design
- convex functions
- dynamic programming
- special case
- auction mechanisms
- image processing
- bidding strategies
- computationally intensive
- linear program
- worst case
- machine learning