Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Game theory
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Extensive form=== {{main|Extensive form game}} [[File:Ultimatum Game Extensive Form.svg|thumb|right|An extensive form game]] The extensive form can be used to formalize games with a time sequencing of moves. Extensive form games can be visualized using game [[Tree (graph theory)|trees]] (as pictured here). Here each [[Graph (discrete mathematics)|vertex]] (or node) represents a point of choice for a player. The player is specified by a number listed by the vertex. The lines out of the vertex represent a possible action for that player. The payoffs are specified at the bottom of the tree. The extensive form can be viewed as a multi-player generalization of a [[decision tree]].<ref>{{cite book |last1=Fudenberg |first1=Drew |last2=Tirole |first2=Jean |title=Game Theory |date=1991 |publisher=MIT Press |isbn=978-0-262-06141-4 |page=67 }}</ref> To solve any extensive form game, [[backward induction]] must be used. It involves working backward up the game tree to determine what a rational player would do at the last vertex of the tree, what the player with the previous move would do given that the player with the last move is rational, and so on until the first vertex of the tree is reached.<ref>{{Cite book |title=Security Studies: an Introduction |last=Williams |first=Paul D. |publisher=Routledge |year=2013 |location=[[Abingdon-on-Thames|Abingdon]] |pages=55β56 |edition=second}}</ref> The game pictured consists of two players. The way this particular game is structured (i.e., with sequential decision making and perfect information), ''Player 1'' "moves" first by choosing either {{var|F}} or {{var|U}} (fair or unfair). Next in the sequence, ''Player 2'', who has now observed ''Player 1''{{'}}s move, can choose to play either {{var|A}} or {{var|R}} (accept or reject). Once ''Player 2'' has made their choice, the game is considered finished and each player gets their respective payoff, represented in the image as two numbers, where the first number represents Player 1's payoff, and the second number represents Player 2's payoff. Suppose that ''Player 1'' chooses {{var|U}} and then ''Player 2'' chooses {{var|A}}: ''Player 1'' then gets a payoff of "eight" (which in real-world terms can be interpreted in many ways, the simplest of which is in terms of money but could mean things such as eight days of vacation or eight countries conquered or even eight more opportunities to play the same game against other players) and ''Player 2'' gets a payoff of "two". The extensive form can also capture simultaneous-move games and games with imperfect information. To represent it, either a dotted line connects different vertices to represent them as being part of the same information set (i.e. the players do not know at which point they are), or a closed line is drawn around them. (See example in the [[#Perfect information and imperfect information|imperfect information section]].)
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Game theory
(section)
Add topic