Searcharxiv⌕ Search

arXiv subjects

François Durand

Publications and source records attributed to François Durand.

13 recordsLinked to original sources

Which Voting Rules Are More Resilient to Coalitional Manipulation?

Which voting rules are more resilient to coalitional manipulation? We find that a deliberately minimal model, capturing only the degree of advantage of one preference ranking over the others, can predict their relative vulnerability remarkably well. Extending prior work on three rules, we systematically analyze all standard ordinal voting rules under the Perturbed Culture model, a variant of Impartial Culture parameterized by the extra weight assigned to one ranking. Each rule exhibits a sharp phase transition: manipulation succeeds with high probability below a critical concentration threshold, and fails above it. This structure reveals natural families of rules: seemingly distinct methods such as Maximin, Ranked Pairs, Schulze, and Young share identical thresholds, while Baldwin, Nanson, Kemeny, and Dodgson form another. These groupings are driven by new, strengthened notions of Condorcet winners. In addition, we identify a third family based on a previously introduced Condorcet notion: Black, Slater, and Copeland. Empirically, the model displays strong predictive power. Tested on real-world datasets (Netflix and FairVote), it accurately ranks rules by vulnerability, predicts how this ranking evolves with the number of candidates, and explains why empirically similar clusters persist despite large absolute differences in manipulation rates, with a more nuanced picture for Bucklin and veto-based rules. Thus, an extremely parsimonious model with no tuning captures the comparative vulnerability of voting rules: which rules to prefer depends largely on the number of candidates alone.

cs.GT↗

Super Condorcet Winners and Limit Coalitional Manipulability of IRV

We study the limit CM rate of single-winner voting rules under Impartial Culture, defined as the probability that a preference profile is coalitionally manipulable in the limit of large electorates. For m = 3 candidates, Lepelley and Valognes [1999] derived a closed-form expression for Plurality with Runoff, or equivalently Instant-Runoff Voting (IRV), and showed that its limit CM rate is strictly below 1. This is remarkable because Kim and Roush [1996] established a limit of 1 for several major rules, including Maximin and all positional scoring rules except Veto. In this paper, we generalize the result of Lepelley and Valognes to any number of candidates m $\ge$ 4. We show that Plurality with Runoff has a limit CM rate equal to 1 for all m $\ge$ 4, whereas IRV retains a limit CM rate strictly below 1. To this end, we rely on the notion of Super Condorcet Winner, recently introduced by Durand [2025], which yields an upper bound on the CM rate of IRV. We prove that this bound is asymptotically tight and compute the probability that a Super Condorcet Winner exists, thereby obtaining the exact limit CM rate of IRV.

cs.GT↗

The Communication Complexity of Instant-Runoff Voting

The communication complexity of a voting rule is the worst-case number of bits that n voters must transmit to a central authority under the most efficient elicitation protocol in an election with m candidates. We study the communication complexity of Instant-Runoff Voting (IRV). Conitzer and Sandholm [2005] established an upper bound of O(n (log m)${}^2$), but did not provide a matching lower bound beyond $Ω$(n log m). We resolve this open problem by raising the lower bound to $Ω$(n (log m)${}^2$) using the fooling set technique, thereby showing that the communication complexity of IRV is $Θ$(n (log m)${}^2$). We further show that this complexity drops to $Θ$(n log m) under the single-peakedness restriction, and that both the IRV-Average variant and Single Transferable Vote (STV), the multiwinner extension of IRV, have the same asymptotic communication complexity as IRV.

cs.MA↗

Why Instant-Runoff Voting Is So Resilient to Coalitional Manipulation: Phase Transitions in the Perturbed Culture

Previous studies have shown that Instant-Runoff Voting (IRV) is highly resistant to coalitional manipulation (CM), though the theoretical reasons for this remain unclear. To address this gap, we analyze the susceptibility to CM of three major voting rules-Plurality, Two-Round System, and IRV-within the Perturbed Culture model. Our findings reveal that each rule undergoes a phase transition at a critical value theta\_c of the concentration of preferences: the probability of CM for large electorates converges exponentially fast to 1 below theta\_c and to 0 above theta\_c. We introduce the Super Condorcet Winner (SCW), showing that its presence is a key factor of IRV's resistance to coalitional manipulation, both theoretically and empirically. Notably, we use this notion to prove that for IRV, theta\_c = 0, making it resistant to CM with even minimal preference concentration.

cs.GT↗

Learning-Based Multiuser Scheduling in MIMO-OFDM Systems with Hybrid Beamforming

We investigate the multiuser scheduling problem in multiple-input multiple-output (MIMO) systems using orthogonal frequency division multiplexing (OFDM) and hybrid beamforming in which a base station (BS) communicates with multiple users over millimeter wave (mmWave) channels in the downlink. Improved scheduling is critical for enhancing spectral efficiency and the long-term performance of the system from the perspective of proportional fairness (PF) metric in hybrid beamforming systems due to its limited multiplexing gain. Our objective is to maximize PF by properly designing the analog and digital precoders within the hybrid beamforming and selecting the users subject to the number of radio frequency (RF) chains. Leveraging the characteristics of mmWave channels, we apply a two-timescale protocol. On a long timescale, we assign an analog beam to each user. Scheduling the users and designing the digital precoder are done accordingly on a short timescale. To conduct scheduling, we propose combinatorial solutions, such as greedy and sorting algorithms, followed by a machine learning (ML) approach. Our numerical results highlight the trade-off between the performance and complexity of the proposed approaches. Consequently, we show that the choice of approach depends on the specific criteria within a given scenario.

cs.IT↗

Probability of a Condorcet Winner for Large Electorates: An Analytic Combinatorics Approach

