The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
—This paper considers a non-cooperative game in which competing users sharing a frequency-selective interference channel selfishly optimize their power allocation in order to imp...
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in ...
Andrew Gilpin, Tuomas Sandholm, Troels Bjerre S&os...