Compilation complexity
Compilation complexity is the smallest number of bits required to summarize a input to a function, such that the output of the function can be computed correctly. The notion was particulatly studied in voting theory.[1] Often, a group has to accept a decision, but some of the voters have not arrived yet. It is desired to take the votes of the present voters and summarize them such that, when the other voters arrive, we can determine the winner. The compilation complexity of a voting-rule is the smallest number of bits required for the summary.
Topics
See also
- Communication complexity
- Knowledge compilation - compiling a part of the input offline, such that the when the online input arrives, the output can be computed quickly. Here, the goal of the compilation is to save time, rather than to save space.[1]
References
- ^ a b Chevaleyre, Yann; Lang, Jérôme; Maudet, Nicolas; Ravilly-Abadie, Guillaume (2009-07-11). "Compiling the votes of a subelectorate". Proceedings of the 21st International Joint Conference on Artificial Intelligence. IJCAI'09. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.: 97–102.
- ^ Xia, Lirong; Conitzer, Vincent (2010-07-04). "Compilation Complexity of Common Voting Rules". Proceedings of the AAAI Conference on Artificial Intelligence. 24 (1): 915–920. doi:10.1609/aaai.v24i1.7627. ISSN 2374-3468.
- ^ Karia, Neel; Lang, Jérôme (2021-05-18). "Compilation Complexity of Multi-Winner Voting Rules (Student Abstract)". Proceedings of the AAAI Conference on Artificial Intelligence. 35 (18): 15809–15810. doi:10.1609/aaai.v35i18.17901. ISSN 2374-3468.