Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Itay Shedlezki

Itay Shedlezki

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Multiagent×1Game Theory×1Robotics×1

Frequent co-authors

Noa Agmon1×

Research Timeline

2026
Intermittent Strategic Cooperation of Two Selfish Agents on Graphs

This paper characterizes Pure Nash Equilibria and presents a polynomial-time algorithm for finding them in the Intermittent Strategic Cooperation-Based Two-Agent Path Planning game.

Highlighted terms show continued research focus across papers

Papers

cs.MAcs.GTcs.ROTheoreticalRecentJun 15, 2026

Intermittent Strategic Cooperation of Two Selfish Agents on Graphs

Itay Shedlezki, Noa Agmon

This paper characterizes Pure Nash Equilibria and presents a polynomial-time algorithm for finding them in the Intermittent Strategic Cooperation-Based Two-Agent Path Planning game.

View →