TY - GEN
T1 - Multiple Attribute List Aggregation and an Application to Democratic Playlist Editing
AU - Briman, Eyal
AU - Talmon, Nimrod
N1 - Publisher Copyright: © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - We present a social choice model that incorporates time-based constraints, where the goal is to produce an ordered list that satisfies both agent preferences (based on approval ballots) and global constraints. First, we analyze the general model, showing that it is generally NP-hard, but admits polynomial-time algorithms for a special case; we also develop heuristic solutions for the general case. Furthermore, we explore potential applications of the model and demonstrate its relevance by focusing on the use case of democratic playlist editing. In this scenario, our aim is to generate a playlist that reflects agent preferences for a given set of musical tracks while also considering soft constraints regarding the sequencing and transitions of tracks over time. We illustrate how the problem of democratic playlist editing can be translated into our model, and present simulation results where we apply our heuristics to solve specific instances of the problem. We contend that our results are promising, not only for the specific use case of democratic playlist editing, but also for a plethora of other use cases that we introduce here.
AB - We present a social choice model that incorporates time-based constraints, where the goal is to produce an ordered list that satisfies both agent preferences (based on approval ballots) and global constraints. First, we analyze the general model, showing that it is generally NP-hard, but admits polynomial-time algorithms for a special case; we also develop heuristic solutions for the general case. Furthermore, we explore potential applications of the model and demonstrate its relevance by focusing on the use case of democratic playlist editing. In this scenario, our aim is to generate a playlist that reflects agent preferences for a given set of musical tracks while also considering soft constraints regarding the sequencing and transitions of tracks over time. We illustrate how the problem of democratic playlist editing can be translated into our model, and present simulation results where we apply our heuristics to solve specific instances of the problem. We contend that our results are promising, not only for the specific use case of democratic playlist editing, but also for a plethora of other use cases that we introduce here.
UR - http://www.scopus.com/inward/record.url?scp=85171994265&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-031-43264-4_1
DO - https://doi.org/10.1007/978-3-031-43264-4_1
M3 - Conference contribution
SN - 9783031432637
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 16
BT - Multi-Agent Systems - 20th European Conference, EUMAS 2023, Proceedings
A2 - Malvone, Vadim
A2 - Murano, Aniello
PB - Springer Science and Business Media Deutschland GmbH
T2 - Proceedings of the 20th European Conference on Multi-Agent Systems, EUMAS 2023
Y2 - 14 September 2023 through 15 September 2023
ER -