Novel frameworks for auctions and optimization
Thesis: Sc. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
Main Author: | |
---|---|
Other Authors: | |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2016
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/101594 |
_version_ | 1811088892590292992 |
---|---|
author | Zhu, Zeyuan Allen |
author2 | Jonathan A. Kelner and Silvio Micali. |
author_facet | Jonathan A. Kelner and Silvio Micali. Zhu, Zeyuan Allen |
author_sort | Zhu, Zeyuan Allen |
collection | MIT |
description | Thesis: Sc. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015. |
first_indexed | 2024-09-23T14:09:20Z |
format | Thesis |
id | mit-1721.1/101594 |
institution | Massachusetts Institute of Technology |
language | eng |
last_indexed | 2024-09-23T14:09:20Z |
publishDate | 2016 |
publisher | Massachusetts Institute of Technology |
record_format | dspace |
spelling | mit-1721.1/1015942019-04-11T05:59:44Z Novel frameworks for auctions and optimization Zhu, Zeyuan Allen Jonathan A. Kelner and Silvio Micali. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis: Sc. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015. Cataloged from PDF version of thesis. Includes bibliographical references (pages 255-269). This thesis contains two parts. Part I introduces novel frameworks for modeling uncertainty in auctions. This enables us to provide robust analysis to alternative specifications of preferences and information structures in Vickrey and VCG auctions. Part II introduces novel frameworks for understanding first-order methods in optimization. This enables us to (1) break 20-year barriers on the running time used for solving positive linear programs, (2) reduce the complexity for solving positive semidefinite programs, and (3) strengthen the theory of matrix multiplicative weight updates and improve the theory of linear-sized spectral sparsification. by Zeyuan Allen-Zhu. Sc. D. 2016-03-03T21:11:05Z 2016-03-03T21:11:05Z 2015 2015 Thesis http://hdl.handle.net/1721.1/101594 941161810 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 269 pages application/pdf Massachusetts Institute of Technology |
spellingShingle | Electrical Engineering and Computer Science. Zhu, Zeyuan Allen Novel frameworks for auctions and optimization |
title | Novel frameworks for auctions and optimization |
title_full | Novel frameworks for auctions and optimization |
title_fullStr | Novel frameworks for auctions and optimization |
title_full_unstemmed | Novel frameworks for auctions and optimization |
title_short | Novel frameworks for auctions and optimization |
title_sort | novel frameworks for auctions and optimization |
topic | Electrical Engineering and Computer Science. |
url | http://hdl.handle.net/1721.1/101594 |
work_keys_str_mv | AT zhuzeyuanallen novelframeworksforauctionsandoptimization |