scholarly journals Dinamicke igre ulaska na trziste

2005 ◽  
Vol 50 (165) ◽  
pp. 121-144
Author(s):  
Bozo Stojanovic
Keyword(s):  
Nash Equilibrium ◽  
Dynamic Games ◽  
Nash Equilibria ◽  
Dynamic Game ◽  
Backward Induction ◽  
Perfect Equilibrium ◽  
Equilibrium Concept ◽  
Reasonable Solution ◽  
Multiple Nash Equilibria ◽  
Entry Games

Market processes can be analyzed by means of dynamic games. In a number of dynamic games multiple Nash equilibria appear. These equilibria often involve no credible threats the implementation of which is not in the interests of the players making them. The concept of sub game perfect equilibrium rules out these situations by stating that a reasonable solution to a game cannot involve players believing and acting upon noncredible threats or promises. A simple way of finding the sub game perfect Nash equilibrium of a dynamic game is by using the principle of backward induction. To explain how this equilibrium concept is applied, we analyze the dynamic entry games.

Quantifying Commitment in Nash Equilibria

2019 ◽  
Vol 21 (02) ◽  
pp. 1940011
Author(s):  
Thomas A. Weber
Keyword(s):  
Nash Equilibrium ◽  
Normal Form ◽  
Nash Equilibria ◽  
Dynamic Game ◽  
Subgame Perfect Equilibrium ◽  
Canonical Extension ◽  
Perfect Equilibrium ◽  
Form Game ◽  
Normal Form Game ◽  
The Given

To quantify a player’s commitment in a given Nash equilibrium of a finite dynamic game, we map the corresponding normal-form game to a “canonical extension,” which allows each player to adjust his or her move with a certain probability. The commitment measure relates to the average overall adjustment probabilities for which the given Nash equilibrium can be implemented as a subgame-perfect equilibrium in the canonical extension.

scholarly journals Non-Determinism and Nash Equilibria for Sequential Game over Partial Order

2005 ◽  
Vol DMTCS Proceedings vol. AF,... (Proceedings) ◽  
Author(s):  
Stéphane Le Roux
Keyword(s):  
Nash Equilibrium ◽  
Nash Equilibria ◽  
Ordered Set ◽  
Backward Induction ◽  
Proof Assistant ◽  
Perfect Equilibrium ◽  
Sequential Games ◽  
International Audience ◽  
Traditional Game ◽  
Deterministic Strategy

International audience In sequential games of traditional game theory, backward induction guarantees existence of Nash equilibrium by yielding a sub-game perfect equilibrium. But if payoffs range over a partially ordered set instead of the reals, then the backward induction predicate does no longer imply the Nash equilibrium predicate. Non-determinism is a solution: a suitable non-deterministic backward induction function returns a non-deterministic strategy profile which is a non-deterministic Nash equilibrium. The main notions and results in this article are constructive, conceptually simple and formalised in the proof assistant Coq.

scholarly journals An Algorithmic Procedure for Finding Nash Equilibrium

2020 ◽  
Vol 40 (1) ◽  
pp. 71-85
Author(s):  
HK Das ◽  
T Saha
Keyword(s):  
Nash Equilibrium ◽  
Nash Equilibria ◽  
Payoff Matrix ◽  
Matrix Game ◽  
Perfect Equilibrium ◽  
Repeated Use ◽  
Definition Of ◽  
Zero Sum ◽  
Mathematical Construction ◽  
Algorithmic Procedure

This paper proposes a heuristic algorithm for the computation of Nash equilibrium of a bi-matrix game, which extends the idea of a single payoff matrix of two-person zero-sum game problems. As for auxiliary but making the comparison, we also introduce here the well-known definition of Nash equilibrium and a mathematical construction via a set-valued map for finding the Nash equilibrium and illustrates them. An important feature of our algorithm is that it finds a perfect equilibrium when at the start of all actions are played. Furthermore, we can find all Nash equilibria of repeated use of this algorithm. It is found from our illustrative examples and extensive experiment on the current phenomenon that some games have a single Nash equilibrium, some possess no Nash equilibrium, and others had many Nash equilibria. These suggest that our proposed algorithm is capable of solving all types of problems. Finally, we explore the economic behaviour of game theory and its social implications to draw a conclusion stating the privilege of our algorithm. GANIT J. Bangladesh Math. Soc.Vol. 40 (2020) 71-85

