{"type":"ScholarlyArticle","title":"Computational Social Choice Meets Databases","authors":[{"name":"Benny Kimelfeld","slug":"benny-kimelfeld","given":"Benny","family":"Kimelfeld","affiliation":"Technion , Israel"},{"name":"Phokion G. Kolaitis","slug":"phokion-g-kolaitis","given":"Phokion G.","family":"Kolaitis","affiliation":"UC Santa Cruz , USA; IBM Research - Almaden , USA"},{"name":"Julia Stoyanovich","slug":"julia-stoyanovich","given":"Julia","family":"Stoyanovich","affiliation":"Drexel University , USA"}],"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.","doi":"10.24963/ijcai.2018/44","url":"https://ijcai.org/proceedings/2018/44","pdf":"https://ijcai.org/proceedings/2018/0044.pdf","markdown":"https://ijcai.org/proceedings/2018/44.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/44","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":44,"pages":{"first":317,"last":323},"keywords":["Multidisciplinary Topics and Applications: Databases","Agent-based and Multi-agent Systems: Voting","Agent-based and Multi-agent Systems: Computational Social Choice"],"videos":[],"references":[{"position":1,"raw":"[Abiteboul et al., 1995] Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison-Wesley, 1995.","title":"Foundations of Databases","authors":"Serge Abiteboul, Richard Hull, Victor Vianu","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bachrach et al., 2010] Yoram Bachrach, Nadja Betzler, and Piotr Faliszewski. Probabilistic possible winner determi- nation. In AAAI. AAAI Press, 2010.","title":"Probabilistic possible winner determination","authors":"Bachrach","year":"2010","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baumeister and Rothe, 2012] Dorothea Baumeister and Jörg Rothe. Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules. Inf. Process. Lett., 112(5):186-190, 2012.","title":"Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules","authors":"Rothe Baumeister, Dorothea Baumeister, Jörg Rothe","year":"2012","venue":"Inf. Process. Lett","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Betzler and Dorn, 2010] Nadja Betzler and Britta Dorn. To- wards a dichotomy for the possible winner problem in elections based on scoring rules. J. Comput. Syst. Sci., 76(8):812-836, 2010.","title":"Towards a dichotomy for the possible winner problem in elections based on scoring rules","authors":"Dorn Betzler, Nadja Betzler, Britta Dorn","year":"2010","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Dalvi and Suciu, 2004] Nilesh N. Dalvi and Dan Suciu. Ef- ficient query evaluation on probabilistic databases. In VLDB, pages 864-875.","title":"Efficient query evaluation on probabilistic databases","authors":"N Nilesh, Dan Dalvi, Suciu","year":null,"venue":"VLDB","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"Morgan Kaufmann, 2004.","title":null,"authors":"Morgan Kaufmann","year":"2004","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Doignon et al., 2004] Jean-Paul Doignon, Aleksandar Pekeč, and Michel Regenwetter. The repeated insertion model for rankings: Missing link between two subset choice models. Psychometrika, 69(1):33-54, 2004.","title":"The repeated insertion model for rankings: Missing link between two subset choice models","authors":"Doignon","year":"2004","venue":"Psychometrika","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Fagin et al., 2005] Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, and Lucian Popa. Data exchange: Seman- tics and query answering. Theoretical Computer Science, 336(1):89-124, 2005.","title":"Data exchange: Semantics and query answering","authors":"Ronald Fagin, G Phokion, Renée J Kolaitis, Lucian Miller, Popa","year":"2005","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Hägele and Pukelsheim, 2001] Gunter Hägele and Friedrich Pukelsheim. Llull's writings on electoral systems. Studia Lulliana, 41(97):3-38, 2001.","title":"Gunter Hägele and Friedrich Pukelsheim. Llull's writings on electoral systems","authors":"Pukelsheim Hägele","year":"2001","venue":"Studia Lulliana","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Imielinski and Jr., 1984] Tomasz Imielinski and Witold Lip- ski Jr. Incomplete information in relational databases. J. ACM, 31(4):761-791, 1984.","title":"Incomplete information in relational databases","authors":"Tomasz Imielinski, Witold Lipski","year":"1984","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Jacob et al., 2014] Marie Jacob, Benny Kimelfeld, and Julia Stoyanovich. A system for management and analysis of preference data. PVLDB, 7(12):1255-1258, 2014.","title":"A system for management and analysis of preference data","authors":"Jacob","year":"2014","venue":"PVLDB","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Kenig et al., 2017] Batya Kenig, Benny Kimelfeld, Haoyue Ping, and Julia Stoyanovich. Querying probabilistic pref- erences in databases. In PODS, pages 21-36, 2017.","title":"Querying probabilistic preferences in databases","authors":"Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich","year":"2017","venue":"PODS","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Konczak and Lang, 2005] Kathrin Konczak and Jérôme Lang. Voting procedures with incomplete preferences. In Proc. IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling, volume 20, 2005.","title":"Voting procedures with incomplete preferences","authors":"Kathrin Konczak, Jérôme Lang","year":"2005","venue":"Proc. IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Konczak, 2006] Kathrin Konczak. Voting theory in answer set programming. In WLP, volume 1843-06-02 of INF- SYS Research Report, pages 45-53. Technische Univer- sität Wien, Austria, 2006.","title":"Voting theory in answer set programming","authors":"Kathrin Konczak","year":"2006","venue":"INF-SYS Research Report","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Lenzerini, 2002] Maurizio Lenzerini. Data integration: A theoretical perspective. In PODS, pages 233-246, New York, NY, USA, 2002. ACM.","title":"Data integration: A theoretical perspective","authors":"Maurizio Lenzerini","year":"2002","venue":"PODS","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Libkin, 2004] Leonid Libkin. Elements of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2004.","title":"Elements of Finite Model Theory","authors":"Libkin","year":"2004","venue":"Texts in Theoretical Computer Science. An EATCS Series","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lu and Boutilier, 2011] Tyler Lu and Craig Boutilier. Vote elicitation with probabilistic preference models: Empiri- cal estimation and cost tradeoffs. In ADT, volume 6992 of Lecture Notes in Computer Science, pages 135-149. Springer, 2011.","title":"Vote elicitation with probabilistic preference models: Empirical estimation and cost tradeoffs","authors":"Lu, Boutilier, Tyler Lu, Craig Boutilier","year":"2011","venue":"ADT","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Lukasiewicz et al., 2014] Thomas Lukasiewicz, Maria Van- ina Martinez, Gerardo I. Simari, and Oana Tifrea- Marciuska. Ontology-based query answering with group preferences. ACM Trans. Internet Techn., 14(4):25:1- 25:24, 2014.","title":"Ontology-based query answering with group preferences","authors":"Thomas Lukasiewicz, Maria Vanina Martinez, Gerardo I Simari, Oana Tifrea-Marciuska","year":"2014","venue":"ACM Trans. Internet Techn","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Mallows, 1957] C. L. Mallows. Non-null ranking models. i. Biometrika, 44(1-2):114-130, June 1957.","title":"Non-null ranking models","authors":"C L Mallows","year":"1957","venue":"i. Biometrika","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Schaefer, 1978] Thomas J. Schaefer. The complexity of sat- isfiability problems. In STOC, pages 216-226, New York, NY, USA, 1978. ACM.","title":"The complexity of satisfiability problems","authors":"J Thomas, Schaefer","year":"1978","venue":"STOC","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Suciu et al., 2011] Dan Suciu, Dan Olteanu, Christopher Ré, and Christoph Koch. Probabilistic Databases. Syn- thesis Lectures on Data Management. Morgan & Claypool Publishers, 2011.","title":"Probabilistic Databases","authors":"Dan Suciu, Dan Olteanu, Christopher Ré, Christoph Koch","year":"2011","venue":"Synthesis Lectures on Data Management","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Xia and Conitzer, 2011] Lirong Xia and Vincent Conitzer. Determining possible and necessary winners given partial orders. J. Artif. Intell. Res., 41:25-67, 2011.","title":"Determining possible and necessary winners given partial orders","authors":"Lirong Xia, Vincent Conitzer","year":"2011","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}