-
Article
On the structure of stable tournament solutions
A fundamental property of choice functions is stability, which, loosely speaking, prescribes that choice sets are invariant under adding and removing unchosen alternatives. We provide several structural insigh...
-
Article
Algorithmic Economics und Operations Research
Die Informatik hat viele Wissenschaften grundlegend beeinflusst, die Wirtschaftswissenschaften in besonders hohem Maße. Vor allem die enormen Fortschritte der Algorithmik und der mathematischen Optimierung hab...
-
Chapter
Algorithmic Economics und Operations Research
Die Informatik hat viele Wissenschaften grundlegend beeinflusst, die Wirtschaftswissenschaften in besonders hohem Maße. Vor allem die enormen Fortschritte der Algorithmik und mathematischen Optimierung habe...
-
Article
Constraint-based large neighborhood search for machine reassignment
This paper addresses a process-to-machine reassignment problem arising in cloud computing environments. The problem formulation has been posed as the ROADEF/EURO challenge 2012. Our presented approach is basic...
-
Chapter and Conference Paper
On the Discriminative Power of Tournament Solutions
Tournament solutions constitute an important class of social choice functions that only depend on the pairwise majority comparisons between alternatives. Recent analytical results have shown that several conce...
-
Article
A note on the McKelvey uncovered set and Pareto optimality
We consider the notion of Pareto optimality under the assumption that only the pairwise majority relation is known and show that the set of necessarily Pareto optimal alternatives coincides with the McKelvey u...
-
Article
Set-monotonicity implies Kelly-strategyproofness
This paper studies the strategic manipulation of set-valued social choice functions according to Kelly’s preference extension, which prescribes that one set of alternatives is preferred to another if and only ...
-
Article
Evaluation of the long-term behavior of potential plutonium waste forms in a geological repository
Various candidate waste matrices such as nuclear waste glasses, ceramic waste forms and low-specification “storage” MOX have been considered within the current UK geological disposal program for the immobiliza...
-
Article
Minimal retentive sets in tournaments
Tournament solutions, i.e., functions that associate with each complete and asymmetric relation on a set of alternatives a nonempty subset of the alternatives, play an important role in the mathematical social...
-
Article
A constraint programming-based approach to a large-scale energy management problem with varied constraints
This paper addresses a large-scale power plant maintenance scheduling and production planning problem, which has been proposed by the ROADEF/EURO Challenge 2010. We develop two lower bounds for the problem: a ...
-
Article
The Complexity of Computing Minimal Unidirectional Covering Sets
A common thread in the social sciences is to identify sets of alternatives that satisfy certain notions of stability according to some binary dominance relation. Examples can be found in areas as diverse as vo...
-
Article
On the Rate of Convergence of Fictitious Play
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the empirical frequencies of act...
-
Article
A counterexample to a conjecture of Schwartz
In 1990, motivated by applications in the social sciences, Thomas Schwartz made a conjecture about tournaments which would have had numerous attractive consequences. In particular, it implied that there is no ...
-
Chapter and Conference Paper
On Popular Random Assignments
One of the most fundamental and ubiquitous problems in microeconomics and operations research is how to assign objects to agents based on their individual preferences. An assignment is called popular if there ...
-
Chapter and Conference Paper
The Computational Complexity of Random Serial Dictatorship
In social choice settings with linear preferences, random dictatorship is known to be the only social decision scheme satisfying strategyproofness and ex post efficiency. When also allowing indifferences, random ...
-
Article
The Computational Complexity of Weak Saddles
We study the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. F. Brandt et al. recently gave a polynomial-time algorithm for computing weak saddles in a subcla...
-
Article
On the Complexity of Iterated Weak Dominance in Constant-Sum Games
In game theory, an action is said to be weakly dominated if there exists another action of the same player that, with respect to what the other players do, is never worse and sometimes strictly better. We inve...
-
Chapter and Conference Paper
From Arrow’s Impossibility to Schwartz’s Tournament Equilibrium Set
Perhaps the most influential result in social choice theory is Arrow’s impossibility theorem, which states that a seemingly modest set of desiderata cannot be satisfied when aggregating preferences [1]. While ...
-
Chapter and Conference Paper
Pareto Optimality in Coalition Formation
A minimal requirement on allocative efficiency in the social sciences is Pareto optimality. In this paper, we identify a far-reaching structural connection between Pareto optimal and perfect partitions that ha...
-
Article
Characterization of dominance relations in finite coalitional games
McGarvey (Econometrica, 21(4), 608–610, 1953) has shown that any irreflexive and anti-symmetric relation can be obtained as a relation induced by majority rule. We address the analogous issue for dominance rel...
