Jump to content

Talk:Game theory: Difference between revisions

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
Content deleted Content added
m Archiving 1 discussion(s) to Talk:Game theory/Archive 3) (bot
m nominating article to be featured
Tag: Reverted
Line 1: Line 1:
{{featured article candidates|Game theory/archive2}}
{{afd-merged-from|Political game theory|Political game theory|16 March 2016}}
{{afd-merged-from|Political game theory|Political game theory|16 March 2016}}
{{Vital article|level=4|topic=Mathematics|class=C}}
{{Vital article|level=4|topic=Mathematics|class=C}}

Revision as of 08:21, 23 May 2021

Template:Vital article

Former featured articleGame theory is a former featured article. Please see the links under Article milestones below for its original nomination page (for older articles, check the nomination archive) and why it was removed.
Main Page trophyThis article appeared on Wikipedia's Main Page as Today's featured article on January 13, 2006.
Article milestones
DateProcessResult
November 13, 2005Peer reviewReviewed
December 4, 2005Featured article candidatePromoted
March 18, 2008Featured article reviewDemoted
Current status: Former featured article


Quantum game theory

Unless I'm looking the wrong place, the quantum game theory page is a bit bare (to say the least) but in any case, does anyone agree that it would be interesting if added here? QGT is one of the more interesting and accessible topics in quantum theory.- 26/10/06 Paul

"Perfect information and imperfect information" section

This seems to mix everything up. I'd suggest a rewrite like this, but I don't feel qualified to change it.


Perfect information and imperfect information Main article: Perfect 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. Interesting examples of perfect-information games include the ultimatum game and centipede game. Recreational games of perfect information games include chess, go and mancala.

Perfect information is often confused with complete information, which is a similar concept. See: (provide a link to one place where notion is discussed well...)

Most games studied in game theory are imperfect-information games. Many card games are games of imperfect information, such as poker or contract bridge. Games of incomplete information can be reduced, however, to games of imperfect information by introducing "moves by nature" (Leyton-Brown & Shoham

The first sentence is not good, and most of the intro is a real struggle

I don't know this topic. The whole intro is very hard to follow for the uninitiated. And in the 1st sentence using the phrase "rational decision-makers" without links is so broad and sounds more philosophical than mathematical. Is that the nature of this thing, still very amorphous even after ~60 years?

The 4th sentence would be a better start: "game theory applies to a wide range of behavioral relations, and is now an umbrella term for the science of logical decision making in humans, animals, and computers." But again, those three are very not equally "rational decision-makers" unless that distinction is made way more clear.

I do not know this topic so I can't suggest how to improve it, except to say it direly needs clarity. — Preceding unsigned comment added by Gatfish (talkcontribs) 04:01, 17 September 2018 (UTC)[reply]

"Logical" and "rational" are both common words, and are synonyms. The precise meaning of the words is explained in the body of the article, as one would expect. Can you try to articulate further what you think is unclear/difficult/whatever about the first paragraph? --JBL (talk) 11:20, 17 September 2018 (UTC)[reply]
Agree with Lewis. —Collective Loosers (talk) 16:12, 11 July 2020 (UTC)[reply]

Algorithmic Game Theory

A very hot modern area of game theoretic research. Tied to econ AI and distributed algos. Lots of robust results. Should be mentioned in the article. 2601:14D:4002:6D00:F557:B35D:C52A:CAD4 (talk) 08:28, 29 January 2020 (UTC)[reply]

Potential edit needed

A reader contacted Wikimedia ticket:2020091110005698 challenging the statement that:

Von Neumann's original proof used Brouwer's fixed-point theorem on continuous mappings into compact convex sets, which became a standard method in game theory and mathematical economics.

The reader cited this paper, which does appear to state that the original theorem did not use the concept of fixed point theorems (specifically Brouwer fixed-point theorem) when he first published in 1928, although he may you used that concept in 1937 (although not in his 1944 book). I've only briefly scanned the paper but it sounds like it makes a decent case.

Can we discuss whether the source appears solid?

I'll note that the sentencing question does not appear to be sourced (subsequent sentences have sources but they appear to be supportive of different points).--S Philbrick(Talk) 15:18, 11 September 2020 (UTC)[reply]