scholarly journals Nash versus coarse correlation

2020 ◽  
Vol 23 (4) ◽  
pp. 1178-1204 ◽  
Author(s):  
Konstantinos Georgalos ◽  
Indrajit Ray ◽  
Sonali SenGupta
Keyword(s):  
Nash Equilibrium ◽  
Correlated Equilibrium ◽  
Individual Choice ◽  
Pure Nash Equilibrium ◽  
Expected Payoff ◽  
Equilibrium Payoff ◽  
Payoff Dominance ◽  
Dominated Strategies ◽  
Person Game ◽  
Nash Point

Abstract We run a laboratory experiment to test the concept of coarse correlated equilibrium (Moulin and Vial in Int J Game Theory 7:201–221, 1978), with a two-person game with unique pure Nash equilibrium which is also the solution of iterative elimination of strictly dominated strategies. The subjects are asked to commit to a device that randomly picks one of three symmetric outcomes (including the Nash point) with higher ex-ante expected payoff than the Nash equilibrium payoff. We find that the subjects do not accept this lottery (which is a coarse correlated equilibrium); instead, they choose to play the game and coordinate on the Nash equilibrium. However, given an individual choice between a lottery with equal probabilities of the same outcomes and the sure payoff as in the Nash point, the lottery is chosen by the subjects. This result is robust against a few variations. We explain our result as selecting risk-dominance over payoff dominance in equilibrium.

NASH EQUILIBRIUM IN TWO-SIDED MATE CHOICE PROBLEM

2008 ◽  
Vol 10 (04) ◽  
pp. 421-435 ◽  
Author(s):  
VLADIMIR MAZALOV ◽  
ANNA FALKO
Keyword(s):  
Nash Equilibrium ◽  
Search Model ◽  
Individual Choice ◽  
Choice Problem ◽  
Expected Payoff ◽  
Last Stage ◽  
Nash Equilibrium Strategies ◽  
The Individual

We consider a two-sided search model in which individuals from two distinct populations would like to form a long-term relationship with a member of the other population. The individual choice is determined by the quality of the partner. Initially the quality of individuals in the population is uniform. At every stage the individuals randomly matched from their populations recognize the quality of the partner. If they accept each other they create a couple and leave the game. The partner's quality is the payoff. Unmatched players go to the next stage. At the last stage the individuals accept any partner. Each player aims to maximize her/his expected payoff. In this paper explicit formulas for Nash equilibrium strategies are derived. Also, the model with incoming individuals is analyzed.

Bayesian Rationality and Social Epistemology

2014 ◽  
Author(s):  
Herbert Gintis
Keyword(s):  
Game Theory ◽  
Nash Equilibrium ◽  
Social Norms ◽  
Social Epistemology ◽  
Correlated Equilibrium ◽  
Epistemic Game Theory ◽  
Famous Theorem ◽  
Rational Agents ◽  
Natural Equilibrium ◽  
Bayesian Rationality

This chapter uses epistemic game theory to expand on the notion of social norms as choreographer of a correlated equilibrium, and to elucidate the socio-psychological prerequisites for the notion that social norms implement correlated equilibria. The correlated equilibrium is a much more natural equilibrium criterion than the Nash equilibrium, because of a famous theorem of Aumann (1987), who showed that Bayesian rational agents in an epistemic game G with a common subjective prior play a correlated equilibrium of G. Thus, while rationality and common priors do not imply Nash equilibrium, these assumptions do imply correlated equilibrium and social norms act not only as choreographer, but also supply the epistemic conditions for common priors.

NASH EQUILIBRIUM STRATEGIES REVISITED IN SOFTWARE RELEASE GAMES

2020 ◽  
pp. 1-21
Author(s):  
Yasuhiro Saito ◽  
Tadashi Dohi
Keyword(s):  
Nash Equilibrium ◽  
Optimization Theory ◽  
Applied Probability ◽  
Equilibrium Strategies ◽  
Release Policy ◽  
Software Release ◽  
Nash Equilibrium Strategies ◽  
Person Game

A software release game was formulated by Zeephongsekul and Chiera [Zeephongsekul, P. & Chiera, C. (1995). Optimal software release policy based on a two-person game of timing. Journal of Applied Probability 32: 470–481] and was reconsidered by Dohi et al. [Dohi, T., Teraoka, Y., & Osaki, S. (2000). Software release games. Journal of Optimization Theory and Applications 105(2): 325–346] in a framework of two-person nonzero-sum games. In this paper, we further point out the faults in the above literature and revisit the Nash equilibrium strategies in the software release games from the viewpoints of both silent and noisy type of games. It is shown that the Nash equilibrium strategies in the silent and noisy of software release games exist under some parametric conditions.

New expected impact functions and algorithms for modeling games under soft sets

