Complete Information Game
(Redirected from Perfect Information Game)
Jump to navigation
Jump to search
A Complete Information Game is a game in which all player information is public information (available to all players).
- AKA: Perfect Information Game.
- Context:
- It can typically provide Full Game State Visibility through complete information game position transparency.
- It can typically eliminate Information Asymmetry through complete information game shared knowledge.
- It can typically enable Pure Strategic Planning without hidden information consideration.
- It can typically allow Perfect Decision Making based on complete information game visible consequences.
- It can typically showcase Deterministic Outcome from complete information game rule application.
- It can typically support Computational Game Theory Analysis through complete information game state enumeration.
- ...
- It can often involve Sequential Decision Making through complete information game turn-based structure.
- It can often feature Board Position as the primary complete information game state representation.
- It can often demonstrate Game Tree Complexity despite complete information game full visibility.
- It can often encourage Deep Thinking through complete information game move calculation.
- It can often serve as Algorithm Testing Ground for complete information game AI development.
- ...
- It can range from being a Two-Player Complete Information Game to being a Multi-Player Complete Information Game, depending on its complete information game participant count.
- It can range from being a Zero-Sum Complete Information Game to being a Non-Zero-Sum Complete Information Game, depending on its complete information game outcome distribution.
- It can range from being a Simple Complete Information Game to being a Complex Complete Information Game, depending on its complete information game state space size.
- It can range from being a Sequential Complete Information Game to being a Simultaneous Complete Information Game, depending on its complete information game move timing.
- It can range from being a Fully-Solved Complete Information Game to being an Unsolved Complete Information Game, depending on its complete information game theoretical analysis level.
- It can range from being a Recreational Complete Information Game to being a Competitive Complete Information Game, depending on its complete information game playing context.
- ...
- It can be studied by Games Research to advance complete information game understanding.
- It can serve as AI Development Platform for complete information game playing algorithm.
- It can provide Educational Benefit through complete information game strategic thinking practice.
- It can facilitate Mathematical Analysis of complete information game optimal strategy.
- ...
- Examples:
- Abstract Complete Information Games, such as:
- Classical Board Complete Information Games, such as:
- Simple Complete Information Games, such as:
- Mathematical Complete Information Games, such as:
- Physical Complete Information Games, such as:
- Sports Complete Information Games, such as:
- Traditional Complete Information Games, such as:
- Economic Complete Information Games, such as:
- Computational Complete Information Games, such as:
- ...
- Abstract Complete Information Games, such as:
- Counter-Examples:
- Incomplete Information Games, such as:
- Card Games like Poker or Bridge, where player hand remains hidden information.
- Stratego, where piece identity is concealed until capture event.
- Battleship, where game board state is only partially visible to each player.
- Imperfect Information Games, such as:
- Game with Simultaneous Moves like Rock-Paper-Scissors, where player choice is revealed only after decision point.
- Game with Hidden Actions like Diplomacy, where player negotiation occurs privately.
- Game with Uncertainty, such as:
- Game with Random Elements like Backgammon, where dice roll introduces probabilistic outcome.
- Game with Environmental Uncertainty like Pandemic, where deck shuffling creates unpredictable game state.
- Incomplete Information Games, such as:
- See: Game, Game Information, Game Theory, Decision Theory, Minimax Algorithm, Alpha-Beta Pruning.
References
2017
- (Silver, 2017) ⇒ David Silver. (2017). “Technical Perspective: Solving Imperfect Information Games.” In: Communications of the ACM Journal, 60(11). doi:10.1145/3131286
- QUOTE: Most of this research focused on perfect information games, in which all events are observed by all players, culminating in programs that beat human world champions in checkers, chess, Othello, backgammon, and most recently, Go. However, many applications in the real world have imperfect information: each agent observes different events. This leads to the possibility of deception and a wealth of social strategies. …
2014
- http://en.wikipedia.org/wiki/Game_theory#Perfect_information_and_imperfect_information
- An important subset of sequential games consists of games of perfect information. A game is one of perfect information if all players know the moves previously made by all other players. Thus, only sequential games can be games of perfect information because players in simultaneous games do not know the actions of the other players. Most games studied in game theory are imperfect-information games. Interesting examples of perfect-information games include the ultimatum game and centipede game. Recreational games of perfect information games include chess, go and mancala. Many card games are games of imperfect information, such as poker or contract bridge.
Perfect information is often confused with complete information, which is a similar concept. Complete information requires that every player know the strategies and payoffs available to the other players but not necessarily the actions taken. Games of incomplete information can be reduced, however, to games of imperfect information by introducing “moves by nature” Template:Leyton-Brown.
- An important subset of sequential games consists of games of perfect information. A game is one of perfect information if all players know the moves previously made by all other players. Thus, only sequential games can be games of perfect information because players in simultaneous games do not know the actions of the other players. Most games studied in game theory are imperfect-information games. Interesting examples of perfect-information games include the ultimatum game and centipede game. Recreational games of perfect information games include chess, go and mancala. Many card games are games of imperfect information, such as poker or contract bridge.
2013
- http://en.wikipedia.org/wiki/Complete_information
- Complete information is a term used in economics and game theory to describe an economic situation or game in which knowledge about other market participants or players is available to all participants. Every player knows the payoffs and strategies available to other players.
Complete information is one of the theoretical pre-conditions of an efficient perfectly competitive market. In a sense it is a requirement of the assumption also made in economic theory that market participants act rationally. If a game is not of complete information, then the individual players would not be able to predict the effect that their actions would have on the other players (even if the actor presumed other players would act rationally).
- Complete information is a term used in economics and game theory to describe an economic situation or game in which knowledge about other market participants or players is available to all participants. Every player knows the payoffs and strategies available to other players.