Rank-guaranteed auctions
We propose a combinatorial ascending auction that is “approximately” optimal, requiring minimal rationality to achieve this level of optimality, and is robust to strategic and distributional uncertainties. Specifically, the auction is rankguaranteed, meaning that for any menu M and any valuation pro...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2024
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/soe_research/2756 https://ink.library.smu.edu.sg/context/soe_research/article/3755/viewcontent/Rank_guaranteed_auctions__003_.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|