Pith. sign in

REVIEW

Intelligent Players in a Fictitious Play Framework

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.05939 v1 pith:LLYVQK2M submitted 2021-10-12 cs.GT cs.SYeess.SY

classification cs.GTcs.SYeess.SY
keywords fictitiousplayplayersintelligentpayoffplayeralgorithmequilibrium
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Fictitious play is a popular learning algorithm in which players that utilize the history of actions played by the players and the knowledge of their own payoff matrix can converge to the Nash equilibrium under certain conditions on the game. We consider the presence of an intelligent player that has access to the entire payoff matrix for the game. We show that by not conforming to fictitious play, such a player can achieve a better payoff than the one at the Nash Equilibrium. This result can be viewed both as a fragility of the fictitious play algorithm to a strategic intelligent player and an indication that players should not throw away additional information they may have, as suggested by classical fictitious play.

Discussion (0). Continue with ORCID to comment.

Pith tools