Felix Brandt
Datos Biográficos
| ID | 4385985 |
|---|---|
| NOMBRE | Felix Brandt |
| NOMBRES | Felix |
| APELLIDO | Brandt |
| FIRMA | BRANDT F |
| AFILIACIONES | Technical University of Munich |
| ORCID | 0000-0002-4179-9897 |
| VERIFICADO | Sí |
| TOTAL DE OBRAS | 11 |
| TOTAL DE CITAS | 3 |
| TOTAL COMO AUTOR | 11 |
| TOTAL COMO EDITOR | 0 |
| PRIMER AÑO DE PUBLICACIÓN | 2008 |
| AÑO MÁS RECIENTE DE PUBLICACIÓN | 2026 |
| ÍNDICE H | 1 |
The Banks set and the bipartisan set may be disjoint
Tournament solutions play an important role within social choice theory and the mathematical social sciences at large. We construct a tournament of order 36 that can be partitioned into the Banks set and the bipartisan set. As a consequence, the Banks set, as well as its refinements, such as the minimal extending set and the tournament equilibrium set, can be disjoint from the bipartisan set
On locally rationalizable social choice functions
We consider a notion of rationalizability, where the rationalizing relation may depend on the set of feasible alternatives. More precisely, we say that a choice function is locally rationalizable if it is rationalized by a family of rationalizing relations such that a strict preference between two alternatives in some feasible set is preserved when removing other alternatives. It is known that a choice function is locally rationalizable if and on…
Special Issue on Fair Public Decision Making
Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes
Social decision schemes (SDSs) map the preferences of a group of voters over some set of m alternatives to a probability distribution over the alternatives. A seminal characterization of strategyproof SDSs by Gibbard (Econometrica 45(3):665–681, 1977) implies that there are no strategyproof Condorcet extensions and that only random dictatorships satisfy ex post efficiency and strategyproofness. The latter is known as the random dictatorship theor…
An analytical and experimental comparison of maximal lottery schemes
Maximal lottery ( $$ ML $$ ML ) schemes constitute an interesting class of randomized voting rules that were proposed by Peter Fishburn in 1984 and have been repeatedly recommended for practical use. However, the subtle differences between different $$ ML $$ ML schemes are often overlooked. Two canonical subsets of $$ ML $$ ML schemes are "Image missing"schemes (which only depend on unweighted majority comparisons) and "Image missing"schemes (whi…
Minimal voting paradoxes
Voting paradoxes date back to the origin of social choice theory in the 18th century, when the Chevalier de Borda pointed out that plurality—then and now the most common voting rule—may elect a candidate who loses pairwise majority comparisons against every other candidate. Since then, a large number of similar, seemingly paradoxical, phenomena have been observed in the literature. As it turns out, many paradoxes only materialize under some rathe…
Optimal bounds for the no-show paradox via SAT solving
Minimal extending sets in tournaments
Special Issue on Computational Foundations of Social Choice
Computing the minimal covering set
Fractional hedonic games
An important issue in multi-agent systems is the exploitation of synergies via coalition formation. We initiate the formal study of fractional hedonic games. In fractional hedonic games, the utility of a player in a coalition structure is the average value he ascribes to the members of his coalition. Among other settings, this covers situations in which there are several types of agents and each agent desires to be in a coalition in which the fra…
Computing the minimal covering set
Special Issue on Computational Foundations of Social Choice
Optimal bounds for the no-show paradox via SAT solving
Minimal extending sets in tournaments
An analytical and experimental comparison of maximal lottery schemes
Maximal lottery ( $$ ML $$ ML ) schemes constitute an interesting class of randomized voting rules that were proposed by Peter Fishburn in 1984 and have been repeatedly recommended for practical use. However, the subtle differences between different $$ ML $$ ML schemes are often overlooked. Two canonical subsets of $$ ML $$ ML schemes are "Image missing"schemes (which only depend on unweighted majority comparisons) and "Image missing"schemes (whi…
Minimal voting paradoxes
Voting paradoxes date back to the origin of social choice theory in the 18th century, when the Chevalier de Borda pointed out that plurality—then and now the most common voting rule—may elect a candidate who loses pairwise majority comparisons against every other candidate. Since then, a large number of similar, seemingly paradoxical, phenomena have been observed in the literature. As it turns out, many paradoxes only materialize under some rathe…
Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes
Social decision schemes (SDSs) map the preferences of a group of voters over some set of m alternatives to a probability distribution over the alternatives. A seminal characterization of strategyproof SDSs by Gibbard (Econometrica 45(3):665–681, 1977) implies that there are no strategyproof Condorcet extensions and that only random dictatorships satisfy ex post efficiency and strategyproofness. The latter is known as the random dictatorship theor…
Fractional hedonic games
An important issue in multi-agent systems is the exploitation of synergies via coalition formation. We initiate the formal study of fractional hedonic games. In fractional hedonic games, the utility of a player in a coalition structure is the average value he ascribes to the members of his coalition. Among other settings, this covers situations in which there are several types of agents and each agent desires to be in a coalition in which the fra…
Special Issue on Fair Public Decision Making
The Banks set and the bipartisan set may be disjoint
Tournament solutions play an important role within social choice theory and the mathematical social sciences at large. We construct a tournament of order 36 that can be partitioned into the Banks set and the bipartisan set. As a consequence, the Banks set, as well as its refinements, such as the minimal extending set and the tournament equilibrium set, can be disjoint from the bipartisan set
On locally rationalizable social choice functions
We consider a notion of rationalizability, where the rationalizing relation may depend on the set of feasible alternatives. More precisely, we say that a choice function is locally rationalizable if it is rationalized by a family of rationalizing relations such that a strict preference between two alternatives in some feasible set is preserved when removing other alternatives. It is known that a choice function is locally rationalizable if and on…
Computer Science (9 obras) · Game Theory and Voting Systems (9 obras) · Mathematics (9 obras) · Mathematical economics (7 obras) · Economics (6 obras) · Social choice theory (6 obras) · Discrete mathematics (5 obras) · Political science (5 obras) · Auction Theory and Applications (4 obras) · Game Theory and Applications (4 obras)