Thesis (Ph.D.)--University of Washington, 2019The 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. ...
Following Micali and Valiant [MV07.a], a mechanism is resilient if it achieves its objective without...
In traditional algorithm design, no incentives come into play: the input is given, and your algorith...
Myerson’s 1981 characterization of revenue-optimal auctions for single-dimensional agents follows fr...
This survey describes the approximately optimal mechanism design paradigm and uses it to in-vestigat...
This survey describes the approximately optimal mechanism design paradigm and uses it to in-vestigat...
A modern engineering system, e.g. the Internet, faces challenges from both the strate-gic behavior o...
Consider a seller with multiple digital goods or services for sale, such as movies, soft-ware, or ne...
Consider a seller with multiple digital goods or services for sale, such as movies, software, or net...
Consider a seller with multiple digital goods or services for sale, such as movies, soft-ware, or ne...
Mechanism Design is a sub-field of game theory that aims to design games whose equilibria have desir...
With this lecture we commence the fifth and final part of the course. All previous lectures focused ...
In settings of incomplete information, we put forward (1) a very conservative —indeed, purely set-th...
Consider a seller with multiple digital goods or services for sale, such as movies, software, or net...
The most sensible place to start our discussion of mechanism design — the science of rule-making — i...
In a preference aggregation setting, a group of agents must jointly make a decision, based on the in...
Following Micali and Valiant [MV07.a], a mechanism is resilient if it achieves its objective without...
In traditional algorithm design, no incentives come into play: the input is given, and your algorith...
Myerson’s 1981 characterization of revenue-optimal auctions for single-dimensional agents follows fr...
This survey describes the approximately optimal mechanism design paradigm and uses it to in-vestigat...
This survey describes the approximately optimal mechanism design paradigm and uses it to in-vestigat...
A modern engineering system, e.g. the Internet, faces challenges from both the strate-gic behavior o...
Consider a seller with multiple digital goods or services for sale, such as movies, soft-ware, or ne...
Consider a seller with multiple digital goods or services for sale, such as movies, software, or net...
Consider a seller with multiple digital goods or services for sale, such as movies, soft-ware, or ne...
Mechanism Design is a sub-field of game theory that aims to design games whose equilibria have desir...
With this lecture we commence the fifth and final part of the course. All previous lectures focused ...
In settings of incomplete information, we put forward (1) a very conservative —indeed, purely set-th...
Consider a seller with multiple digital goods or services for sale, such as movies, software, or net...
The most sensible place to start our discussion of mechanism design — the science of rule-making — i...
In a preference aggregation setting, a group of agents must jointly make a decision, based on the in...
Following Micali and Valiant [MV07.a], a mechanism is resilient if it achieves its objective without...
In traditional algorithm design, no incentives come into play: the input is given, and your algorith...
Myerson’s 1981 characterization of revenue-optimal auctions for single-dimensional agents follows fr...