Related papers: Single-Peakedness Does Not Prevent Leapfrogging un…

The key contribution of the paper is a comprehensive study of the egalitarian mechanism with respect to manipulation by a coalition of agents. Our main result is that the egalitarian mechanism is, in fact, peak group strategyproof : no…

When does society eventually learn the truth, or take the correct action, via observational learning? In a general model of sequential learning over social networks, we identify a simple condition for learning dubbed excludability.…

We present a simple model for growing up and depletion of parties due to the permanent communication between the participants of the events. Because of the rapid exchange of information, everybody is able to evaluate its own and and all…

We consider a swarm of mobile robots evolving in a bidimensional Euclidean space. We study a variant of the crash-tolerant gathering problem: if no robot crashes, robots have to meet at the same arbitrary location, not known beforehand, in…

Incomplete preferences are likely to arise in real-world preference aggregation scenarios. This paper deals with determining whether an incomplete preference profile is single-peaked. This is valuable information since many intractable…

We study the hydrodynamic behaviour of the asymmetric simple exclusion process on the lattice of size $n$. In the bulk, the exclusion dynamics performs rightward flux. At the boundaries, the dynamics is attached to reservoirs. We…

Direct Preference Optimization (DPO) and its variants are increasingly used for aligning language models with human preferences. Although these methods are designed to teach a model to generate preferred responses more frequently relative…

We consider the motion of spinning test particles with nonzero rest mass in the "pole-dipole" approximation, as described by the Mathisson-Papapetrou-Dixon (MPD) equations, and examine its properties in dependence on the spin supplementary…

Manipulation, bribery, and control are well-studied ways of changing the outcome of an election. Many voting rules are, in the general case, computationally resistant to some of these manipulative actions. However when restricted to…

Ranked decision systems -- recommenders, ad auctions, clinical triage queues -- must decide when to intervene in ranked outputs and when to abstain. We study when confidence-based abstention monotonically improves decision quality, and when…

Consensus formation is pivotal in multi-agent systems (MAS), balancing collective coherence with individual diversity. Conventional LLM-based MAS primarily rely on explicit coordination, e.g., prompts or voting, risking premature…

Reinforcement learning (RL) policies often fail under dynamics that differ from training, a gap not fully addressed by domain randomization or existing adversarial RL methods. Distributionally robust RL provides a formal remedy but still…

Since economic mechanisms are often applied to very different instances of the same problem, it is desirable to identify mechanisms that work well in a wide range of circumstances. We pursue this goal for a position auction setting and…

Does a high dispersal rate provide a competitive advantage when risking competitive exclusion? To this day, the theoretical literature cannot answer this question in full generality. The present paper focuses on the simplest mathematical…

We consider the one-dimensional totally asymmetric simple exclusion process (TASEP) with position-dependent hopping rates. The problem is solved,in a mean field/adiabatic approximation, for a general (smooth) form of spatial rate variation.…

The well-known Condorcet's Jury theorem posits that the majority rule selects the best alternative among two available options with probability one, as the population size increases to infinity. We study this result under an asymmetric…

For networked systems, Persistent Excitation and Integral Scrambling Condition are conditions ensuring that communication failures between agents can occur, but a minimal level of service is ensured. We consider cooperative multi-agent…

In this paper, we first propose a novel maneuvering technique compatible with displacement-consensus-based formation controllers. We show that the formation can be translated with an arbitrary velocity by modifying the weights in the…

The well-known Condorcet Jury Theorem states that, under majority rule, the better of two alternatives is chosen with probability approaching one as the population grows. We study an asymmetric setting where voters face varying…

We consider a system of two competing populations in two-dimensional heterogeneous environments. The populations are assumed to move horizontally and vertically with different probabilities, but are otherwise identical. We regard these…