One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland score of a node in a digraph is the difference between its outdegree (i.e. its number of outgoing arcs) and its indegree (i.e. its number of ingoing arcs). In the ranking by Copeland score, a node...

A ranking method assigns to every weighted directed graph a (weak) orderingof the nodes. In this paper we axiomatize the ranking method that ranksthe nodes according to their outflow using four independent axioms. This outflowranking method generalizes the ranking by outdegree for directed...

In experimental investigations of the effect of real incentives, accountability-the implicit or explicit expectation of a decision maker that she may have to justify her decisions in front of somebody else-is often confounded with the incentives themselves. This confounding of accountability...

Interest groups are introduced in a spatial model of electoral competition between two political parties. We show that, by coordinating voting behavior,these interest groups increase the winning set, which is defined as the set of policy platforms for the challenger that will defeat the...

Interest groups are introduced in a spatial model of electoral competition between two political parties. We show that the presence of these interest groups increases the winning set, which is the set of policy platforms for the challenger that will defeat the incumbent. Therefore interest...

This paper presents a study on the recently proposed linear inequality representation of Arrovian Social Welfare Functions (ASWFs). We first give an alternative proof of the ASWF integer linear inequality representation theorem, and then show several sufficient conditions on preference domains...