An ordinal minimax theorem (Q5964692): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/geb/BrandtBS16, #quickstatements; #temporary_batch_1731483406851
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: The computational complexity of weak saddles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dutta's minimal covering set and Shapley's saddles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed refinements of Shapley's saddles and weak tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering sets and a new Condorcet choice correspondence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative stochastic dominance games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essentials of Game Theory: A Concise Multidisciplinary Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3252269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominated strategies and common knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2892811 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/geb/BrandtBS16 / rank
 
Normal rank

Latest revision as of 09:31, 13 November 2024

scientific article; zbMATH DE number 6547670
Language Label Description Also known as
English
An ordinal minimax theorem
scientific article; zbMATH DE number 6547670

    Statements

    Identifiers