pref_voting 1.17.3__py3-none-any.whl → 1.17.4__py3-none-any.whl

pref_voting/__init__.py

@@ -1 +1 @@
-__version__ = '1.17.3'
+__version__ = '1.17.4'

pref_voting/variable_voter_axioms.py

@@ -3349,6 +3349,8 @@ participation = Axiom(
 
 def has_single_voter_resolvability_violation(prof, vm, verbose=False):
     """
+    Single-Voter Resolvability requires that for any profile with multiple winners, each of the tied winners can be made the unique winner by adding a ballot (cf. Weak Single-Voter Resolvability, which only requires that at least one of the tied winners can be made the unique winner by adding a ballot).
+
     If prof is a Profile, returns True if there are multiple vm winners in prof and for one such winner A, there is no linear ballot that can be added to prof to make A the unique winner.
 
     If prof is a ProfileWithTies, returns True if there are multiple vm winners in prof and for one such winner A, there is no Ranking (allowing ties) that can be added to prof to make A the unique winner. 
@@ -3481,6 +3483,79 @@ single_voter_resolvability = Axiom(
     find_all_violations = find_all_single_voter_resolvability_violations, 
 )
 
+def has_weak_single_voter_resolvability_violation(prof, vm, verbose=False):
+    """
+    Weak Single-Voter Resolvability requires that for any profile with multiple winners, at least one of the tied winners can be made the unique winner by adding a ballot (cf. Single-Voter Resolvability, which requires that each of the tied winners can be made the unique winner by adding a ballot).
+
+    If prof is a Profile, returns True if there are multiple vm winners in prof and for every such winner A, there is no linear ballot that can be added to prof to make A the unique winner.
+
+    If prof is a ProfileWithTies, returns True if there are multiple vm winners in prof and for every such winner A, there is no Ranking (allowing ties) that can be added to prof to make A the unique winner. 
+
+    Args:
+        prof: a Profile or ProfileWithTies object.
+        vm (VotingMethod): A voting method to test.
+        verbose (bool, default=False): If a violation is found, display the violation.
+
+    Returns:
+        Result of the test (bool): Returns True if there is a violation and False otherwise.
+    """
+
+    winners = vm(prof)
+
+    if isinstance(prof,ProfileWithTies):
+        prof.use_extended_strict_preference()
+
+    if len(winners) > 1:
+        
+        for winner in winners:
+
+            found_voter_to_add = False
+
+            if isinstance(prof,Profile):
+                for r in permutations(prof.candidates):
+                    new_prof = Profile(prof.rankings + [r])
+                    if vm(new_prof) == [winner]:
+                        found_voter_to_add = True
+                        break
+                   
+            if isinstance(prof,ProfileWithTies):
+                for _r in weak_orders(prof.candidates):
+                    r = Ranking(_r)
+                    new_prof = ProfileWithTies(prof.rankings + [r], candidates = prof.candidates)
+                    new_prof.use_extended_strict_preference()
+                    if vm(new_prof) == [winner]:
+                        found_voter_to_add = True
+                        break
+        
+            if found_voter_to_add:
+                return False
+
+        # If we get here, no tied winner can be made the unique winner by adding a ballot.
+        if verbose:
+            prof = prof.anonymize()
+            if isinstance(prof,Profile):
+                print(f"Violation of Weak Single-Voter Resolvability for {vm.name}: no tied winner can be made the unique winner by adding a linear ballot.")
+            if isinstance(prof,ProfileWithTies):
+                print(f"Violation of Weak Single-Voter Resolvability for {vm.name}: no tied winner can be made the unique winner by adding a Ranking.")
+            print("")
+            print("Profile:")
+            prof.display()
+            print(prof.description())
+            print("")
+            vm.display(prof)
+            prof.display_margin_graph()
+            print("")
+            
+        return True
+    
+    return False
+
+weak_single_voter_resolvability = Axiom(
+    "Weak Single-Voter Resolvability",
+    has_violation = has_weak_single_voter_resolvability_violation,
+    find_all_violations = find_all_single_voter_resolvability_violations, 
+)
+
 def has_neutral_reversal_violation(prof, vm, verbose=False):
     """Returns True if adding a reversal pair of voters (a voter with ranking L and a voter with the reverse ranking L^{-1}) changes the winners.
     

{pref_voting-1.17.3.dist-info → pref_voting-1.17.4.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pref_voting
-Version: 1.17.3
+Version: 1.17.4
 Summary: pref_voting is a Python package that contains tools to reason about elections and margin graphs, and implementations of voting methods.
 License: MIT
 License-File: LICENSE.txt

{pref_voting-1.17.3.dist-info → pref_voting-1.17.4.dist-info}/RECORD

@@ -1,4 +1,4 @@
-pref_voting/__init__.py,sha256=ZZ4Gxrxa2VmqKgN3zByiksczrRQ-Wf-P_cRaNiLmZQg,23
+pref_voting/__init__.py,sha256=XgO41owLcnTb3OqCJa6A4mkFn86SBwVNf8AByqYm96I,23
 pref_voting/analysis.py,sha256=2YEWqTR6phI3sMIWh-tsm0QOmOgTszBwwUFrXvszrbg,21025
 pref_voting/axiom.py,sha256=aTON7iEnJywuMHwlNXsF-1KYVccMnylrzfnk52kJX6g,1270
 pref_voting/axiom_helpers.py,sha256=3APt16me9ZhA8K-GI0PYf9x_Cwe4N4Is1fyG8_jDA1o,3904
@@ -81,13 +81,13 @@ pref_voting/utility_functions.py,sha256=1gUWVRuoREt0GQm3kr2-2GvZaI7Lmiay_L_DnTlM
 pref_voting/utility_methods.py,sha256=qWP2Ks1NtAK38m79x6w1UFabdYR3jVpL5Flyzp1RSBE,7326
 pref_voting/utility_profiles.py,sha256=XhzV7axTpVK_jF7sadE8BFlnH-J7ng9XzqD-pY8DLDc,12992
 pref_voting/variable_candidate_axioms.py,sha256=av8Ug5Z6ijhWGUFdgwz1wtCNCtROJCtDmqSSpzsdu-c,31892
-pref_voting/variable_voter_axioms.py,sha256=BhMQTupdvKEeSGJEgwgj5_58wkSZNqbrEGep7HRZk98,195803
+pref_voting/variable_voter_axioms.py,sha256=-Q3D9Zt8wy_X16kKHV4PRM4Eq12m_svgeML6x8GZcbI,199297
 pref_voting/voting_method.py,sha256=rKM0GH-3d_1NHTJALQFblYG17sJTCFgvFis_zsRwMkI,13282
 pref_voting/voting_method_properties.py,sha256=xwYaiIXTS5JdqFP9LNqcpB7ANfA58vdxYOicAatuZHM,2680
 pref_voting/voting_methods.py,sha256=6dSuOoz8gMFlN6oN20p-C-iEnpQD_bZevVUGVZ1qntU,299
 pref_voting/voting_methods_registry.py,sha256=AoLxRDajlaJdnXKjpYlpnlEKWxCL4FBOyh40p_x-RBQ,5028
 pref_voting/weighted_majority_graphs.py,sha256=J_OoHcMSjvV97i-3VQ88oBUHgLWJa59mT8feh_gseHk,59095
-pref_voting-1.17.3.dist-info/METADATA,sha256=0lt-7wlJiFZXTiucwfv68jh4uZrTFTE5eb5Ah-XKjOo,8145
-pref_voting-1.17.3.dist-info/WHEEL,sha256=M5asmiAlL6HEcOq52Yi5mmk9KmTVjY2RDPtO4p9DMrc,88
-pref_voting-1.17.3.dist-info/licenses/LICENSE.txt,sha256=HrDgoFIL8aUJAoU2P4CmPR7XKaGq2Mq3arCYa2Jbjiw,1085
-pref_voting-1.17.3.dist-info/RECORD,,
+pref_voting-1.17.4.dist-info/METADATA,sha256=kKuViLggL3Se8cia78zi5KMpq-L9BvkS8X89k_ZiO3k,8145
+pref_voting-1.17.4.dist-info/WHEEL,sha256=M5asmiAlL6HEcOq52Yi5mmk9KmTVjY2RDPtO4p9DMrc,88
+pref_voting-1.17.4.dist-info/licenses/LICENSE.txt,sha256=HrDgoFIL8aUJAoU2P4CmPR7XKaGq2Mq3arCYa2Jbjiw,1085
+pref_voting-1.17.4.dist-info/RECORD,,