We study the probability that a given candidate is an alpha-winner, i.e. a candidate preferred to each other candidate j by a fraction alpha_j of the voters. This extends the classical notion of Condorcet winner, which corresponds to the case alpha = (1/2, ..., 1/2). Our analysis is conducted under the general assumption that voters have independent preferences, illustrated through applications to well-known models such as Impartial Culture and the Mallows model. While previous works use probabilistic arguments to derive the limiting probability as the number of voters tends to infinity, we employ techniques from the field of analytic combinatorics to compute convergence rates and provide a method for obtaining higher-order terms in the asymptotic expansion. In particular, we establish that the probability of a given candidate being the Condorcet winner in Impartial Culture is a_0 + a_{1, n} n^{-1/2} + O(n^{-1}), where we explicitly provide the values of the constant a_0 and the coefficient a_{1, n}, which depends solely on the parity of the number of voters n. Along the way, we derive technical results in multivariate analytic combinatorics that may be of independent interest.

cs.GT↗

Anytime Sorting Algorithms (Extended Version)

This paper addresses the anytime sorting problem, aiming to develop algorithms providing tentative estimates of the sorted list at each execution step. Comparisons are treated as steps, and the Spearman's footrule metric evaluates estimation accuracy. We propose a general approach for making any sorting algorithm anytime and introduce two new algorithms: multizip sort and Corsort. Simulations showcase the superior performance of both algorithms compared to existing methods. Multizip sort keeps a low global complexity, while Corsort produces intermediate estimates surpassing previous algorithms.

cs.DS↗

Postural adjustments preceding string release in trained archers

Optimal postural stability is required to perform in archery. Since the dynamic consequences of the string release may disturb the archer's postural equilibrium, they should have integrated them in their motor program to optimize postural stability. This study aimed to characterize the postural strategy archers use to limit the potentially detrimental impact of the bow release on their postural stability and identify characteristics that may explain a better performance. Six elite and seven sub-elite archers performed a series of 18 shots at 70 meters, standing on two force plates. Postural stability indicators were computed during the aiming and the shooting phase using the trajectory of the center of pressure. Two postural strategies were defined, as whether they were triggered before (early) or after (late) the string release time. Both groups used anticipated postural adjustments, but elite archers triggered them before the string release more often and sooner. Scores differed between the two groups, but no differences were found between early and late shots. Trained archers seem to have finely integrated the dynamic consequences of their bow motion, triggering anticipated postural adjustments prior to the string release. However, it remains unclear whether this anticipation can positively influence the performance outcome.

q-bio.QM↗

Aggregating Correlated Estimations with (Almost) no Training

Many decision problems cannot be solved exactly and use several estimation algorithms that assign scores to the different available options. The estimation errors can have various correlations, from low (e.g. between two very different approaches) to high (e.g. when using a given algorithm with different hyperparameters). Most aggregation rules would suffer from this diversity of correlations. In this article, we propose different aggregation rules that take correlations into account, and we compare them to naive rules in various experiments based on synthetic data. Our results show that when sufficient information is known about the correlations between errors, a maximum likelihood aggregation should be preferred. Otherwise, typically with limited training data, we recommend a method that we call Embedded Voting (EV).

cs.LG↗

Sorting wild pigs

Chjara, breeder in Carg{è}se, has n wild pigs. She would like to sort her herd by weight to better meet the demands of her buyers. Each beast has a distinct weight, alas unknown to Chjara. All she has at her disposal is a Roberval scale, which allows her to compare two pigs only at the cost of an acrobatic manoeuvre. The balance, quite old, can break at any time. Chjara therefore wants to sort his herd in a minimum of weighings, but also to have a good estimate of the result after each weighing.To help Chjara, we pose the problem of finding a good anytime sorting algorithm, in the sense of Kendall's tau distance between provisional result and perfectly sorted list, and we bring the following contributions:- We introduce Corsort, a family of anytime sorting algorithms based on estimators.- By simulation, we show that a well-configured Corsort has a near-optimal termination time, and provides better intermediate estimates than the best sorting algorithms we are aware of.

cs.DS↗

Geometry on the Utility Space

We study the geometrical properties of the utility space (the space of expected utilities over a finite set of options), which is commonly used to model the preferences of an agent in a situation of uncertainty. We focus on the case where the model is neutral with respect to the available options, i.e. treats them, a priori, as being symmetrical from one another. Specifically, we prove that the only Riemannian metric that respects the geometrical properties and the natural symmetries of the utility space is the round metric. This canonical metric allows to define a uniform probability over the utility space and to naturally generalize the Impartial Culture to a model with expected utilities.

cs.GT↗

On the Manipulability of Voting Systems: Application to Multi-Carrier Networks

Today, Internet involves many actors who are making revenues on it (operators, companies, service providers,...). It is therefore important to be able to make fair decisions in this large-scale and highly competitive economical ecosystem. One of the main issues is to prevent actors from manipulating the natural outcome of the decision process. For that purpose, game theory is a natural framework. In that context, voting systems represent an interesting alternative that, to our knowledge, has not yet been considered. They allow competing entities to decide among different options. Strong theoretical results showed that all voting systems are susceptible to be manipulated by one single voter, except for some "degenerated" and non-acceptable cases. However, very little is known about how much a voting system is manipulable in practical scenarios. In this paper, we investigate empirically the use of voting systems for choosing end-to-end paths in multi-carrier networks, analyzing their manipulability and their economical efficiency. We show that one particular system, called \Single Transferable Vote (STV), is largely more resistant to manipulability than the natural system which tries to get the economical optimum. Moreover, STV manages to select paths close to the economical optimum, whether the participants try to cheat or not.

cs.NI↗