On the value of information in distributed decision-making (extended abstract)

DOI10.1145/112600.112606zbMath1314.91068OpenAlexW2091015135MaRDI QIDQ5255806

Mihalis Yannakakis, Christos H. Papadimitriou

Publication date: 19 June 2015

Published in: Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/112600.112606

Mathematics Subject Classification ID

Decision theory (91B06) Cooperative games (91A12) Games involving graphs (91A43) Applications of game theory (91A80) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (9)

Distributed scheduling for disconnected cooperation ⋮ Competitive distributed decision-making ⋮ Minimum vertex cover, distributed decision-making, and communication complexity ⋮ The \(k\)-server problem ⋮ Algorithmic mechanism design ⋮ Computer science and decision theory ⋮ On the distributed decision-making complexity of the minimum vertex cover problem ⋮ A distributed voting scheme to maximize preferences ⋮ Delayed information and action in on-line algorithms

This page was built for publication: On the value of information in distributed decision-making (extended abstract)