Infinitely Split Nash Equilibrium Problems in Repeated Games

12/21/2017
by   Jinlu Li, et al.
0

In this paper, we introduce the concept of infinitely split Nash equilibrium in repeated games in which the profile sets are chain-complete posets. Then by using a fixed point theorem on posets in [8], we prove an existence theorem. As an application, we study the repeated extended Bertrant duopoly model of price competition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2022

On Nash-Stackelberg-Nash Games under Decision-Dependent Uncertainties: Model and Equilibrium

In this paper, we discuss a class of two-stage hierarchical games with m...
research
05/20/2020

Computations and Complexities of Tarski's Fixed Points and Supermodular Games

We consider two models of computation for Tarski's order preserving func...
research
10/08/2021

Nash Convergence of Mean-Based Learning Algorithms in First Price Auctions

Understanding the convergence properties of learning dynamics in repeate...
research
05/27/2023

No-Regret Learning in Dynamic Competition with Reference Effects Under Logit Demand

This work is dedicated to the algorithm design in a competitive framewor...
research
10/10/2019

On Existence of Equilibrium Under Social Coalition Structures

In a strategic form game a strategy profile is an equilibrium if no viab...
research
12/08/2020

Settling the complexity of Nash equilibrium in congestion games

We consider (i) the problem of finding a (possibly mixed) Nash equilibri...
research
03/15/2012

Automated Planning in Repeated Adversarial Games

Game theory's prescriptive power typically relies on full rationality an...

Please sign up or login with your details

Forgot password? Click here to reset