4 citations · 4 across the 1 of their papers we have counts for
2 papers
cs.DC2013★ 4 cited
Ants: Mobile Finite State Machines
Yuval Emek, Tobias Langner, Jara Uitto +1
Consider the Ants Nearby Treasure Search (ANTS) problem introduced by Feinerman, Korman, Lotker, and Sereni (PODC 2012), where mobile agents, initially placed at the origin of…
cs.CG2011
The Price of Matching Selfish Vertices
Yuval Emek, Tobias Langner, Roger Wattenhofer
We analyze the setting of minimum-cost perfect matchings with selfish vertices through the price of anarchy (PoA) and price of stability (PoS) lens. The underlying solution concept…