scholarly journals Learning Pure Nash Equilibrium in Smart Charging Games

2020 ◽  
Author(s):  
B. Sohet ◽  
Y. Hayel ◽  
O. Beaude ◽  
A. Jeandin
Keyword(s):  
Nash Equilibrium ◽  
Pure Nash Equilibrium ◽  
Smart Charging

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.

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.

Intermodal Hinterland Network Design Games

2020 ◽  
Vol 54 (5) ◽  
pp. 1272-1287
Author(s):  
Yann Bouchery ◽  
Marco Slikker ◽  
Jan C. Fransoo
Keyword(s):  
Nash Equilibrium ◽  
Network Design ◽  
Optimal Solution ◽  
Design Stage ◽  
Pure Nash Equilibrium ◽  
Design Problems ◽  
Distinctive Features ◽  
Multiple User ◽  
General Network ◽  
The Impact

Intermodal hinterland transportation is becoming increasingly critical for global container supply chains. Managing intermodal hinterland networks is challenging because multiple actors often interact in practice. The intermodal hinterland network design games that we propose enable assessing the impact of having noncooperative users in intermodal networks. The games fall into the class of network design games but have key distinctive features. We provide some general results as well as an instance without a pure Nash equilibrium for the general case. Subsequently, we focus on the special case with a single intermodal connection available. We show that a pure Nash equilibrium always exists but that this one is not always unique. We additionally identify key structural properties for this single-hub game. These properties enable us to identify all pure Nash equilibria and a system-optimal solution in polynomial time. We illustrate our results with an application related to the development of an extended gate in the Netherlands and derive a series of insights. Overall, the results show that the multiple user feature of intermodal hinterland networks is critical and needs to be accounted for at the network design stage. We believe that this latter statement holds for general network design problems with multiple users.

scholarly journals Pure Nash Equilibria: Hard and Easy Games

2005 ◽  
Vol 24 ◽  
pp. 357-406 ◽  
Author(s):  
G. Gottlob ◽  
G. Greco ◽  
F. Scarcello
Keyword(s):  
Nash Equilibrium ◽  
Nash Equilibria ◽  
Equilibrium Problems ◽  
Small Neighborhood ◽  
Constraint Satisfaction Problems ◽  
Pure Nash Equilibrium ◽  
Bounded Treewidth ◽  
Dependency Structure ◽  
Strong Nash Equilibrium ◽  
Restrictive Settings

We investigate complexity issues related to pure Nash equilibria of strategic games. We show that, even in very restrictive settings, determining whether a game has a pure Nash Equilibrium is NP-hard, while deciding whether a game has a strong Nash equilibrium is SigmaP2-complete. We then study practically relevant restrictions that lower the complexity. In particular, we are interested in quantitative and qualitative restrictions of the way each player's payoff depends on moves of other players. We say that a game has small neighborhood if the utility function for each player depends only on (the actions of) a logarithmically small number of other players. The dependency structure of a game G can be expressed by a graph DG(G) or by a hypergraph H(G). By relating Nash equilibrium problems to constraint satisfaction problems (CSPs), we show that if G has small neighborhood and if H(G) has bounded hypertree width (or if DG(G) has bounded treewidth), then finding pure Nash and Pareto equilibria is feasible in polynomial time. If the game is graphical, then these problems are LOGCFL-complete and thus in the class NC2 of highly parallelizable problems.

Sign in / Sign up

Export Citation Format

Share Document