Saved in:
Bibliographic Details
Main Authors: Banks, David, Ceyhan, Elvan, Johnson, Leah, Zhou, Li
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2602.11048
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908827973058560
author Banks, David
Ceyhan, Elvan
Johnson, Leah
Zhou, Li
author_facet Banks, David
Ceyhan, Elvan
Johnson, Leah
Zhou, Li
contents Suppose a Bayesian agent seeks to traverse a graph. Each time she crosses an edge, she pays a price. The first time she reaches a node, there is a payoff. She has an opponent who can reduce the payoffs. This paper uses adversarial risk analysis to find a solution to her route selection problem. It shows how the traveler is advantaged by having an accurate subjective distribution over the costs/payoffs and by having a Bayesian prior for her opponent's strategic choices. The results are relevant to military convoy routing, corporate competition, and certain games.
format Preprint
id arxiv_https___arxiv_org_abs_2602_11048
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Adversarial Graph Traversal
Banks, David
Ceyhan, Elvan
Johnson, Leah
Zhou, Li
Optimization and Control
90C40, 91A25, 62F15
Suppose a Bayesian agent seeks to traverse a graph. Each time she crosses an edge, she pays a price. The first time she reaches a node, there is a payoff. She has an opponent who can reduce the payoffs. This paper uses adversarial risk analysis to find a solution to her route selection problem. It shows how the traveler is advantaged by having an accurate subjective distribution over the costs/payoffs and by having a Bayesian prior for her opponent's strategic choices. The results are relevant to military convoy routing, corporate competition, and certain games.
title Adversarial Graph Traversal
topic Optimization and Control
90C40, 91A25, 62F15
url https://arxiv.org/abs/2602.11048