A solution for abstract decision problems based on maximum flow value

DOI10.1016/J.MATHSOCSCI.2024.05.003MaRDI QIDQ6589395zbMATH OpenFDO

Authors Michele Gori

Publication date 19 August 2024

Published in Mathematical Social Sciences (Search for Journal in Brave)

zbMATH Keywords

maximum flowadmissible setabstract decision problemCopeland setgeneralized stable setCopeland method

Mathematics Subject Classification ID

Decision theory (91B06) Social choice (91B14)

Recommendations

• Families of abstract decision problems whose admissible sets intersect in a singleton
• On the solution of \(w\)-stable sets
• The solution of generalized stable sets and its refinement
• A note on extended stable sets
• More on the stable, generalized stable, absorbing and admissible sets

Cites work

• scientific article; zbMATH DE number 1600673 (Why is no real title available?)
• scientific article; zbMATH DE number 3864918 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• A dynamic solution concept for abstract games
• A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method
• A note on generalized stable sets
• A reformulation of von Neumann-Morgenstern stability: \(m\)-stability
• Aggregation of Preferences with Variable Electorate
• An admissible set occurring in various bargaining situations
• Choosing from a tournament
• Collective Choice Correspondences as Admissible Outcomes of Social Bargaining Processes
• Condorcet Social Choice Functions
• Condorcet choice correspondences for weak tournaments
• Connectivity in digraphs
• Consequences of reversing preferences
• Extending tournament solutions
• Families of abstract decision problems whose admissible sets intersect in a singleton
• Independence of clones as a criterion for voting rules
• Introduction to the theory of voting
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• On coalition formation: A game-theoretical approach
• On the solution of \(w\)-stable sets
• Possible and necessary winners of partial tournaments
• Stable sets and standards of behaviour
• The Copeland choice function. An axiomatic characterization
• The Copeland method. I: Relationships and the dictionary
• The Copeland rule and Condorcet's principle
• The flow network method
• Tournament solutions
• Tournament solutions and majority voting
• Uncovered sets

This page was built for publication: A solution for abstract decision problems based on maximum flow value

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589395)