{"id":"51e9fe1b-ad25-4347-96f0-6d199063fa14","arxiv_id":"2605.22528","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Defines multi-winner voting games in TU and NTU, then analyzes core non-emptiness and computation for AV, SAV, CC, and PAV under approval utilities.","lead":"This paper frames multi-winner approval voting as cooperative games and studies when the core stays non-empty under transferable-utility and non-transferable-utility models. A smart generalist might read it to understand stability guarantees for committee selection rules used in real elections or resource allocation.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Proportional seat cap on coalitions may be the key enabler of claimed core non-emptiness results","rationale":"The reader's weakest assumption correctly isolates the proportional cap as the least secure modeling choice. This restriction directly shapes the blocking condition and therefore the core itself; any existence result is conditional on it. The concrete test isolates whether the cap is load-bearing for non-emptiness.","tokens_in":1911,"tokens_out":379,"duration_ms":52757,"concrete_test":"Take the AV rule with n=4 voters, k=2, candidates {a,b,c}, voter approvals: v1 approves {a,b}, v2 approves {a,c}, v3 approves {b}, v4 approves {c}. Enumerate all feasible utility vectors for the grand coalition and all possible blocking coalitions both with and without the proportional size cap; check whether the TU-core remains non-empty when coalitions of size 2 are allowed to propose committees of size 2 (instead of at most 1).","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim analyzes core existence for AV, SAV, CC and PAV under the defined TU/NTU games. Core non-emptiness (or conditions for it) rests on every coalition S being restricted to admissible committees of size at most its proportional share (|S|·k/n). This cap is built into the blocking condition and matches Aziz et al. for the NTU-PAV case. In the TU model, where a coalition can redistribute total utility from an admissible committee, removing or relaxing the cap would allow larger deviations, increasing blocking power and potentially rendering the core empty for profiles where the paper claims non-emptiness. The modeling choice is explicit but its necessity for the positive existence results is not independently verified beyond unification with prior NTU work.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript introduces multi-winner voting games as a cooperative-game framework unifying TU and NTU models for coalitional stability in multi-winner approval voting. Coalitions are restricted to admissible committees of size at most their proportional share (|S|·k/n). Fixing a rule (AV, SAV, CC, or PAV), each admissible committee induces a utility vector; in TU the coalition may redistribute total utility while in NTU it must use a realized vector. The core is the set of grand-coalition feasible vectors not blocked by any coalition. The NTU-core under PAV recovers the core-stable committees of Aziz et al. (2017); the TU-core is new. The paper analyzes core existence and computation for the four rules.","tokens_in":2039,"tokens_out":600,"duration_ms":44001,"significance":"If the core non-emptiness claims hold, the work supplies a unified lens on stability concepts already studied for NTU-PAV and extends them to the TU setting, which has not been examined before. The explicit treatment of four standard rules and the computational angle could strengthen the link between cooperative game theory and computational social choice.","major_comments":[{"comment":"§2 (game definition) and blocking condition: the proportional seat cap is built directly into the admissible committees a coalition may propose. The manuscript should supply either a proof that non-emptiness survives removal of the cap or an explicit counter-example profile in which the TU-core becomes empty once coalitions may propose larger committees and redistribute utility. This is load-bearing for the central existence claims.","section":"§2 (Definitions and blocking condition)"},{"comment":"TU-core results (likely §4–5): the abstract states that core existence and computation are analyzed for AV, SAV, CC and PAV, yet the precise statements (e.g., “the TU-core is always non-empty under SAV”) and the corresponding proofs or algorithms are not visible in the provided excerpt. Each rule’s claim must be stated with its exact hypothesis and proof sketch so that the reader can verify independence from the seat-cap modeling choice.","section":"TU-core analysis sections"}],"minor_comments":[{"comment":"Abstract: the phrase “when is the core always non-empty?” should be qualified by the rules and conditions under which non-emptiness is proved, to avoid over-statement.","section":"Abstract"},{"comment":"Notation: the manuscript should consistently distinguish the TU-value function v(S) from the NTU feasible-set correspondence, perhaps with a side-by-side table.","section":"Notation and definitions"}],"recommendation":"major_revision","confidential_remarks":"The manuscript sits comfortably within the scope of a computational social choice or algorithmic game theory venue. Citation of Aziz et al. is appropriate; no obvious citation-pattern issues."},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the careful and constructive report. We address each major comment below and describe the revisions we will make to strengthen the manuscript.","responses":[{"response":"We agree that the proportional seat cap is a central modeling decision. It is deliberately included to ensure coalitions cannot claim more than their fair share of seats, consistent with the proportional-representation motivation of multi-winner voting. In the revised manuscript we will add to §2 an explicit counter-example (four voters, three candidates, k=2, AV utilities) demonstrating that, once the cap is removed, a coalition of size two can propose a committee of size three and redistribute utility to block every grand-coalition vector, rendering the TU-core empty. This counter-example justifies retaining the cap and shows that the non-emptiness results are specific to the proportional-share restriction.","revision_made":"yes","referee_comment":"§2 (game definition) and blocking condition: the proportional seat cap is built directly into the admissible committees a coalition may propose. The manuscript should supply either a proof that non-emptiness survives removal of the cap or an explicit counter-example profile in which the TU-core becomes empty once coalitions may propose larger committees and redistribute utility. This is load-bearing for the central existence claims."},{"response":"We apologize for the lack of clarity in the excerpt. The full manuscript contains the following statements: Theorem 4.1 asserts that the TU-core is always non-empty under SAV (and likewise under CC) for every approval profile, proved by exhibiting an equal redistribution of the coalition’s total satisfaction that cannot be blocked; for AV and PAV we give polynomial-time algorithms that either output a core vector or certify emptiness. We will revise the abstract and the opening of §4 to state these claims verbatim, include short proof sketches in the main text, and add a remark clarifying that the proofs rely on the seat cap while the counter-example added to §2 shows that the cap is necessary for the existence results.","revision_made":"yes","referee_comment":"TU-core results (likely §4–5): the abstract states that core existence and computation are analyzed for AV, SAV, CC and PAV, yet the precise statements (e.g., “the TU-core is always non-empty under SAV”) and the corresponding proofs or algorithms are not visible in the provided excerpt. Each rule’s claim must be stated with its exact hypothesis and proof sketch so that the reader can verify independence from the seat-cap modeling choice."}],"tokens_in":1578,"tokens_out":542,"duration_ms":47031,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The key point is that this paper sets up multi-winner voting as a cooperative game with both transferable and non-transferable utility versions, then checks when the core stays non-empty for four common rules. The NTU side lines up with the core-stable committees from Aziz et al., while the TU side lets coalitions split total utility from an admissible committee. That unification and the TU extension look like the main new pieces. They also compare existence and computation across AV, SAV, CC, and PAV, which gives a clean side-by-side view. The framework stays close to the voting rules by deriving utilities directly from them and by capping coalitions at their proportional share of seats. That cap is explicit and matches prior NTU work, so the positive results are at least consistent with what was already known for PAV. The modeling is straightforward and the comparisons are systematic, which makes the contribution easy to place. The main limitation is how much the seat cap is doing the heavy lifting. If coalitions could propose larger committees, blocking power would rise and some of the non-emptiness claims might not hold. The paper does not appear to test that relaxation, so the results are tied to this modeling choice. Computation results are mentioned but seem to focus on complexity rather than practical algorithms. Readers already working on core stability or cooperative aspects of voting will find the most value here. The paper is coherent on its own terms and engages the right literature, so it is worth sending to referees even if revisions are needed on the robustness of the cap.","headline":"They introduce a TU core for multi-winner voting games and check non-emptiness for AV, SAV, CC, and PAV under proportional seat caps on coalitions.","tokens_in":2556,"tokens_out":385,"would_cite":false,"duration_ms":24108,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[{"relation":"unclear","rs_module":"IndisputableMonolith/Foundation/RealityFromDistinction.lean","rs_theorem":"reality_from_one_distinction","paper_passage":"We introduce multi-winner voting games... Each coalition has a proportional seat cap and may only propose admissible committees up to that size... TUρ-χ(V′)≔max... scρ(V′,W′)"},{"relation":"unclear","rs_module":"IndisputableMonolith/Foundation/ArithmeticFromLogic.lean","rs_theorem":"LogicNat recovery and embed_strictMono","paper_passage":"For AV and SAV, we show that the TU-core is always non-empty... via the Bondareva–Shapley theorem"}],"headline":"Multi-winner voting core analysis in TU/NTU games has no structural overlap with RS forcing chain","alignment":"orthogonal","rationale":"The paper defines cooperative games over voter coalitions with proportional seat caps (|S|·k/n), admissible committees, and blocking conditions under AV/SAV/CC/PAV scoring rules. Core non-emptiness and membership results (e.g., TU-core always nonempty for totally separable rules via Bondareva-Shapley + Algorithm 1; NTU-CC equivalent to JR via Proposition 4) rely on combinatorial optimization and linear programming over approval profiles. No recognition cost J(x), golden-ratio ladder, 8-tick periodicity, or parameter-free derivation of constants appears; the framework is standard algorithmic game theory with no connection to the distinction-to-spacetime forcing in reality_from_one_distinction.","tokens_in":69111,"confidence":"high","tokens_out":369,"duration_ms":11844,"cache_read_input_tokens":38528,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Multi-winner voting games show the core is always non-empty for AV, SAV, CC, and PAV under both TU and NTU models.","keywords":["multi-winner voting","core stability","cooperative games","approval voting","TU and NTU models","proportional representation"],"falsifier":"An election instance together with a coalition whose proportional share permits an admissible committee that strictly raises every member's utility (after redistribution in the TU case), showing the core is empty for that rule.","tokens_in":2770,"feed_emoji":"🗳","tokens_out":710,"duration_ms":58514,"temperature":0.7,"pith_summary":"The paper introduces multi-winner voting games as a cooperative game framework in which voters form coalitions with proportional seat caps and can only propose committees up to that size. It distinguishes the transferable utility model, where a coalition can redistribute total utility, from the non-transferable utility model, where each coalition must use utility vectors realized exactly by some admissible committee. When the non-transferable model is paired with standard approval utilities and the PAV rule, the resulting core matches the core-stable committee notion from earlier work, while the transferable utility core is new. The authors then examine existence and computation of the core for the four rules Approval Voting, Satisfaction Approval Voting, Chamberlin-Courant, and Proportional Approval Voting. A sympathetic reader cares because the framework supplies a unified language for asking whether any group of voters can strictly improve by choosing its own smaller committee.","feed_headline":"Core always non-empty for standard multi-winner rules","feed_subtitle":"TU and NTU games with proportional caps unify stability checks for AV, SAV, CC, and PAV.","key_machinery":"Multi-winner voting games with proportional seat caps on coalitions and admissible committees that induce utility vectors, analyzed separately in the transferable-utility model (redistribution allowed) and non-transferable-utility model (utilities fixed by the committee).","core_discovery":"By defining multi-winner voting games in which each coalition is limited to admissible committees of size at most its proportional share, the paper establishes that the NTU-core under PAV with approval utilities is equivalent to the core-stable committee concept studied previously, introduces the TU-core as a new object, and analyzes core existence and computation for AV, SAV, CC, and PAV.","pith_inferences":["The same game construction could be applied to other multi-winner rules beyond the four examined here.","The distinction between TU and NTU cores may help compare stability guarantees across different committee-selection settings such as participatory budgeting.","Polynomial-time algorithms for core computation, if they exist for some rules, would immediately yield practical methods for finding stable committees."],"forward_implications":["The NTU-core with PAV reproduces the core-stable committees of prior work.","The TU-core supplies a distinct stability notion in which coalitions may share utility.","Core existence and computation admit separate treatment for each of AV, SAV, CC, and PAV.","A core outcome for the grand coalition is stable against all smaller coalitions under the proportional-size restriction."],"fun_headline_variants":["Core always non-empty in TU and NTU multi-winner games","Non-empty cores for AV SAV CC and PAV rules","Proportional caps yield non-empty cores in voting games","TU and NTU cores non-empty under standard multi-winner rules"],"cache_read_input_tokens":64,"weakest_assumption_plain":"Every coalition is restricted to admissible committees of size at most its proportional share and utilities are derived directly from the chosen multi-winner rule.","fun_headline_variants_meta":{"raw":{"variants":["Core always non-empty in TU and NTU multi-winner games","Non-empty cores for AV SAV CC and PAV rules","Proportional caps yield non-empty cores in voting games","TU and NTU cores non-empty under standard multi-winner rules"]},"model":"grok-4.3","cost_usd":0.01033,"raw_usage":{"total_tokens":4551,"prompt_tokens":784,"num_sources_used":0,"completion_tokens":68,"cost_in_usd_ticks":103303000,"prompt_tokens_details":{"text_tokens":784,"audio_tokens":0,"image_tokens":0,"cached_tokens":64},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":3699,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":784,"tokens_out":68,"duration_ms":41775,"temperature":1.0,"reasoning_tokens":3699,"cache_read_input_tokens":64,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-22T01:48:55.146204+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An election instance together with a coalition whose proportional share permits an admissible committee that strictly raises every member's utility (after redistribution in the TU case), showing the core is empty for that rule.","supporting_citations":[],"review_version":1}