Game Theory: No Winning Strategies

Click For Summary
SUMMARY

Game theory demonstrates that certain games, even those with perfect information and binary outcomes (win or lose), can exist without a winning strategy for either player. An example discussed is tic-tac-toe, which does not satisfy the criteria of having only win or lose outcomes. The axiom of choice is essential for proving the existence of such games, indicating that they may not be explicitly constructible. The conversation highlights the need for precise definitions of "game" and "winning strategy" to fully understand these concepts.

PREREQUISITES
  • Understanding of game theory fundamentals
  • Familiarity with the axiom of choice in mathematics
  • Knowledge of perfect information games
  • Concept of winning strategies in competitive scenarios
NEXT STEPS
  • Research the implications of the axiom of choice in game theory
  • Explore examples of games without winning strategies
  • Study the concept of determinacy in game theory
  • Examine the differences between simultaneous and sequential games
USEFUL FOR

Mathematicians, game theorists, and students studying competitive strategies in games will benefit from this discussion.

ehrenfest
Messages
2,001
Reaction score
1
http://en.wikipedia.org/wiki/Game_theory

It can be proven, using the axiom of choice, that there are games—even with perfect information, and where the only outcomes are "win" or "lose"—for which neither player has a winning strategy.) The existence of such strategies, for cleverly designed games, has important consequences in descriptive set theory.

I am confused about this. Can someone give me an example of a game with perfect information in which neither player has a winning strategy?
 
Physics news on Phys.org
Well, tic-tac-toe comes to mind.
 
I assume ehrenfest was asking for an example that satisfied the hypotheses in the quoted passage -- specifically, the only outcomes are "win" and "lose".

Alas, the page doesn't give a precise definition of "game" and "winning strategy"; without that, I couldn't really speculate. But since the article suggests the axiom of choice is needed, such games probably aren't explicitly constructible.
 
What kind of a game is not explicitly constructible?

Does that mean that if I get asked a question about a specific game on a test, I can assume that one player has a winning strategy? Can one prove that for explicitly constructable games?
 
A strategy is winning if the player following it must necessarily win, no matter what his opponent plays. (http://en.wikipedia.org/wiki/Determinacy#Winning_strategies)

Example 1: Rock, paper, scissors.

Example 2:
___________Column player__
___________Left ____ Right__
Row player:
Up.....(1, 0)...(0, 1)
Down...(0, 1)...(1, 0)

If CP plays L, RP wins by playing U, but if CP plays R, RP wins by D.
If RP plays U, CP wins by playing R, but if RP plays D, CP wins by L.
 
I don't think rock paper scissers is a game in the game theory sense.
 
ehrenfest said:
I don't think rock paper scissers is a game in the game theory sense.
Why not?
 
Okay, I guess its an example of a simultaneous game.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 9 ·
Replies
9
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 53 ·
2
Replies
53
Views
3K
  • · Replies 26 ·
Replies
26
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
5K