402 research outputs found
The Complexity of Online Manipulation of Sequential Elections
Most work on manipulation assumes that all preferences are known to the
manipulators. However, in many settings elections are open and sequential, and
manipulators may know the already cast votes but may not know the future votes.
We introduce a framework, in which manipulators can see the past votes but not
the future ones, to model online coalitional manipulation of sequential
elections, and we show that in this setting manipulation can be extremely
complex even for election systems with simple winner problems. Yet we also show
that for some of the most important election systems such manipulation is
simple in certain settings. This suggests that when using sequential voting,
one should pay great attention to the details of the setting in choosing one's
voting rule. Among the highlights of our classifications are: We show that,
depending on the size of the manipulative coalition, the online manipulation
problem can be complete for each level of the polynomial hierarchy or even for
PSPACE. We obtain the most dramatic contrast to date between the
nonunique-winner and unique-winner models: Online weighted manipulation for
plurality is in P in the nonunique-winner model, yet is coNP-hard (constructive
case) and NP-hard (destructive case) in the unique-winner model. And we obtain
what to the best of our knowledge are the first P^NP[1]-completeness and
P^NP-completeness results in the field of computational social choice, in
particular proving such completeness for, respectively, the complexity of
3-candidate and 4-candidate (and unlimited-candidate) online weighted coalition
manipulation of veto elections.Comment: 24 page
On the Hardness of Bribery Variants in Voting with CP-Nets
We continue previous work by Mattei et al. (Mattei, N., Pini, M., Rossi, F.,
Venable, K.: Bribery in voting with CP-nets. Ann. of Math. and Artif. Intell.
pp. 1--26 (2013)) in which they study the computational complexity of bribery
schemes when voters have conditional preferences that are modeled by CP-nets.
For most of the cases they considered, they could show that the bribery problem
is solvable in polynomial time. Some cases remained open---we solve two of them
and extend the previous results to the case that voters are weighted. Moreover,
we consider negative (weighted) bribery in CP-nets, when the briber is not
allowed to pay voters to vote for his preferred candidate.Comment: improved readability; identified Cheapest Subsets to be the
enumeration variant of K.th Largest Subset, so we renamed it to K-Smallest
Subsets and point to the literatur; some more typos fixe
Reforming Legislatures: Is one House better than two?
During the last decade unicameral proposals have been put forward in fourteen US states. In this paper we propose a theoretical framework casting some lights on the drawbacks of bicameral state legislatures and on the effects of the proposed constitutional reforms. In a setting where lawmakers interact with a lobby through a bargaining process and with voters by means of elections, we show that when time constraints are binding, bicameralism might lead to a decline in the legislator's bargaining power vis-Ă -vis the lobby and to a reduction in his electoral accountability. On the other hand, when the time constraint is not binding, bicameralism might improve electoral accountability. Hence, arguments suggesting that bicameralism is a panacea against the abuse of power by elected legislators should be taken with due caution and the proposed unicameral reforms in US states may indeed reduce corruption levels among elected representatives.bicameralism, corruption, lobbying, bargaining, elections
The Least-core and Nucleolus of Path Cooperative Games
Cooperative games provide an appropriate framework for fair and stable profit
distribution in multiagent systems. In this paper, we study the algorithmic
issues on path cooperative games that arise from the situations where some
commodity flows through a network. In these games, a coalition of edges or
vertices is successful if it enables a path from the source to the sink in the
network, and lose otherwise. Based on dual theory of linear programming and the
relationship with flow games, we provide the characterizations on the CS-core,
least-core and nucleolus of path cooperative games. Furthermore, we show that
the least-core and nucleolus are polynomially solvable for path cooperative
games defined on both directed and undirected network
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates
Many electoral bribery, control, and manipulation problems (which we will
refer to in general as "manipulative actions" problems) are NP-hard in the
general case. It has recently been noted that many of these problems fall into
polynomial time if the electorate is single-peaked (i.e., is polarized along
some axis/issue). However, real-world electorates are not truly single-peaked.
There are usually some mavericks, and so real-world electorates tend to merely
be nearly single-peaked. This paper studies the complexity of
manipulative-action algorithms for elections over nearly single-peaked
electorates, for various notions of nearness and various election systems. We
provide instances where even one maverick jumps the manipulative-action
complexity up to \np-hardness, but we also provide many instances where a
reasonable number of mavericks can be tolerated without increasing the
manipulative-action complexity.Comment: 35 pages, also appears as URCS-TR-2011-96
A General Bargaining Model of Legislative Policy-making
We present a general model of legislative bargaining in which the status quo is an arbitrary point in a multidimensional policy space. In contrast to other bargaining models, the status quo is not assumed to be bad for all legislators, and delay may be Pareto efficient. We prove existence of stationary equilibria. We show that if all legislators are risk averse or if even limited transfers are possible, then delay is only possible if the status quo lies in the core. Thus, we expect immediate agreement in multidimensional models, where the core is typically empty. In one dimension, delay is possible if and only if the status quo lies in the core of the voting rule, and then it is the only possible outcome. Our comparative statics analysis yield two noteworthy insights: moderate status quos imply moderate policy outcomes, and legislative patience implies policy moderation
Recommended from our members
Veto players and equilibrium uniqueness in the Baron-Ferejohn model
In political economy, the seminal contribution of the Baron–Ferejohn bargaining model constitutes an important milestone for the study of legislative policy making. In this paper, we analyze a particular equilibrium characteristic of this model, equilibrium uniqueness. The Baron–Ferejohn model yields a class of payoff-unique stationary subgame perfect equilibria (SSPE) in which players’ equilibrium strategies are not uniquely determined. We first provide a formal proof of the multiplicity of equilibrium strategies. This also enables us to establish some important properties of SSPE. We then introduce veto players into the original Baron–Ferejohn model. We state the conditions under which the new model has a unique SSPE not only in terms of payoffs but also in terms of players’ equilibrium strategies
- …