Computational social choice meets databases

Benny Kimelfeld, Phokion G. Kolaitis, Julia Stoyanovich

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We develop a novel framework that aims to create bridges between the computational social choice and the database management communities. This framework enriches the tasks currently supported in computational social choice with relational database context, thus making it possible to formulate sophisticated queries about voting rules, candidates, voters, issues, and positions. At the conceptual level, we give rigorous semantics to queries in this framework by introducing the notions of necessary answers and possible answers to queries. At the technical level, we embark on an investigation of the computational complexity of the necessary answers. In particular, we establish a number of results about the complexity of the necessary answers of conjunctive queries involving the plurality rule that contrast sharply with earlier results about the complexity of the necessary winners under the plurality rule.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018
    EditorsJerome Lang
    PublisherInternational Joint Conferences on Artificial Intelligence
    Pages317-323
    Number of pages7
    Volume2018-July
    ISBN (Electronic)9780999241127
    StatePublished - Jan 1 2018
    Event27th International Joint Conference on Artificial Intelligence, IJCAI 2018 - Stockholm, Sweden
    Duration: Jul 13 2018Jul 19 2018

    Other

    Other27th International Joint Conference on Artificial Intelligence, IJCAI 2018
    CountrySweden
    CityStockholm
    Period7/13/187/19/18

    Fingerprint

    Computational complexity
    Semantics

    ASJC Scopus subject areas

    • Artificial Intelligence

    Cite this

    Kimelfeld, B., Kolaitis, P. G., & Stoyanovich, J. (2018). Computational social choice meets databases. In J. Lang (Ed.), Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018 (Vol. 2018-July, pp. 317-323). International Joint Conferences on Artificial Intelligence.

    Computational social choice meets databases. / Kimelfeld, Benny; Kolaitis, Phokion G.; Stoyanovich, Julia.

    Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. ed. / Jerome Lang. Vol. 2018-July International Joint Conferences on Artificial Intelligence, 2018. p. 317-323.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Kimelfeld, B, Kolaitis, PG & Stoyanovich, J 2018, Computational social choice meets databases. in J Lang (ed.), Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. vol. 2018-July, International Joint Conferences on Artificial Intelligence, pp. 317-323, 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, 7/13/18.
    Kimelfeld B, Kolaitis PG, Stoyanovich J. Computational social choice meets databases. In Lang J, editor, Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. Vol. 2018-July. International Joint Conferences on Artificial Intelligence. 2018. p. 317-323
    Kimelfeld, Benny ; Kolaitis, Phokion G. ; Stoyanovich, Julia. / Computational social choice meets databases. Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. editor / Jerome Lang. Vol. 2018-July International Joint Conferences on Artificial Intelligence, 2018. pp. 317-323
    @inproceedings{4341cdb4a9344bae88b36f46a1f6b870,
    title = "Computational social choice meets databases",
    abstract = "We develop a novel framework that aims to create bridges between the computational social choice and the database management communities. This framework enriches the tasks currently supported in computational social choice with relational database context, thus making it possible to formulate sophisticated queries about voting rules, candidates, voters, issues, and positions. At the conceptual level, we give rigorous semantics to queries in this framework by introducing the notions of necessary answers and possible answers to queries. At the technical level, we embark on an investigation of the computational complexity of the necessary answers. In particular, we establish a number of results about the complexity of the necessary answers of conjunctive queries involving the plurality rule that contrast sharply with earlier results about the complexity of the necessary winners under the plurality rule.",
    author = "Benny Kimelfeld and Kolaitis, {Phokion G.} and Julia Stoyanovich",
    year = "2018",
    month = "1",
    day = "1",
    language = "English (US)",
    volume = "2018-July",
    pages = "317--323",
    editor = "Jerome Lang",
    booktitle = "Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018",
    publisher = "International Joint Conferences on Artificial Intelligence",

    }

    TY - GEN

    T1 - Computational social choice meets databases

    AU - Kimelfeld, Benny

    AU - Kolaitis, Phokion G.

    AU - Stoyanovich, Julia

    PY - 2018/1/1

    Y1 - 2018/1/1

    N2 - We develop a novel framework that aims to create bridges between the computational social choice and the database management communities. This framework enriches the tasks currently supported in computational social choice with relational database context, thus making it possible to formulate sophisticated queries about voting rules, candidates, voters, issues, and positions. At the conceptual level, we give rigorous semantics to queries in this framework by introducing the notions of necessary answers and possible answers to queries. At the technical level, we embark on an investigation of the computational complexity of the necessary answers. In particular, we establish a number of results about the complexity of the necessary answers of conjunctive queries involving the plurality rule that contrast sharply with earlier results about the complexity of the necessary winners under the plurality rule.

    AB - We develop a novel framework that aims to create bridges between the computational social choice and the database management communities. This framework enriches the tasks currently supported in computational social choice with relational database context, thus making it possible to formulate sophisticated queries about voting rules, candidates, voters, issues, and positions. At the conceptual level, we give rigorous semantics to queries in this framework by introducing the notions of necessary answers and possible answers to queries. At the technical level, we embark on an investigation of the computational complexity of the necessary answers. In particular, we establish a number of results about the complexity of the necessary answers of conjunctive queries involving the plurality rule that contrast sharply with earlier results about the complexity of the necessary winners under the plurality rule.

    UR - http://www.scopus.com/inward/record.url?scp=85055680987&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85055680987&partnerID=8YFLogxK

    M3 - Conference contribution

    VL - 2018-July

    SP - 317

    EP - 323

    BT - Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018

    A2 - Lang, Jerome

    PB - International Joint Conferences on Artificial Intelligence

    ER -