Large symmetric games are characterized by completeness of the desirability relation

Ezra Einy*, Abraham Neyman

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Fingerprint

Dive into the research topics of 'Large symmetric games are characterized by completeness of the desirability relation'. Together they form a unique fingerprint.

Keyphrases

Computer Science

Mathematics