1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.MA2021
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance
Nir Greshler, Ofir Gordon, Oren Salzman +1
We introduce the Cooperative Multi-Agent Path Finding (Co-MAPF) problem, an extension to the classical MAPF problem, where cooperative behavior is incorporated. In this setting, a…
cs.CV2019
ILS-SUMM: Iterated Local Search for Unsupervised Video Summarization
Yair Shemer, Daniel Rotman, Nahum Shimkin
In recent years, there has been an increasing interest in building video summarization tools, where the goal is to automatically create a short summary of an input video that prope…
cs.GT2015★ 1 cited
An Online Convex Optimization Approach to Blackwell's Approachability
Nahum Shimkin
The notion of approachability in repeated games with vector payoffs was introduced by Blackwell in the 1950s, along with geometric conditions for approachability and corresponding…