External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Complexity of the Possible Winner Problem with Partitioned Preferences

Batya Kenig. The Complexity of the Possible Winner Problem with Partitioned Preferences. In Edith Elkind, Manuela Veloso, Noa Agmon, Matthew E. Taylor, editors, Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '19, Montreal, QC, Canada, May 13-17, 2019. pages 2051-2053, International Foundation for Autonomous Agents and Multiagent Systems, 2019. [doi]

Abstract

Abstract is missing.

runs on