The Logic of Rational Play in Games of Perfect Information

1991 ◽  
Vol 7 (1) ◽  
pp. 37-65 ◽  
Author(s):  
Giacomo Bonanno
Keyword(s):  
Nash Equilibrium ◽  
Nash Equilibria ◽  
Rational Solution ◽  
Noncooperative Games ◽  
Rational Behavior ◽  
Rational Solutions ◽  
Equilibrium Concept ◽  
The Past ◽  
Basic Tenet ◽  
Consensus View

For the past 20 years or so the literature on noncooperative games has been centered on the search for an equilibrium concept that expresses the notion of rational behavior in interactive situations. A basic tenet in this literature is that if a “rational solution” exists, it must be a Nash equilibrium. The consensus view, however, is that not all Nash equilibria can be accepted as rational solutions. Consider, for example, the game of Figure 1.

DOUBLE INVARIANCE: A NEW EQUILIBRIUM CONCEPT FOR TWO-PERSON DYNAMIC GAMES

2000 ◽  
Vol 02 (02n03) ◽  
pp. 193-207 ◽  
Author(s):  
P. CARAVANI
Keyword(s):  
Nash Equilibrium ◽  
Dynamic Games ◽  
Payoff Function ◽  
The State ◽  
Invariance Property ◽  
Invariant Equilibrium ◽  
Viability Theory ◽  
Necessary And Sufficient Condition ◽  
Equilibrium Concept ◽  
Necessary And Sufficient

Doubly Invariant Equilibrium is introduced as an alternative concept to Nash equilibrium in dynamic games doing away with the notion of a payoff function. A subset of the state space enjoys the invariance property if the state can be kept in it by one player, regardless of the action of the opponent. A doubly invariant equilibrium obtains when each player can make his own subset invariant. Relationships to Nash equilibrium and viability theory are discussed and a necessary and sufficient condition for the existence of a doubly invariant equilibrium is given for the class of linear discrete-time games with polyhedral constraints on the state and strategy spaces.

scholarly journals BACKWARD INDUCTION: MERITS AND FLAWS

2017 ◽  
Vol 50 (1) ◽  
pp. 9-24
Author(s):  
Marek M. Kamiński
Keyword(s):  
Infinite Number ◽  
Nash Equilibria ◽  
Complex Structure ◽  
Subgame Perfect Equilibrium ◽  
Perfect Information ◽  
Backward Induction ◽  
Perfect Equilibrium ◽  
Sequential Games ◽  
Theoretical Predictions

Abstract Backward induction (BI) was one of the earliest methods developed for solving finite sequential games with perfect information. It proved to be especially useful in the context of Tom Schelling’s ideas of credible versus incredible threats. BI can be also extended to solve complex games that include an infinite number of actions or an infinite number of periods. However, some more complex empirical or experimental predictions remain dramatically at odds with theoretical predictions obtained by BI. The primary example of such a troublesome game is Centipede. The problems appear in other long games with sufficiently complex structure. BI also shares the problems of subgame perfect equilibrium and fails to eliminate certain unreasonable Nash equilibria.

scholarly journals Computing Nash Equilibria of Unbounded Games

10.29007/1wpl ◽  
2018 ◽  
Author(s):  
Martin Escardo ◽  
Paulo Oliva
Keyword(s):  
Nash Equilibria ◽  
Proof Theory ◽  
A Priori ◽  
Subgame Perfect Equilibrium ◽  
Backward Induction ◽  
Closed Formula ◽  
Perfect Equilibrium ◽  
Finite Games ◽  
Game Theoretic ◽  
Theoretic Technique

