| LDR | | 00000nam u2200205 4500 |
| 001 | | 000000432244 |
| 005 | | 20200224115346 |
| 008 | | 200131s2019 ||||||||||||||||| ||eng d |
| 020 | |
▼a 9781088328620 |
| 035 | |
▼a (MiAaPQ)AAI13900159 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
| 082 | 0 |
▼a 004 |
| 100 | 1 |
▼a Goldner, Kira. |
| 245 | 10 |
▼a Mechanism Design for a Complex World: Rethinking Standard Assumptions. |
| 260 | |
▼a [S.l.]:
▼b University of Washington.,
▼c 2019. |
| 260 | 1 |
▼a Ann Arbor:
▼b ProQuest Dissertations & Theses,
▼c 2019. |
| 300 | |
▼a 226 p. |
| 500 | |
▼a Source: Dissertations Abstracts International, Volume: 81-04, Section: B. |
| 500 | |
▼a Advisor: Karlin, Anna R. |
| 502 | 1 |
▼a Thesis (Ph.D.)--University of Washington, 2019. |
| 506 | |
▼a This item must not be sold to any third party vendors. |
| 506 | |
▼a This item must not be added to any third party search indexes. |
| 520 | |
▼a The data used as input for many algorithms today comes from real human beings who have a stake in the outcome. In order to design algorithms that are robust to potential strategic manipulation, the field of algorithmic mechanism design formally models the strategic interests of the individuals and engineers their actions using game theory. The primary research directions in this area concern designing mechanisms to maximize either revenue or social welfare when selling to agents of various valuation types.This thesis addresses barriers to progress in three fundamental directions in auction theory by rethinking standard models and assumptions and provides positive results in all three cases. First, we design revenue-optimal mechanisms in "interdimensional'' settings---highly structured correlated settings that sit in between the assumed dichotomy of single-dimensional and multi-dimensional settings. Second, we propose a new model of proportional complementarities and construct an intuitive, simple mechanism that guarantees near-optimal revenue. Third, we study welfare maximization in the interdependent values setting without the single-crossing condition, and guarantee strong approximations for the most general setting of combinatorial auctions. |
| 590 | |
▼a School code: 0250. |
| 650 | 4 |
▼a Computer science. |
| 690 | |
▼a 0984 |
| 710 | 20 |
▼a University of Washington.
▼b Computer Science and Engineering. |
| 773 | 0 |
▼t Dissertations Abstracts International
▼g 81-04B. |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0250 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2019 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T15492153
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
| 980 | |
▼a 202002
▼f 2020 |
| 990 | |
▼a ***1008102 |
| 991 | |
▼a E-BOOK |