Author of the publication

Efficient voting via the top-k elicitation scheme: a probabilistic approach.

, and . EC, page 295-312. ACM, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Bounded Indistinguishability for Simple Sources., , , , , and . Electron. Colloquium Comput. Complex., (2021)Shapley Values in Weighted Voting Games with Random Weights., , and . CoRR, (2016)Approximate polymorphisms., , , , and . CoRR, (2021)Explicit SoS Lower Bounds from High-Dimensional Expanders., , , and . ITCS, volume 185 of LIPIcs, page 38:1-38:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Query-To-Communication Lifting for BPP Using Inner Product., , , , and . ICALP, volume 132 of LIPIcs, page 35:1-35:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Efficient voting via the top-k elicitation scheme: a probabilistic approach., and . EC, page 295-312. ACM, (2014)A Characterization of Voting Power for Discrete Weight Distributions., , , and . IJCAI, page 74-80. IJCAI/AAAI Press, (2016)Lifting Dichotomies., , and . CCC, volume 300 of LIPIcs, page 9:1-9:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds., , and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 618-629. Springer, (2011)A Log-Sobolev Inequality for the Multislice, with Applications., , and . ITCS, volume 124 of LIPIcs, page 34:1-34:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)