Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Perfect information

From Wikipedia, the free encyclopedia
Condition in economics and game theory
Chess is a game of perfect information
Poker is a game of imperfect information as opponents' private cards are not known

Perfect information is a concept ingame theory andeconomics that describes a situation where all players in a game or all participants in a market have knowledge of all relevant information in the system. This is different thancomplete information, which impliescommon knowledge of each agent's utility functions, payoffs, strategies and "types". A system with perfect information may or may not have complete information.

In economics this is sometimes described as "no hidden information" and is a feature ofperfect competition. In a market with perfect information all consumers and producers would have complete and instantaneous knowledge of all market prices, their own utility and cost functions.

In game theory, asequential game has perfect information if each player, when making any decision, is perfectly informed of all the events that have previously occurred, including the "initialisation event" of thegame (e.g. the starting hands of each player in a card game).[1][2][3][4]

Games where some aspect of play ishidden from opponents – such as the cards inpoker andbridge – are examples of games withimperfect information.[5][6]

Examples

[edit]
Go is a game of perfect information.

Chess is an example of a game with perfect information, as each player can see all the pieces on the board at all times.[2] Other games with perfect information includetic-tac-toe,Reversi,checkers, andGo.[3]

Academic literature has not produced consensus on a standard definition of perfect information which defines whether games with chance,but no secret information, and games withsimultaneous moves are games of perfect information.[4][7][8][9]

Games which aresequential (players alternate in moving) and which havechance events (with known probabilities to all players) butno secret information, are sometimes considered games of perfect information. This includes games such asbackgammon. However, some academic papers do not regard such games as games of perfect information because the results of chance themselves are unknown prior to them occurring.[4][7][8][9]

Games withsimultaneous moves are generally not considered games of perfect information. This is because each player holds information, which is secret, and must play a move without knowing the opponent's secret information. Nevertheless, some such games aresymmetrical, and fair. An example of a game in this category isrock paper scissors.[4][7][8][9]

See also

[edit]

References

[edit]
  1. ^Osborne, M. J.; Rubinstein, A. (1994). "Chapter 6: Extensive Games with Perfect Information".A Course in Game Theory. Cambridge, Massachusetts: The MIT Press.ISBN 0-262-65040-1.
  2. ^abKhomskii, Yurii (2010)."Infinite Games (section 1.1)"(PDF).
  3. ^abArchived atGhostarchive and theWayback Machine:"Infinite Chess".PBS Infinite Series. March 2, 2017. Perfect information defined at 0:25, with academic sourcesarXiv:1302.4377 andarXiv:1510.08155.
  4. ^abcdMycielski, Jan (1992). "Games with Perfect Information".Handbook of Game Theory with Economic Applications. Vol. 1. pp. 41–70.doi:10.1016/S1574-0005(05)80006-2.ISBN 978-0-444-88098-7.
  5. ^Thomas, L. C. (2003).Games, Theory and Applications. Mineola New York: Dover Publications. p. 19.ISBN 0-486-43237-8.
  6. ^Osborne, M. J.; Rubinstein, A. (1994). "Chapter 11: Extensive Games with Imperfect Information".A Course in Game Theory. Cambridge Massachusetts: The MIT Press.ISBN 0-262-65040-1.
  7. ^abcJanet Chen; Su-I Lu; Dan Vekhter."Game Theory: Rock, Paper, Scissors".cs.stanford.edu.
  8. ^abcFerguson, Thomas S."Game Theory"(PDF). UCLA Department of Mathematics. pp. 56–57. Archived fromthe original(PDF) on 2004-07-30. Retrieved2019-06-24.
  9. ^abcBurch; Johanson; Bowling."Solving Imperfect Information Games Using Decomposition".Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence.

Further reading

[edit]
  • Fudenberg, D. andTirole, J. (1993)Game Theory,MIT Press. (see Chapter 3, sect 2.2)
  • Gibbons, R. (1992)A primer in game theory, Harvester-Wheatsheaf. (see Chapter 2)
  • Luce, R.D. andRaiffa, H. (1957)Games and Decisions: Introduction and Critical Survey, Wiley & Sons (see Chapter 3, section 2)
  • The Economics ofGroundhog Day by economist D.W. MacKenzie, using the 1993 filmGroundhog Day to argue that perfect information, and therefore perfect competition, is impossible.
  • Watson, J. (2013)Strategy: An Introduction to Game Theory, W.W. Norton and Co.
Traditionalgame theory
Definitions
Equilibrium
concepts
Strategies
Games
Theorems
Subfields
Key people
Core
concepts
Games
Mathematical
tools
Search
algorithms
Key people
Core
concepts
Games
Applications
Key people
Core
concepts
Theorems
Applications
Other topics
Retrieved from "https://en.wikipedia.org/w/index.php?title=Perfect_information&oldid=1324160733"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp