We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
The online games market has matured in recent years. It is now a multi-billion dollar business with hundreds of millions players worldwide. At the same time, social networking pla...
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
Matt Lepinski, Silvio Micali, Chris Peikert, Abhi ...
Optimising the parameters of ranking functions with respect to standard IR rank-dependent cost functions has eluded satisfactory analytical treatment. We build on recent advances ...
Michael J. Taylor, Hugo Zaragoza, Nick Craswell, S...
The TAC Supply Chain Management (TAC/SCM) game presents a challenging dynamic environment for autonomous decision-making in a salient application domain. Strategic interactions co...
Patrick R. Jordan, Christopher Kiekintveld, Michae...