1. On the complexity of two-player win–lose games;Abbott,2005
2. Boolean games with epistemic goals;Ågotnes,2013
3. Polynomial space suffices for deciding Nash equilibria properties for extensive games with large trees;Àlvarez,2005
4. Pure Nash equilibria in games with a large number of actions;Àlvarez,2005
5. Equilibria problems on games: complexity versus succinctness;Àlvarez;J. Comput. Syst. Sci.,2011