Multi-Unit Auction Revenue with Possibilistic Beliefs Micali, Silvio; Vlachos, Georgios The revenue of traditional auction mechanisms is benchmarked solely against the players' own valuations, despite the fact that they may also have valuable beliefs about each other's valuations. Not much is known about generating revenue in auctions of multiple identical copies of a same good. (In particular the celebrated Vickrey mechanism has no revenue guarantees.) For such auctions, we (1) put forward an attractive revenue benchmark, based on the players' possibilistic about each other, and (2) construct a mechanism that achieves such benchmark, assuming that the players are two-level rational (where the rationality is in the sense of Aumann).
from Computer Science and Artificial Intelligence Lab (CSAIL) http://ift.tt/2r85Xwn
Home » Computer Science and Artificial Intelligence Lab (CSAIL) » Multi-Unit Auction Revenue with Possibilistic Beliefs
mercredi 7 juin 2017
Multi-Unit Auction Revenue with Possibilistic Beliefs
lainnya dari Computer Science and Artificial Intelligence CSAIL, Computer Science and Artificial Intelligence Lab (CSAIL)
- Automatic Exploitation of Fully Randomized Executables
- Gen: A General-Purpose Probabilistic Programming System with Programmable Inference
- Towards Understanding Generalization via Analytical Learning Theory
- Using Dynamic Monitoring to Synthesize Models of Applications That Access Databases
- Using Active Learning to Synthesize Models of Applications That Access Databases
- Comprehensive Java Metadata Tracking for Attack Detection and Repair
- Precise and Comprehensive Provenance Tracking for Android Devices
Ditulis Oleh : Unknown // 21:37
Kategori:
Computer Science and Artificial Intelligence Lab (CSAIL)
Inscription à :
Publier les commentaires (Atom)
0 commentaires:
Enregistrer un commentaire