Program​

​

9:00  -    9:25 gathering, registration, and coffee

9:25   -   9:30 opening remarks

9:30  -  10:00 Moni Naor (Weizmann) - From Donkeys to Kings in Tournaments

10:00 - 10:30 Moshe Tennenholtz (Technion) - The Search for Stability: Learning Dynamics and the Relative Ranking Principle

10:30 - 11:00 Keren Censor-Hillel (Technion) - Distributed Subgraph Finding: Known and New

 

11:00 - 11:30 coffee break

 

11:30 - 12:00 Dan Halperin (TAU)  - Multi-Robot Motion Planning: The Easy, the Hard and the Uncharted

12:00 - 12:30 Nadav Merlis (CREST, ENSAE Paris)  - The Value of Reward Lookahead in Reinforcement Learning

 

12:30 - 14:00  Lunch (on your own)

 

14:00 - 14:30  Noam Nissan (HUJI) - Serial Monopoly on Blockchains

14:30 - 15:00  Niv Buchbinder (TAU)  - Chasing Positive Bodies

15:00 - 15:30  Liat Peterfreund (HUJI) - From Standardization to Theory and Back

 

15:30 - 16:00  coffee break

 

16:00 - 16:30  Joe Halpern (Cornell) - Language-Based Decision Theory with Causality

16:30 - 17:00  Robert Krauthgamer (Weizmann) - Fully Scalable MPC Algorithms for Clustering in High Dimension

17:00 - 17:30  Kobbi Nissim (Georgetown) - A methodology for reconciling computer science and legal approaches to privacy