Studies on Algorithms for Insufficient Spatial Information

现代算法设计的主要挑战之一是处理信息不足的问题。在这项研究中，我们试图构建一个通用的框架，用于设计和评估能够处理空间信息不足的算法。在此基础上，针对图问题、算法博弈论和随机计算理论等领域中的各种问题，给出了算法的设计和分析。

One of the main challenge in modern algorithm design is to copewith insufficient information. In this study, we try to construct a general framework fordesign and evaluation of algorithms that can cope with insufficient spatial information. Asa result, we give design and analysis of such algorithms for various problems in severalfields such as graph problems, algorithmic game theory and randomized computationtheory.