On Nash-solvability of finite n-person shortest path games; bi-shortest path conjecture

11/13/2021
by   Vladimir Gurvich, et al.
0

We formulate a conjecture from graph theory that is equivalent to Nash-solvability of the finite two-person shortest path games with positive local costs. For the three-person games such conjecture fails.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2022

Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies

We prove that a deterministic n-person shortest path game has a Nash equ...
research
04/21/2022

On Nash-Solvability of Finite Two-Person Tight Vector Game Forms

We consider finite two-person normal form games. The following four prop...
research
04/08/2022

Path Defense in Dynamic Defender-Attacker Blotto Games (dDAB) with Limited Information

We consider a path guarding problem in dynamic Defender-Attacker Blotto ...
research
04/14/2022

A* shortest string decoding for non-idempotent semirings

The single shortest path algorithm is undefined for weighted finite-stat...
research
05/10/2022

Energy Games over Totally Ordered Groups

Kopczyński (ICALP 2006) conjectured that prefix-independent half-positio...
research
11/07/2019

A Hierarchical Optimizer for Recommendation System Based on Shortest Path Algorithm

Top-k Nearest Geosocial Keyword (T-kNGK) query on geosocial network is d...
research
03/13/2020

Shortest Paths on Cubes

In 1903, noted puzzle-maker Henry Dudeney published The Spider and the F...

Please sign up or login with your details

Forgot password? Click here to reset