Research
Developing efficient algorithms that power faster, smarter, and more reliable computing across diverse applications.
Two players announce bargaining postures to which they may become committed and then bargain over the division of a surplus. The share of the surplus that a player can guarantee herself under first-order knowledge of…
We will look at a collection of mathematical problems suggested by side-channel attacks against public key cryptosystems, and how the techniques inspired by this work relate to a variety of different applications. First, we discuss…
Delay announcements informing customers about anticipated service delays are prevalent in service-oriented systems. How to use delay announcements to manage the service system in an efficient manner is a complex problem which depends on both…
The principal problem in algorithmic mechanism design is to merge the incentive constraints imposed by selfish behavior with the algorithmic constraints imposed by computational intractability. In this talk we will consider the problem of designing…
An important theme in theoretical computer science over the last decade has been the usefulness of translating a combinatorial problem over a discrete domain to a problem in continuous space. For instance, invariance principles or…
