Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions.
Subhash KhotRichard J. LiptonEvangelos MarkakisAranyak MehtaPublished in: Algorithmica (2008)
Keyphrases
- combinatorial auctions
- utility function
- approximation algorithms
- preference elicitation
- winner determination
- decision makers
- special case
- np hard
- decision problems
- single item
- mechanism design
- expected utility
- multi unit combinatorial auctions
- decision theory
- multi attribute
- worst case
- probability distribution
- resource allocation
- social welfare
- objective function
- game theoretic
- bidding strategies
- multi agent systems
- multi agent
- quasi linear
- utility elicitation