Rank Maximal Equal Contribution: A Probabilistic Social Choice Function

Authors

  • Haris Aziz Data61, CSIRO and University of New South Wales
  • Pang Luo Data61, CSIRO and University of New South Wales
  • Christine Rizkallah University of Pennsylvania

Keywords:

algorithms, game theory, social choice theory, probabilistic social choice, voting mechanisms, random serial dictatorship, ex post efficient, participation, fairness

Abstract

When aggregating preferences of agents via voting, two desirable goals are to incentivize agents to participate in the voting process and then identify outcomes that are Pareto efficient. We consider participation as formalized by Brandl, Brandt, and Hofbauer (2015) based on the stochastic dominance (SD) relation. We formulate a new rule called RMEC (Rank Maximal Equal Contribution) that is polynomial-time computable, ex post efficient and satisfies the strongest notion of participation. It also satisfies many other desirable fairness properties. The rule suggests a general approach to achieving very strong participation, ex post efficiency and fairness.

Downloads

Published

2018-04-25

How to Cite

Aziz, H., Luo, P., & Rizkallah, C. (2018). Rank Maximal Equal Contribution: A Probabilistic Social Choice Function. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1). Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/11448

Issue

Section

AAAI Technical Track: Game Theory and Economic Paradigms