"Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and ..."

Argyrios Deligkas et al. (2023)

> Home

Details and statistics

DOI: 10.24963/IJCAI.2023/294

access: open

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/ijcai/DeligkasEGNY23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/DeligkasEGNY23
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems. IJCAI 2023: 2642-2650

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.