Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems

Cite

Text

Deligkas et al. "Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems." International Joint Conference on Artificial Intelligence, 2023. doi:10.24963/IJCAI.2023/294

Markdown

[Deligkas et al. "Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems." International Joint Conference on Artificial Intelligence, 2023.](https://mlanthology.org/ijcai/2023/deligkas2023ijcai-complexity/) doi:10.24963/IJCAI.2023/294

BibTeX

@inproceedings{deligkas2023ijcai-complexity,
  title     = {{Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems}},
  author    = {Deligkas, Argyrios and Eiben, Eduard and Gutin, Gregory Z. and Neary, Philip R. and Yeo, Anders},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2023},
  pages     = {2642-2650},
  doi       = {10.24963/IJCAI.2023/294},
  url       = {https://mlanthology.org/ijcai/2023/deligkas2023ijcai-complexity/}
}