ArXiv TLDR

Nash without Numbers: A Social Choice Approach to Mixed Equilibria in Context-Ordinal Games

🐦 Tweet
2605.07996

Ian Gemp, Crystal Qian, Marc Lanctot, Kate Larson

cs.GTcs.MAecon.GN

TLDR

Introduces context-ordinal Nash equilibrium, generalizing classical Nash by using ordinal preferences instead of precise utilities for broader applicability.

Key contributions

  • Generalizes Nash equilibrium to context-ordinal settings, using ordinal preferences instead of precise utilities.
  • Redefines best-response by aggregating preferences using social choice theory.
  • Establishes existence of this generalized Nash and explores its complexity.
  • Develops learning rules for computing context-ordinal Nash equilibria.

Why it matters

Classical Nash equilibrium requires precise utility knowledge, which is difficult to obtain. This paper overcomes this by generalizing Nash to use only ordinal preferences, making equilibrium analysis more practical and directly applicable to human behavior.

Original Abstract

Nash equilibrium serves as a fundamental mathematical tool in economics and game theory. However, it classically assumes knowledge of player utilities, whereas economics generally regards preferences as more fundamental. To leverage equilibrium analysis in strategic scenarios, one must first elicit numerical utilities consistent with player preferences, a delicate and time-consuming process. In this work, we forgo precise utilities and generalize the Nash equilibrium to a setting where we only assume a player is capable of providing an ordinal ranking of their actions within the context of other players' joint actions. The key technical challenge is to rethink the definition of a best-response. While the classical definition identifies actions maximizing expected payoff, we naturally look towards social choice theory for how to aggregate preferences to identify the most preferred actions. We define this generalized notion of a context-ordinal Nash equilibrium, establish its existence under mild conditions on aggregation methods, introduce notions of regularization, approximation, and regret, explore complexity for simple settings, and develop learning rules for computing such equilibria. In doing so, we provide a generalization of Nash equilibrium and demonstrate its direct applicability to elicited preferences in human experiments.

📬 Weekly AI Paper Digest

Get the top 10 AI/ML arXiv papers from the week — summarized, scored, and delivered to your inbox every Monday.