Heuristic Voting as Ordinal Dominance Strategies

Authors

  • Omer Lev Ben-Gurion University
  • Reshef Meir Technion – Israel Institute of Technology
  • Svetlana Obraztsova Nanyang Technological University
  • Maria Polukarov King's College London

DOI:

https://doi.org/10.1609/aaai.v33i01.33012077

Abstract

Decision making under uncertainty is a key component of many AI settings, and in particular of voting scenarios where strategic agents are trying to reach a joint decision. The common approach to handle uncertainty is by maximizing expected utility, which requires a cardinal utility function as well as detailed probabilistic information. However, often such probabilities are not easy to estimate or apply.

To this end, we present a framework that allows for “shades of gray” of likelihood without probabilities. Specifically, we create a hierarchy of sets of world states based on a prospective poll, with inner sets contain more likely outcomes. This hierarchy of likelihoods allows us to define what we term ordinally-dominated strategies. We use this approach to justify various known voting heuristics as bounded-rational strategies.

Downloads

Published

2019-07-17

How to Cite

Lev, O., Meir, R., Obraztsova, S., & Polukarov, M. (2019). Heuristic Voting as Ordinal Dominance Strategies. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01), 2077-2084. https://doi.org/10.1609/aaai.v33i01.33012077

Issue

Section

AAAI Technical Track: Game Theory and Economic Paradigms