Competitive distributed decision-making

DOI10.1007/BF01940643zbMath0851.68041OpenAlexW1575662623MaRDI QIDQ1920425

Xiaotie Deng, Christos H. Papadimitriou

Publication date: 17 November 1996

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01940643

zbMATH Keywords

distributed schedulingdistributed decision-making

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Distributed near-optimal matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in the plane
• Competitive snoopy caching
• Competitive paging with locality of reference
• Random walks on weighted graphs and applications to on-line algorithms
• Intractable Problems in Control Theory
• How to learn an unknown environment. I
• Competitive Algorithms for Layered Graph Traversal
• Lower Bounds for Randomized k-Server and Motion-Planning Algorithms
• On the value of information in distributed decision-making (extended abstract)

This page was built for publication: Competitive distributed decision-making