2020 ◽  
Vol 39 (3) ◽  
pp. 4463-4472
Author(s):  
Irfan Deli ◽  
Hoang Viet Long ◽  
Le Hoang Son ◽  
Raghvendra Kumar ◽  
Arindam Dey
Keyword(s):  
Decision Making ◽  
Nash Equilibrium ◽  
Model Theory ◽  
Saddle Points ◽  
Soft Set ◽  
Soft Sets ◽  
Matrix Games ◽  
Soft Matrix ◽  
Dominated Strategies

Soft set is the power tool to deal with uncertainty in a parametric manner. In applications of soft set, one of the most important steps is to define mappings on soft sets. In this study, we model theory of game under theory of soft set which is an effective tool for handling uncertainties events and problems that may exist in a game. To this end, we first define some expected impact functions of players in soft games. Then, we propose three new decision making algorithms to solve the 2.2 × p, 2 . n × p and m . 2 × p soft matrix games, which cannot be settled by the relevant soft methods such as saddle points, lover and upper values, dominated strategies and Nash equilibrium. The proposed soft game algorithms are illustrated by examples.

EXISTENCE AND UNIQUENESS OF EQUILIBRIUM IN ASYMMETRIC CONTESTS WITH ENDOGENOUS PRIZES

2013 ◽  
Vol 15 (01) ◽  
pp. 1350005 ◽  
Author(s):  
SHUMEI HIRAI ◽  
FERENC SZIDAROVSZKY
Keyword(s):  
Nash Equilibrium ◽  
Existence And Uniqueness ◽  
Financial Constraints ◽  
Pure Nash Equilibrium ◽  
Asymmetric Contests ◽  
Uniqueness Of Equilibrium

This paper considers contests in which the efforts of the players determine the value of the prize. Players may have different valuations of the prize and different abilities to convert expenditures to productive efforts. In addition, players may face different financial constraints. This paper presents a proof for the existence and uniqueness of a pure Nash equilibrium in asymmetric contests with endogenous prizes.

scholarly journals POTENTIAL MAXIMIZATION AND COALITION GOVERNMENT FORMATION

2005 ◽  
Vol 07 (04) ◽  
pp. 407-429 ◽  
Author(s):  
ROD GARRATT ◽  
JAMES E. PARCO ◽  
CHENG-ZHONG QIN ◽  
AMNON RAPOPORT
Keyword(s):  
Experimental Data ◽  
Nash Equilibrium ◽  
Winning Coalition ◽  
Coalition Government ◽  
Government Formation ◽  
Data Support ◽  
Dominated Strategies ◽  
The Government ◽  
Minimal Winning Coalitions ◽  
Unique Potential

A model of coalition government formation is presented in which inefficient, non-minimal winning coalitions may form in Nash equilibrium. Predictions for five games are presented and tested experimentally. The experimental data support potential maximization as a refinement of Nash equilibrium. In particular, the data support the prediction that non-minimal winning coalitions occur when the distance between policy positions of the parties is small relative to the value of forming the government. These conditions hold in games 1, 3, 4 and 5, where subjects played their unique potential-maximizing strategies 91, 52, 82 and 84 percent of the time, respectively. In the remaining game (Game 2) experimental data support the prediction of a minimal winning coalition. Players A and B played their unique potential-maximizing strategies 84 and 86 percent of the time, respectively, and the predicted minimal-winning government formed 92 percent of the time (all strategy choices for player C conform with potential maximization in Game 2). In Games 1, 2, 4 and 5 over 98 percent of the observed Nash equilibrium outcomes were those predicted by potential maximization. Other solution concepts including iterated elimination of weakly dominated strategies and strong/coalition-proof Nash equilibrium are also tested.

scholarly journals Strategic equilibrium versus global optimum for a pair of competing servers

2006 ◽  
Vol 43 (04) ◽  
pp. 1165-1172
Author(s):  
Benjamin Avi-Itzhak ◽  
Boaz Golany ◽  
Uriel G. Rothblum
Keyword(s):  
Nash Equilibrium ◽  
Queueing System ◽  
Optimal Solution ◽  
Global Optimum ◽  
Optimal Solutions ◽  
Service Rates ◽  
Unique Nash Equilibrium ◽  
Person Game ◽  
The Given ◽  
Linear Penalties

Christ and Avi-Itzhak (2002) analyzed a queueing system with two competing servers who determine their service rates so as to optimize their individual utilities. The system is formulated as a two-person game; Christ and Avi-Itzhak proved the existence of a unique Nash equilibrium which is symmetric. In this paper, we explore globally optimal solutions. We prove that the unique Nash equilibrium is generally strictly inferior to a globally optimal solution and that optimal solutions are symmetric and require the servers to adopt service rates that are smaller than those occurring in equilibrium. Furthermore, given a symmetric globally optimal solution, we show how to impose linear penalties on the service rates so that the given optimal solution becomes a unique Nash equilibrium. When service rates are not observable, we show how the same effect is achieved by imposing linear penalties on a corresponding signal.

Sign in / Sign up

Export Citation Format

Share Document