2 papers
econ.TH2025
A Folk Theorem for Indefinitely Repeated Network Games
Andrea Benso
We consider a repeated game in which players, considered as nodes of a network, are connected. Each player observes her neighbors' moves only. Thus, monitoring is private and imper…
cs.FL2024
On the Intersection Problem for Quantum Finite Automata
Andrea Benso, Flavio D'Alessandro, Paolo Papi
This paper is a continuation of a previous study on the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We investigate conditions…