172
Voted
ATAL
2010
Springer
15 years 9 months ago
2010
Springer
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
185
click to vote
KR
2010
Springer
16 years 19 days ago
2010
Springer
We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear l...