Equilibria in ordinal games: A framework based on possibility theory

9Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

The present paper proposes the first definition of a mixed equilibrium in an ordinal game. This definition naturally extends possibilistic (single agent) decision theory. Our first contribution is to show that ordinal games always admit a possibilistic mixed equilibrium, which can be seen as a qualitative counterpart to mixed (probabilistic) equilibrium. Then, we show that a possibilistic mixed equilibrium can be computed in polynomial time (wrt the size of the game), which contrasts with mixed probabilistic equilibrium computation in cardinal game theory. The definition we propose is thus operational in two ways: (i) it tackles the case when no pure Nash equilibrium exists in an ordinal game; and (ii) it allows an efficient computation of a mixed equilibrium.

Cite

CITATION STYLE

APA

Amor, N. B., Fargier, H., & Sabbadin, R. (2017). Equilibria in ordinal games: A framework based on possibility theory. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 0, pp. 105–111). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2017/16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free