Computing Thiele Rules on Interval Elections and their Generalizations
This paper explores Thiele rules in approval-based committee voting, addressing the computational complexity of these rules. It presents a novel polynomial-time algorithm for computing Thiele outcomes on voter interval domains, previously an open problem. The approach extends to other generalized domains.
This paper explores Thiele rules in approval-based committee voting, addressing the computational complexity of these rules. It presents a novel polynomial-time algorithm for computing Thiele outcomes on voter interval domains, previously an open problem. The approach extends to other generalized domains.
Related articles
The AI world is getting ‘loopy’
AI models are taking a significant leap forward with the adoption of "agentic loops," where AI agents continuously prompt each other to improve code and solve complex problems. This approach, though potentially resource-intensive, promises to unlock new levels of autonomous problem-solving and efficiency in AI applications.
Codex-maxxing for long-running work
Codex is increasingly being used by organizations to support long-running projects that go beyond a single prompt. This whitepaper by Jason Liu offers practical strategies for leveraging Codex as a persistent workspace, managing complex workflows and sustaining progress.
Nobel laureate John Jumper is leaving DeepMind for rival Anthropic
Nobel laureate John Jumper is departing Google DeepMind to join its competitor, Anthropic, after dedicating nearly nine years to DeepMind, where he led the AlphaFold team. Jumper, who shared a Nobel Prize for his work on AlphaFold, expressed gratitude for his time at DeepMind while looking forward to new endeavors.