Abstract
We distinguish some cases of existence of a stationary equilibrium in nonantagonistic games on directed graphs with terminal payoffs along trajectories. The proof of the existence of stationary equilibria implies polynomial search algorithms for them.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
