Optimization and Search Problems

This cluster of papers focuses on the development and analysis of online algorithms for distributed coordination of mobile robots, with applications in areas such as ad auctions, resource allocation, stochastic matching, and rendezvous search. The research explores techniques for competitive analysis, learning automata, and buffer management in the context of online robotics.