The score reveal problem: How do we maximise entertainment?

Fowler, Aric and Booth, Richard ORCID: https://orcid.org/0000-0002-6647-6381 2024. The score reveal problem: How do we maximise entertainment? Presented at: 25th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2024), Kyoto, Japan, 18-24 November 2024. Published in: Arisaka, R., Sanchez-Anguix, V., Aydogan, R. and van der Torre, L. eds. Principles and Practice of Multi-Agent Systems. , vol.15395 Springer, 10.1007/978-3-031-77367-9_33

Preview

PDF - Accepted Post-Print Version Download (413kB) | Preview

Abstract

In many elections or competitions, a set of voters assign points to the candidates in a way that indicates their preferences, with the winning candidate being the candidate with the highest total score. When it comes to revealing the result after all votes have been cast, some competitions proceed by having a roll call where each voter announces their vote in turn. This is often done for entertainment purposes, leading to the introduction of the score reveal problem: Which ordering of the voters should be chosen to maximise the entertainment value of the roll call? We define several entertainment measures and consider their properties, motivated by considerations such as avoiding early resolution of the outcome, focusing attention on the leading candidates, and catering towards preferences for surprise or suspense. We compare several approaches for finding optimal solutions, comparing the hardness of doing so with different entertainment measures and voting formats.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Published Online
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	Springer
ISBN:	978-3-031-77366-2
Date of First Compliant Deposit:	26 September 2024
Last Modified:	27 Nov 2024 13:44
URI:	https://orca.cardiff.ac.uk/id/eprint/172393

Actions (repository staff only)

Edit Item