130 citations · 194 across the 8 of their papers we have counts for
4 papers · 1 filter
Truth, Justice, and Secrecy: Cake Cutting Under Privacy Constraints
Yaron Salman, Tamir Tassa, Omer Lev +1
Cake-cutting algorithms, which aim to fairly allocate a continuous resource based on individual agent preferences, have seen significant progress over the past two decades. Much of…
Enhancing Lifelong Multi-Agent Path-finding by Using Artificial Potential Fields
Arseniy Pertzovsky, Roni Stern, Ariel Felner +1
We explore the use of Artificial Potential Fields (APFs) to solve Multi-Agent Path Finding (MAPF) and Lifelong MAPF (LMAPF) problems. In MAPF, a team of agents must move to their g…
Latency-Aware 2-Opt Monotonic Local Search for Distributed Constraint Optimization
Ben Rachmut, Roie Zivan, William Yeoh
Researchers recently extended Distributed Constraint Optimization Problems (DCOPs) to Communication-Aware DCOPs so that they are applicable in scenarios in which messages can be ar…
Explainable Distributed Constraint Optimization Problems
Ben Rachmut, Stylianos Loukas Vasileiou, Nimrod Meir Weinstein +2
The Distributed Constraint Optimization Problem (DCOP) formulation is a powerful tool to model cooperative multi-agent problems that need to be solved distributively. A core assump…