We give a novel proof of the existence of Nash equilibria in all finite games without using fixed point theorems or path following arguments. Our approach relies on a new notion i...
Noah D. Stein, Pablo A. Parrilo, Asuman E. Ozdagla...
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Routing games are used to to understand the impact of individual users’ decisions on network efficiency. Most prior work on routing games uses a simplified model of network fl...
Nowadays most universities use different distance learning environments. However in the educational process besides forums, chats and other collaborative possibilities the content...
In this paper, we address the problem of creating believable agents (virtual characters) in video games. We consider only one meaning of believability, "giving the feeling of...