We study the existence of undominated elements of acyclic and irreflexive relations. A sufficient condition for the existence is given in the general case without any topological assumptions. Sufficient conditions are also given when the relation in question is defined on a compact Hausdorff...

Some solution concepts for n -person games admit a recursive definition. In such a recursion, the solution of an n -person game is computed by using the knowledge of how some of the proper subgames of a given game have been solved. While these kind of recursion formulas are of course...

We introduce and analyze the following variants of the Borda rule: median Borda rule,geometric Borda rule, Litvak’s method as well as methods based on forming linear combinations of entries in the preference outranking matrix. The properties we focus upon are the elimination of the Condorcet...

We study the existence of undominated elements of acyclic relations. A sufficient condition for the existence is given without any topological assumptions when the dominance relation is finite valued. The condition says that there is a point such that all dominance sequences starting from this...

We construct a centralised market where agents can trade voting rights. Text book markets do not work but the situation is strategic, and there are many equilibria. In an equilibrium where trading takes place the minimum efficiency gain, i.e. the probability with which an efficient outcome is...