Social Golfer Problem Revisited

Liu, Ke; Löffler, Sven; Hofstedt, Petra

doi:10.1007/978-3-030-37494-5_5

Cited by 4 publications

(4 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Iterative Group-Formation Strategies Iterative random: In each round, agents are randomly assigned to groups. Iterative golfer: This strategy is a variant of the social golfer problem [Harvey, 2002;Liu et al, 2019] from combinatorial optimization. The number of rounds, R, is fixed a priori, and the number of times any pair of agents meet more than once is minimized.…”

Section: Deliberation Groupsmentioning

confidence: 99%

Deliberation and Voting in Approval-Based Multi-Winner Elections

Mehra

Sreenivas

Larson

2023

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence

View full text Add to dashboard Cite

Citizen-focused democratic processes where participants deliberate on alternatives and then vote to make the final decision are increasingly popular today. While the computational social choice literature has extensively investigated voting rules, there is limited work that explicitly looks at the interplay of the deliberative process and voting. In this paper, we build a deliberation model using established models from the opinion-dynamics literature and study the effect of different deliberation mechanisms on voting outcomes achieved when using well-studied voting rules. Our results show that deliberation generally improves welfare and representation guarantees, but the results are sensitive to how the deliberation process is organized. We also show, experimentally, that simple voting rules, such as approval voting, perform as well as more sophisticated rules such as proportional approval voting or method of equal shares if deliberation is properly supported. This has ramifications on the practical use of such voting rules in citizen-focused democratic processes.

show abstract

Section: Deliberation Groupsmentioning

confidence: 99%

Deliberation and Voting in Approval-Based Multi-Winner Elections

Mehra

Sreenivas

Larson

2023

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence

View full text Add to dashboard Cite

show abstract

“…We worked independently toward this aim and arrived at a special solution shown in the Supporting Information. Unlike other solutions to the social golfer problem, − our solution is derived using the binary number system in the round-robin tournament and the extension to other radices. Alternatively, Miller et al introduced a ready-to-use online tool for group assignments.…”

Section: Four Stages Of Acad-feedbackmentioning

confidence: 99%

ACAD-Feedback: Online Framework for Assignment, Collection, Analysis, and Distribution of Self, Peer, Instructor, and Group Feedback

et al. 2021

View full text Add to dashboard Cite

Working with peers is an integral part of a student’s educational experience in most disciplines from preschool to tertiary education. For secondary and undergraduate chemistry education, it is inevitable that some laboratory sessions require students to work in groups for logistic and safety reasons. In this technology report, we demonstrate use cases of Google Forms and Google Sheets to assign (A) students into groups, collect (C), analyze (A), and distribute (D) their feedback in group work as well as in self-, peer-, and instructor-assessed individual work. Our ACAD-Feedback framework is designed to streamline the manual delivery of the four processes into one online framework. This framework can be used in other settings with minimal modifications.

show abstract

“…Our encoding is as follows. Each player must have a seat: ∀i, l. s W i,l,s = 1 (14) Exactly one player in a group can take each seat:…”

Section: Wind Balancing Constraint Encodingmentioning

confidence: 99%

“…Recently, Lardeux and others revisited the SAT encoding, exploring efficient, correct translation of set constraints [12]; they seem unaware of PB problems/solvers. Liu and others investigated solving SGP instances in parallel [14].…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Theory and Applications of Satisfiability Testing – SAT 2021

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Reach mahjong is a gambling game for 4 players, most popular in Japan, but played internationally, including in amateur tournaments across Europe. We report on our experience of generating tournament schedules for tournaments hosted in the United Kingdom using pseudoboolean solvers. The problem is essentially an extension of the well-studied Social Golfer Problem (SGP) in operations research. However, in our setting, there are further constraints, such as the positions of players within a group, and the structure of the tournament graph, which are ignored in the usual formulation of the SGP. We tackle the problem primarily using the SAT/pseudoboolean solver clasp, but sometimes augmented with an existing local search-based solver for the SGP.

show abstract

Social Golfer Problem Revisited

Cited by 4 publications

References 25 publications

Deliberation and Voting in Approval-Based Multi-Winner Elections

Deliberation and Voting in Approval-Based Multi-Winner Elections

ACAD-Feedback: Online Framework for Assignment, Collection, Analysis, and Distribution of Self, Peer, Instructor, and Group Feedback

Theory and Applications of Satisfiability Testing – SAT 2021

Contact Info

Product

Resources

About