Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem

Davood Shiri () and F. Sibel Salman ()
Additional contact information
Davood Shiri: Koc University
F. Sibel Salman: Koc University

Journal of Combinatorial Optimization, 2019, vol. 37, issue 3, No 4, 848-865

Abstract: Abstract In this article, we study randomized online strategies for the multi-agent k-Canadian Traveler Problem which is defined on an undirected graph with a given source node O and a destination node D. Non-negative edge costs are given. The traveling agents are initially at O. There are k blocked edges in the graph, but these edges are not known to the agents. A blocked edge is learned when at least one of the agents arrives at one of its end-nodes. The objective is to find an online strategy such that at least one of the agents finds a route from O to D with minimum travel cost. We analyze the problem in three cases: (1) without communication, (2) with limited communication, and (3) with complete communication. We derive lower bounds on the competitive ratio of randomized online strategies for these cases. We show that increasing the number of agents can improve the competitive ratio of randomized online strategies when there is no communication between agents. We introduce a randomized online strategy which is optimal for both cases with limited and complete communication on O–D edge-disjoint graphs. We also prove that the competitive ratio of the optimal randomized strategy does not improve on O–D edge-disjoint graphs, when the case with complete communication is compared to the case with limited communication.

Keywords: Multi-agent k-CTP; Competitive ratio; Online strategies; Randomized strategies; Communication (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0324-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:37:y:2019:i:3:d:10.1007_s10878-018-0324-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0324-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().