Algorithmic Techniques for Necessary and Possible Winners

被引：1

作者：

Chakraborty, Vishal ^{[1
]}

Delemazure, Theo ^{[2
]}

Kimelfeld, Benny ^{[3
]}

Kolaitis, Phokion G. ^{[4
]}

Relia, Kunal ^{[5
]}

Stoyanovich, Julia ^{[6
]}

机构：

[1] Computer Science and Engineering Department, Jack Baskin School of Engineering, University of California Santa Cruz, Santa Cruz,CA,95064, United States

[2] Ecole Normale Superieure, 45, Rue d'Ulm, Paris,75005, France

[3] Henry and Marilyn Taub Faculty of Computer Science, Technion, Haifa,3200003, Israel

[4] Computer Science and Engineering Department, Jack Baskin School of Engineering, University of California Santa Cruz, Santa Cruz,CA,95064, United States

[5] Computer Science and Engineering Department, Tandon School of Engineering, New York University, 370 Jay Street, Brooklyn,NY,11201, United States

[6] Center for Data Science, New York University, 60 5th Avenue, New York,NY,10011, United States

来源：

ACM/IMS Transactions on Data Science | 2021年 / 2卷 / 03期

关键词：

Algorithmic techniques - Integer Linear Programming - Optimization solvers - Optimization techniques - Polynomial-time algorithms - Positional scoring rules - Realistic scenario - Synthetic data;

D O I：

10.1145/3458472

中图分类号：

学科分类号：

摘要：

引用