The concept of program equilibrium, introduced by Howard (Theory and Decision 24(3):203–213, <CitationRef CitationID="CR13">1988</CitationRef>) and further formalised by Tennenholtz (Game Econ Behav 49:363–373, <CitationRef CitationID="CR19">2004</CitationRef>), represents one of the most ingenious and potentially far-reaching applications of ideas from computer science in game...</citationref></citationref>

<Para ID="Par1">An alternative is said to be a Condorcet winner of an election if it is preferred to any other alternative by a majority of voters. While this is a very attractive solution concept, many elections do not have a Condorcet winner. In this paper, we propose a set-valued relaxation of this concept,...</para>

In voting contexts, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed number k of new candidates will be added. We give a computational study of this problem, focusing on...