Random Actions in Experimental Zero-Sum Games

نویسندگان

چکیده

A mixed strategy, a strategy of unpredictable actions, is applicable to business, politics, and sports. Playing strategies, however, poses challenge, as the game theory involves calculating probabilities executing random actions. I test i.i.d. hypotheses Nash equilibrium with simplest experiments in which student participants play zero-sum games multiple iterations possibly figure out optimal (equilibrium) through games. My results confirm that most players behave differently from prediction for 2x2 (matching-pennies) 3x3 (e.g., rock-paper-scissors game). The indicate need further develop theoretical models explain non-Nash behavior.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS

In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...

متن کامل

Approximations in Dynamic Zero-sum Games, Ii Approximations in Dynamic Zero-sum Games, Ii

We pursue in this paper our study of approximations of values and-saddle-point policies in dynamic zero-sum games. After extending the general theorem for approximation, we study zero-sum stochastic games with countable state space, and non-bounded immediate reward. We focus on the expected average payoo criterion. We use some tools developed in the rst paper, to obtain the convergence of the v...

متن کامل

Sparse binary zero-sum games

Solving zero-sum matrix games is polynomial, because it boils down to linear programming. The approximate solving is sublinear by randomized algorithms on machines with random access memory. Algorithms working separately and independently on columns and rows have been proposed, with the same performance; these versions are compliant with matrix games with stochastic reward. (Flory and Teytaud, ...

متن کامل

Zero-sum games with charges

We consider two-player zero-sum games with countably infinite action spaces and bounded payoff functions. The players’ strategies are finitely additive probability measures, called charges. Since a strategy profile does not always induce a unique expected payoff, we distinguish two extreme attitudes of players. A player is viewed as pessimistic if he always evaluates the range of possible expec...

متن کامل

Definable Zero-Sum Stochastic Games

Definable zero-sum stochastic games involve a finite number of states and action sets, reward and transition functions that are definable in an o-minimal structure. Prominent examples of such games are finite, semi-algebraic or globally subanalytic stochastic games. We prove that the Shapley operator of any definable stochastic game with separable transition and reward functions is definable in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Economics and Behavioral Studies

سال: 2021

ISSN: ['2220-6140']

DOI: https://doi.org/10.22610/jebs.v13i1(j).3150