Berge equilibria in n-person 2-strategy games

04/17/2019
by   Paweł Sawicki, et al.
0

An algorithm for finding all Berge equilibria in the sense of Zhukovskii in n-person 2-strategy games in pure and mixed strategies is given.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/16/2018

Example of a finite game with no Berge equilibria at all

The problem of the existence of Berge equilibria in the sense of Zhukovs...
research
01/14/2022

Geometry of Dependency Equilibria

An n-person game is specified by n tensors of the same format. We view i...
research
04/18/2018

Modeling and Analysis of Leaky Deception using Signaling Games with Evidence

Deception plays critical roles in economics and technology, especially i...
research
06/30/2022

A note on large deviations for interacting particle dynamics for finding mixed equilibria in zero-sum games

Finding equilibria points in continuous minimax games has become a key p...
research
09/09/2021

Multiple Oracle Algorithm For General-Sum Continuous Games

Continuous games have compact strategy sets and continuous utility funct...
research
06/19/2020

Representing Pure Nash Equilibria in Argumentation

In this paper we describe an argumentation-based representation of norma...
research
02/26/2023

Data Structures for Deviation Payoffs

We present new data structures for representing symmetric normal-form ga...

Please sign up or login with your details

Forgot password? Click here to reset