New York / Paris / Cambridge / Los Angeles / Toronto / /
Company
Multiagent Systems / Multi-Agent Systems / Solving LP / Google / Microsoft / /
Country
France / / /
Facility
San Diego Hebrew University of Jerusalem / University Center / Jeffrey S. Rosenschein University of California / Intel Collaborative Research Institute / P stable / UK Hebrew University of Jerusalem / /
Experimental & Theoretical Artificial Intelligence / Israel Ministry of Science and Technology / Israel Science Foundation / MIT / International Foundation for Autonomous Agents / University of California / San Diego Hebrew University of Jerusalem / Computational Intelligence / Econometric Society / Intel Collaborative Research Institute / J. Adams and T. Service / Hebrew University of Jerusalem / /
Person
Michael Huhns / D. Yun Yeh / P. Kohli / V / Morteza Zadimoghaddam / Alessio Lomuscio / S. Ramchurn / V / G. Chalkiadakis / V / Paul Scerri / Ana Bazzan / /
Position
secretary / truck driver / /
ProvinceOrState
Massachusetts / /
PublishedMedium
Journal of the ACM / Machine Learning / Econometrica / /
Technology
improved dynamic programming algorithm / polynomial time algorithm / polynomial algorithms / Machine Learning / easier / linear algorithm / maximal-flow algorithm / polynomial algorithm / artificial intelligence / Ellipsoid algorithm / linear time algorithm / /
Cooperative Weakest Link Games Yoram Bachrach Omer Lev Microsoft Research, Cambridge, UK