Classifying the Complexity of the Possible Winner Problem on Partial Chains

Vishal Chakraborty, Phokion G. Kolaitis. Classifying the Complexity of the Possible Winner Problem on Partial Chains. In Frank Dignum, Alessio Lomuscio, Ulle Endriss, Ann Nowé, editors, AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021. pages 297-305, ACM, 2021. [doi]

@inproceedings{ChakrabortyK21,
  title = {Classifying the Complexity of the Possible Winner Problem on Partial Chains},
  author = {Vishal Chakraborty and Phokion G. Kolaitis},
  year = {2021},
  url = {https://dl.acm.org/doi/10.5555/3463952.3463992},
  researchr = {https://researchr.org/publication/ChakrabortyK21},
  cites = {0},
  citedby = {0},
  pages = {297-305},
  booktitle = {AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021},
  editor = {Frank Dignum and Alessio Lomuscio and Ulle Endriss and Ann Nowé},
  publisher = {ACM},
  isbn = {978-1-4503-8307-3},
}