Representing Pure Nash Equilibria in Argumentation

Bruno Yun, Srdjan Vesic, Nir Oren

Research output: Working paper

Abstract

In this paper we describe an argumentation-based representation of normal form games, and demonstrate how argumentation can be used to compute pure strategy Nash equilibria. Our approach builds on Modgil's Extended Argumentation Frameworks. We demonstrate its correctness, prove several theoretical properties it satisfies, and outline how it can be used to explain why certain strategies are Nash equilibria to a non-expert human user.
Original languageEnglish
PublisherArXiv
Pages1-12
Number of pages12
Publication statusSubmitted - 19 Jun 2020

Keywords

  • cs.AI
  • cs.GT
  • Argumentation
  • Game theory
  • Nash equilibrium
  • Pure strategy

Cite this