Characterizing false-name-proof allocation rules in combinatorial auctions.
Taiki TodoAtsushi IwasakiMakoto YokooYuko SakuraiPublished in: AAMAS (1) (2009)
Keyphrases
- combinatorial auctions
- false name proof
- quasi linear
- multi unit
- winner determination
- resource allocation
- strategy proof
- mechanism design
- single item
- approximation algorithms
- mathematical programming
- special case
- budget constraints
- multi item
- multi unit combinatorial auctions
- auction mechanisms
- social welfare
- auction protocol
- bidding strategies
- lower bound