Representing Pure Nash Equilibria in Argumentation

06/19/2020
by   Bruno Yun, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/17/2016

A Comment on Argumentation

We use the theory of defaults and their meaning of [GS16] to develop (th...
research
12/13/2021

On Nash Equilibria in Normal-Form Games With Vectorial Payoffs

We provide an in-depth study of Nash equilibria in multi-objective norma...
research
04/17/2019

Berge equilibria in n-person 2-strategy games

An algorithm for finding all Berge equilibria in the sense of Zhukovskii...
research
05/28/2021

A Note on Optimal Fees for Constant Function Market Makers

We suggest a framework to determine optimal trading fees for constant fu...
research
02/08/2022

Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria

Motivated by the intricacies of allocating treasury funds in blockchain ...
research
03/15/2019

A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical Games

We introduce Q-Nash, a quantum annealing algorithm for the NP-complete p...
research
05/17/2022

Decentralised Update Selection with Semi-Strategic Experts

Motivated by governance models adopted in blockchain applications, we st...

Please sign up or login with your details

Forgot password? Click here to reset