Computer Science Thesis Oral

Wednesday, May 16, 2018 - 2:00pm


Traffic21 Classroom 6501 Gates Hillman Centers



Combinatorial optimization captures many natural problems such as matching, load balancing, social welfare, network design, clustering, and submodular optimization. Classically, these problems have been studied in the full-information setting, i.e., where the entire input—an objective function and some constraints—is given and the goal is to select a feasible set to maximize/minimize the objective function. In this thesis we focus on combinatorial problems in an uncertain environment where we only have partial knowledge about the input. In particular, we study models where the input is revealed to us element-by-element and we have to make irrevocable decisions. Depending on whether we can control the revelation order of these elements, we separate our models and algorithms into two classes.

(A) Probing Algorithms: In these models we have stochastic knowledge about the input, but the uncertainty of an element realizes only after we probe it. We can choose the order and the set of elements to probe; however, we do not wish to probe all of them as either probing incurs a price (the price of information model) or there are probing constraints (the constrained stochastic probing model). Some examples are the Pandora’s box and the Best-box problems.

(B) Stopping-Time Algorithms: In these models the input is revealed element- by-element in an order that we cannot control. These models are inspired from work in the field of Stopping Theory. In particular, we consider combinatorial problems when either we have stochastic knowledge about the input but the revelation order is chosen by an adversary (the Prophet Inequality model) or when we have no prior knowledge about the input but the revelation order is chosen uniformly at random (the Secretary model).

Thesis Committee:
Anupam Gupta (Co-Chair)
Manuel Blum (Co-Chair)
R. Ravi
Robert D. Kleinberg (Cornell University)
Jan Vondrak (Stanford University)

For More Information, Contact:


Thesis Oral