In a competitive search game on star graphs with a faulty GPS of accuracy p, the unique symmetric Nash equilibrium trust probability q satisfies q approaching p as the number of searchers n tends to infinity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Competitive Search with a Faulty Satnav (GPS): When Probability Matching is Rational
In a competitive search game on star graphs with a faulty GPS of accuracy p, the unique symmetric Nash equilibrium trust probability q satisfies q approaching p as the number of searchers n tends to infinity.