Computing the Proportional Veto Core


  • Egor Ianovski HSE University
  • Aleksei Y. Kondratev HSE University Institute for Regional Economic Studies RAS



Social Choice / Voting


In social choice there often arises a conflict between the majority principle (the search for a candidate that is as good as possible for as many voters as possible), and the protection of minority rights (choosing a candidate that is not overly bad for particular individuals or groups). In a context where the latter is our main concern, veto-based rules -- giving individuals or groups the ability to strike off certain candidates from the list -- are a natural and effective way of ensuring that no minority is left with an outcome they find untenable. However, such rules often fail to be anonymous, or impose specific restrictions on the number of voters and candidates. These issues can be addressed by considering the proportional veto core -- the solution to a cooperative game where every coalition is given the power to veto a number of candidates proportional to its size. However, the naive algorithm for the veto core is exponential, and the only known rules for selecting from the veto core, with an arbitrary number of voters, violate either anonymity or neutrality. In this paper we present a polynomial time algorithm for computing the veto core and present a neutral and anonymous algorithm for selecting a candidate from it. We also show that a pessimist can manipulate the veto core in polynomial time.




How to Cite

Ianovski, E., & Kondratev, A. Y. (2021). Computing the Proportional Veto Core. Proceedings of the AAAI Conference on Artificial Intelligence, 35(6), 5489-5496.



AAAI Technical Track on Game Theory and Economic Paradigms