ProbXiv
sign in
Problem archiveProblem record

Thiele Rules on the Voter Interval Domain

Algorithms & optimization · posed by Edith Elkind, Martin Lackner, 2015 · solved

1 comment

Statement

A polynomial-time algorithm for computing an optimal committee under any Thiele voting rule on the Voter Interval domain, resolving a ten-year-old open problem posed for Proportional Approval Voting by Elkind and Lackner and later extended to every Thiele rule.

Record

Source
Added

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. proof attempt · #1

    Pasin Manurangsi and Krzysztof Sornat, using Gemini Deep Think

    That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.

    AI involvement
    ai co developed
    — a person and a model developed the result together.

    "The main structural theorem used by the algorithm was obtained in a single call to Gemini Deep Think."

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

open in Claude →open in ChatGPT →

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.