Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
Given a collection C of weighted subsets of a ground set E, the set cover problem is to find a minimum weight subset of C which covers all elements of E. We study a strategic game ...
This paper studies local-control strategies to estimate the size of a certain event affecting an arbitrary connected subset of nodes in a network. For example, our algorithms allow...
Marcin Bienkowski, Leszek Gasieniec, Marek Klonows...
Many distributed systems can be modeled as network games: a collection of selfish players that communicate in order to maximize their individual utilities. The performance of such ...
Abstract. Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and ...
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, ...