Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
We study linear anti-windup augmentation for linear control systems with saturated linear plants in the special case when the anti-windup compensator can only modify the input and...
— The priorities of a climbing legged robot are to maintain a grasp on its climbing surface and to climb efficiently against the force of gravity. These priorities profoundly co...
Salomon Trujillo, Barrett Heyneman, Mark R. Cutkos...