Core thresholds of symmetric majority voting games

Takaaki Abe

Games and Economic Behavior, 2025, vol. 152, issue C, 199-215

Abstract: We consider a committee that consists of n members with one person one vote approving a proposal if the number of affirmative votes from the members reaches threshold k. Which threshold k between 1 and n is “stable” for the committee? We suppose that if a new threshold k' proposed by some committee members obtains k or more affirmative votes, then the new threshold replaces the current one. Assuming that each member has preferences for the set of possible thresholds, we analyze which threshold meets the stability requirements of the core and stable sets. In addition, based on our stability study, we argue that a committee needs to employ two distinct thresholds: one for ordinary issues and another just for threshold changes. To embody this idea, we propose a method, called the constant threshold method, and show that our method always generates a nonempty refinement of the core. We also provide an axiomatic characterization of our method.

Keywords: Core; Stable set; Threshold; Voting (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825625000600
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:152:y:2025:i:c:p:199-215

DOI: 10.1016/j.geb.2025.04.009

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().