Asynchronous Coordination Under Preferences and Constraints

• Published in: Structural Information and Communication Complexity Vol. 9988; pp. 111 - 126
• Main Authors: Castañeda, Armando, Fraigniaud, Pierre, Gafni, Eli, Rajsbaum, Sergio, Roy, Matthieu
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2016; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Algorithms & data structures; Complete Bipartite Graph; Discrete mathematics; Initial Preference; Network hardware; Preference Task; Shared Memory; Static Algorithm

Adaptive renaming can be viewed as a coordination task involving a set of asynchronous agents, each aiming at grabbing a single resource out of a set of resources Similarly, musical chairs is also defined as a coordination task involving a set of asynchronous agents, each aiming at picking one of a...