We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
Atish Das Sarma, Richard J. Lipton, Danupon Nanong...
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...
Data-type generic programming can be used to traverse and manipulate specific parts of large heterogeneously-typed tree structures, without the need for tedious boilerplate. Gene...
Abstract. A body of psychological research has examined the correspondence between a judge’s subjective probability of an event’s outcome and the event’s actual outcome. The ...
— We consider problems where multiple agents must cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchange...