Ordinally symmetric game, Game Theory

Ordinally Symmetric Game Scenario

Any game during which the identity of the player doesn't amendment the relative order of the ensuing payoffs facing that player. In different words, every player ranks the payoffs from each strategy combination within the same order.

Description

A game is ordinally symmetric if the ordinal ranking of 1 player's payoffs is corresponding to the ordinal ranking of the transpose of the opposite player's payoffs. If the transpose of the opposite player's matrix is equivalent (not simply ordinally equivalent), then the sport is cardinally symmetric (or simply symmetric).

Outcome

The result that obtains from a selected combination of player's methods. each combination of methods (one for every player) is an outcome of the sport. A primary purpose of game theory is to work out that outcomes are stable, within the sense of being Nash equilibria

Example



Player 1



A

B

Player 2

A

1,5

0,6

B

3,1

4,8

Note that player 1's strategies are the matrix:

1

0

3

4

which transposed gives the following matrix (ranks in parentheses):

1 (3rd)

3 (2nd)

0 (4th)

4 (1st)

which is ordianlly equivalent to player 2's strategy matrix:

5 (3rd)

6 (2nd)

1 (4th)

8 (1st)

General Form



Player 2



L

R

Player 1

U

a,w

b,y

D

c,x

d,z

such that the ranking of a,b,c,d is equivalent to the ranking of w,x,y,z, respectively.

 

Posted Date: 7/21/2012 4:39:29 AM | Location : United States







Related Discussions:- Ordinally symmetric game, Assignment Help, Ask Question on Ordinally symmetric game, Get Answer, Expert's Help, Ordinally symmetric game Discussions

Write discussion on Ordinally symmetric game
Your posts are moderated
Related Questions
A multiunit auction mechanism for assigning heterogeneous (different) objects. The highest bidder in the first round selects one item among those offered for sale. Then, a second r

1.a.out 2 1 Here is the grid that has been generated: 1 1 1 0 0 0 0 0 1 1 0 1 0 0 1 1 1 1 0 0 1 1 1 1 0 1 1 0 0 1 1 0 0 1 0 1 1 1 1 1 1 0 1 0 1 1 0 1 0 1 1 1 0

Find Pure Nash Equilibria 1. Consider a two-player game in which player 1 chooses the strategy x 1 from the closed interval [-1, 1] while player 2 chooses the strategy x 2 fr

Nineteenth century French economist attributed with the introduction of the theory of profit maximizing producers. In his masterpiece, The Recherches, published in 1838, Cournot pr

An outcome of a game is Pareto dominated if another outcome would build a minimum of one player at an advantage while not hurting the other player. That is, another outcome is weak

write a program in c that takes n number finite players using gambit format and output is to be all pure strategy nash equilibrium

A non-credible threat may be a threat created by a player in a very Sequential Game which might not be within the best interest for the player to hold out. The hope is that the thr

Scenario The French thinker, Jean Jacques Rousseau, presented the subsequent state of affairs. 2 hunters will either jointly hunt a stag (an adult deer and rather massive meal)

Two individuals (i ∈ {1, 2}) work independently on a joint project. They each independently decide how much e ort ei they put. E ort choice has to be any real number between 0 and