The vetoers in a simple game with ordinal preferences

From MaRDI portal
Publication:754097

DOI10.1007/BF01763051zbMath0415.90087WikidataQ56460168 ScholiaQ56460168MaRDI QIDQ754097

D. Kharzeev

Publication date: 1979

Published in: International Journal of Game Theory (Search for Journal in Brave)




Related Items

Revealed votesPermutation cycles and manipulation of choice functionsON THE CHACTERISTIC NUMBERS OF VOTING GAMESStructural instability of the coreA Model of Consensus and Consensus Building Within the Framework of Committees with Permissible Ranges of Decision MakersThe ``probability of a fit choiceOn the core of voting gamesCores and capacities of compound simple gamesThe Core of Voting Games: A Partition ApproachOn the core and bargaining set of a veto gameA note on the non-emptiness of the stability set when individual preferences are weak ordersThe legislative calendarCommittees with farsighted voters: A new interpretation of stable setsThe Nakamura theorem for coalition structures of quota gamesSelf-consistency of decision rules for group decision makingCommittees under qualified majority rules: the one-core stability indexStability and efficiency in perfect foresight situationVoting games and acyclic collective choice rulesA dynamic multi-player bargaining game with veto playersA note on balancedness and nonemptiness of the core in voting gamesSmooth social choiceBinary effectivity rulesBounds for the Nakamura numberCoalitional strategic gamesExpert advice to a voting bodySupermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromiseStability and index of the meet game on a latticeRepresentation of characteristic function games by social choice functionsThe strategy-proof social choice functionsThe structure of unstable power mechanismsBinary games in constitutional form and collective choiceCores of effectivity functions and implementation theoryNote on the core and compensation in collective choiceQuota games and stability set of order \(d\)Retrospective survey: Kenjiro Nakamura (1947-1979)Cooperation, stability and social welfare under majority ruleSocial choice without the Pareto principle: a comprehensive analysisVetoer and tie-making group theorems for indifference-transitive aggregation rulesUnifying voting theory from Nakamura's to Greenberg's theoremsConditions on social-preference cyclesPositional rules and \(q\)-Condorcet consistencyExistence of a multicameral coreAcyclicity, anonymity, and prefiltersExplaining All Possible Paired Comparison ProblemsCoalitions and Catastrophic Climate ChangeA procedural condition necessary and sufficient for cyclic social preferenceProbability and convergence for supra-majority rule with Euclidean preferencesProduct filters, acyclicity and suzumura consistencyCollective choice rules and collective rationality: a unified method of characterizationsPreference aggregation theory without acyclicity: the core without majority dissatisfactionComputability of simple games: A characterization and application to the coreGabrielle DemangeA stability index for local effectivity functionsOn the equilibrium of voting games with abstention and several levels of approvalStable voting procedures for committees in economic environmentsThe stability of decision making in committees: the one-coreA core of voting games with improved foresightVoting games of resolute social choice correspondencesNecessary and sufficient conditions for l-stability of games in constitutional formOn some combinatorial problems arising in the theory of voting gamesDominance in spatial voting with imprecise idealsA brief history of social choice and welfare theoryA note on the core of voting gamesThe Nakamura numbers for computable simple gamesDecomposable effectivity functionsInteraction sheaves on continuous domainsSOCIAL CHOICE AND COOPERATIVE GAME THEORY: VOTING GAMES AS SOCIAL AGGREGATION FUNCTIONSSocial equilibrium and cycles on compact setsPower structure and cardinality restrictions for Paretian social choice rulesClassification theorem for smooth social choice on a manifoldThe stability set of voting games: Classification and genericity results\(F\)-decomposable social aggregation rules and acyclic choiceThe general relevance of the impossibility theorem in smooth social choiceMajority properties of positional social preference correspondencesThe stability set as a social choice correspondence.Computational complexity in the design of voting rules



Cites Work