Zero-Sum Polymatrix Games: A Generalization of Minmax (Q2806824): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A Note on Strictly Competitive Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3786311 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On separable non-cooperative zero-sum games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5365039 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Prediction, Learning, and Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of computing a Nash equilibrium / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Adaptive game playing using multiplicative weights / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon / rank | |||
Normal rank |
Revision as of 00:01, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Zero-Sum Polymatrix Games: A Generalization of Minmax |
scientific article |
Statements
Zero-Sum Polymatrix Games: A Generalization of Minmax (English)
0 references
19 May 2016
0 references
polymatrix games
0 references
zero-sum games
0 references
efficient algorithm for Nash equilibria
0 references
convergence of no-regret dynamics
0 references