Using techniques from higher-type computability theory and proof theory we extend the well-known game-theoretic technique of backward induction to finite games of unbounded length. The main application is a closed formula for calculating strategy profiles in Nash equilibrium and subgame perfect equilibrium even in the case of games where the length of play is not a-priori fixed.

scholarly journals Synthesis of Strategic Games with Multiple Nash Equilibria - A Global Optimization Approach

2019 ◽  
Author(s):  
Hime Oliveira
Keyword(s):  
Global Optimization ◽  
Nash Equilibrium ◽  
Nash Equilibria ◽  
Optimization Method ◽  
Optimization Techniques ◽  
Optimization Approach ◽  
Strategic Games ◽  
Finite State ◽  
Payoff Functions ◽  
Multiple Nash Equilibria

This paper presents an extension of the resuts obtained in previous work by the author concerning the application of global optimization techniques to the design of finite strategic games with mixed strategies. In that publication the Fuzzy ASA global optimization method was applied to many examples of synthesis of strategic games with one previously specified Nash equilibrium, evidencing its ability in finding payoff functions whose respective games present those equilibria, possibly among others. That is to say, it was shown it is possible to establish in advance a Nash equilibrium for a generic finite state strategic game and to compute payoff functions that will make it feasible to reach the chosen equilibrium, allowing players to converge to the desired profile, considering that it is an equilibrium of the game as well. Going beyond this state of affairs, the present article shows that it is possible to "impose" multiple Nash equilibria to finite strategic games by following the same reasoning as before, but with a slight change: using the same fundamental theorem of Richard D. McKelvey, modifying the original prescribed objective function and globally minimizing it. The proposed method, in principle, is able to find payoff functions that result in games featuring an arbitrary number of Nash equiibria, paving the way to a substantial number of potential applications.

A DYNAMIC GAME OF OFFENDING AND LAW ENFORCEMENT

2002 ◽  
Vol 04 (01) ◽  
pp. 71-89 ◽  
Author(s):  
THOMAS FENT ◽  
GUSTAV FEICHTINGER ◽  
GERNOT TRAGLER
Keyword(s):  
Steady State ◽  
Law Enforcement ◽  
Asymmetric Information ◽  
Nash Equilibria ◽  
Dynamic Game ◽  
Planning Horizon ◽  
Equilibrium Concept ◽  
Law Enforcement Agency ◽  
Potential Offender ◽  
The Law

In this paper, we analyse a differential game describing the interactions between a potential offender and the law enforcement agency. We assume that both players want to maximise their welfare expressed in monetary units, and compare the results obtained by applying the Nash equilibrium concept under symmetric with that under asymmetric information. The comparison reveals that under asymmetric information the offence rate is lower, due to the deterrence caused by the activities of the law enforcement agency. Both players' controls start at a steady state value and stick to it until close to the end of the planning horizon, when they leave the steady state to take into account the scrap value; this can be interpreted as a turnpike property of Nash equilibria. Furthermore, a sensitivity analysis is carried out. Among others, it turns out that a myopic offender tends to a higher offence level.

A Theory of Patronized Goods: Inefficient and Efficient Equilibria

2011 ◽  
pp. 65-87 ◽  
Author(s):  
A. Rubinstein
Keyword(s):  
Nash Equilibrium ◽  
Social Policy ◽  
Nash Equilibria ◽  
Institutional Environment ◽  
Social Motivation ◽  
Pareto Optimal ◽  
Market Failures ◽  
Equilibrium Conditions ◽  
Policy Issues

The article considers some aspects of the patronized goods theory with respect to efficient and inefficient equilibria. The author analyzes specific features of patronized goods as well as their connection with market failures, and conjectures that they are related to the emergence of Pareto-inefficient Nash equilibria. The key problem is the analysis of the opportunities for transforming inefficient Nash equilibrium into Pareto-optimal Nash equilibrium for patronized goods by modifying the institutional environment. The paper analyzes social motivation for institutional modernization and equilibrium conditions in the generalized Wicksell-Lindahl model for patronized goods. The author also considers some applications of patronized goods theory to social policy issues.

Sign in / Sign up

Export Citation Format

Share Document