scholarly journals Winner Determination and Strategic Control in Conditional Approval Voting

2021 ◽  
Author(s):  
Evangelos Markakis ◽  
Georgios Papasotiropoulos
Keyword(s):  
Computational Complexity ◽  
Polynomial Algorithms ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Strategic Control ◽  
Approval Voting ◽  
Winner Determination ◽  
Bounded Treewidth ◽  
Voting Rule ◽  
Necessary And Sufficient

Our work focuses on a generalization of the classic Minisum approval voting rule, introduced by Barrot and Lang (2016), and referred to as Conditional Minisum (CMS), for multi-issue elections. Although the CMS rule provides much higher levels of expressiveness, this comes at the expense of increased computational complexity. In this work, we study further the issue of efficient algorithms for CMS, and we identify the condition of bounded treewidth (of an appropriate graph that emerges from the provided ballots), as the necessary and sufficient condition for polynomial algorithms, under common complexity assumptions. Additionally we investigate the complexity of problems related to the strategic control of such elections by the possibility of adding or deleting either voters or alternatives. We exhibit that in most variants of these problems, CMS is resistant against control.

scholarly journals Cycles and Intractability in a Large Class of Aggregation Rules

2018 ◽  
Vol 61 ◽  
pp. 407-431 ◽  
Author(s):  
William S. Zwicker
Keyword(s):  
Computational Complexity ◽  
Related Problem ◽  
Borda Count ◽  
Impossibility Theorem ◽  
Approval Voting ◽  
Winner Determination ◽  
Voting Rule ◽  
Special Cases ◽  
The Mean ◽  
Cyclic Part

We introduce the (j,k)-Kemeny rule -- a generalization of Kemeny's voting rule that aggregates j-chotomous weak orders into a k-chotomous weak order. Special cases of (j,k)-Kemeny include approval voting, the mean rule and Borda mean rule, as well as the Borda count and plurality voting. Why, then, is the winner problem computationally tractable for each of these other rules, but intractable for Kemeny? We show that intractability of winner determination for the (j,k)-Kemeny rule first appears at the j=3, k=3 level. The proof rests on a reduction of max cut to a related problem on weighted tournaments, and reveals that computational complexity arises from the cyclic part in the fundamental decomposition of a weighted tournament into cyclic and cocyclic components. Thus the existence of majority cycles -- the engine driving both Arrow's impossibility theorem and the Gibbard-Satterthwaite theorem -- also serves as a source of computational complexity in social choice.

A Proposed Framework Emphasizing Auditor Reliability over Auditor Independence

2003 ◽  
Vol 17 (3) ◽  
pp. 257-266 ◽  
Author(s):  
Mark H. Taylor ◽  
F. Todd DeZoort ◽  
Edward Munn ◽  
Martha Wetterhall Thomas
Keyword(s):  
Public Interest ◽  
Auditor Independence ◽  
Public Confidence ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Accounting Profession ◽  
The Public ◽  
Necessary And Sufficient

This paper introduces an auditor reliability framework that repositions the role of auditor independence in the accounting profession. The framework is motivated in part by widespread confusion about independence and the auditing profession's continuing problems with managing independence and inspiring public confidence. We use philosophical, theoretical, and professional arguments to argue that the public interest will be best served by reprioritizing professional and ethical objectives to establish reliability in fact and appearance as the cornerstone of the profession, rather than relationship-based independence in fact and appearance. This revised framework requires three foundation elements to control subjectivity in auditors' judgments and decisions: independence, integrity, and expertise. Each element is a necessary but not sufficient condition for maximizing objectivity. Objectivity, in turn, is a necessary and sufficient condition for achieving and maintaining reliability in fact and appearance.

The Power of Public Positions

2018 ◽  
Author(s):  
Thomas Sinclair
Keyword(s):  
Detailed Analysis ◽  
Political Authority ◽  
The State ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
State Institutions ◽  
State Of Nature ◽  
Necessary And Sufficient

The Kantian account of political authority holds that the state is a necessary and sufficient condition of our freedom. We cannot be free outside the state, Kantians argue, because any attempt to have the “acquired rights” necessary for our freedom implicates us in objectionable relations of dependence on private judgment. Only in the state can this problem be overcome. But it is not clear how mere institutions could make the necessary difference, and contemporary Kantians have not offered compelling explanations. A detailed analysis is presented of the problems Kantians identify with the state of nature and the objections they face in claiming that the state overcomes them. A response is sketched on behalf of Kantians. The key idea is that under state institutions, a person can make claims of acquired right without presupposing that she is by nature exceptional in her capacity to bind others.

scholarly journals Lorentz Boosts and Wigner Rotations: Self-Adjoint Complexified Quaternions

Physics ◽  
2021 ◽  
Vol 3 (2) ◽  
pp. 352-366
Author(s):  
Thomas Berry ◽  
Matt Visser
Keyword(s):  
Point Of View ◽  
Sufficient Condition ◽  
Use Of Self ◽  
Necessary And Sufficient Condition ◽  
Wigner Rotation ◽  
Inertial Frames ◽  
Explicit Formulae ◽  
Specific Implementation ◽  
Necessary And Sufficient ◽  
Lorentz Boosts

In this paper, Lorentz boosts and Wigner rotations are considered from a (complexified) quaternionic point of view. It is demonstrated that, for a suitably defined self-adjoint complex quaternionic 4-velocity, pure Lorentz boosts can be phrased in terms of the quaternion square root of the relative 4-velocity connecting the two inertial frames. Straightforward computations then lead to quite explicit and relatively simple algebraic formulae for the composition of 4-velocities and the Wigner angle. The Wigner rotation is subsequently related to the generic non-associativity of the composition of three 4-velocities, and a necessary and sufficient condition is developed for the associativity to hold. Finally, the authors relate the composition of 4-velocities to a specific implementation of the Baker–Campbell–Hausdorff theorem. As compared to ordinary 4×4 Lorentz transformations, the use of self-adjoint complexified quaternions leads, from a computational view, to storage savings and more rapid computations, and from a pedagogical view to to relatively simple and explicit formulae.

Sign in / Sign up

Export Citation Format

Share Document