Competitive distributed decision-making
From MaRDI portal
Recommendations
- Optimal, distributed decision-making: The case of no communication
- Distributed near-optimal matching
- On the distributed decision-making complexity of the minimum vertex cover problem
- Full and Local Information in Distributed Decision Making
- Distributed admission control, scheduling, and routing with stale information
Cites work
- Competitive Algorithms for Layered Graph Traversal
- Competitive paging with locality of reference
- Competitive snoopy caching
- How to learn an unknown environment. I
- scientific article; zbMATH DE number 15120 (Why is no real title available?)
- scientific article; zbMATH DE number 65704 (Why is no real title available?)
- scientific article; zbMATH DE number 65706 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Intractable Problems in Control Theory
- Lower Bounds for Randomized k-Server and Motion-Planning Algorithms
- On the value of information in distributed decision-making (extended abstract)
- Random walks on weighted graphs and applications to on-line algorithms
- Searching in the plane
Cited in
(5)
This page was built for publication: Competitive distributed decision-making
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920425)