A Logical–Computational Framework for Discovering Three-Player Games with Unique Pure Nash Equilibrium Payoffs

The Nash equilibrium is a central concept in game theory, widely used across economics, social sciences, computer science, and artificial intelligence. However, computing Nash equilibria, especially in multi-player games, is a complex and computationally challenging task. Among the various types of...

Täydet tiedot

Bibliografiset tiedot

Päätekijät:	Jiajia Yang, Zhongtao Xie, Hongbo Hu, Xiang Du
Aineistotyyppi:	Artigo
Kieli:	Inglês
Julkaistu:	MDPI AG 2026-01-01
Sarja:	Mathematics
Aiheet:	computer-aided theorem discovering game theory first-order logic uniqueness of pure nash equilibrium payoffs Pareto optimality satisfiability solver
Linkit:	https://www.mdpi.com/2227-7390/14/3/409
Tagit:	Lisää tagi Ei tageja, Lisää ensimmäinen tagi!