output
20022026
most citedTypical random 3-SAT formulae and the satisfiability threshold

146 citations

150 papers

cs.GT2026

Distances Between Top-Truncated Elections of Different Sizes

Piotr Faliszewski, Jitka Mertlová, Pierre Nunn +2

The map of elections framework is a methodology for visualizing and analyzing election datasets. So far, the framework was restricted to elections that have equal numbers of candid…

math.OC2026

Integrating ethical, societal and environmental issues into algorithm design courses

Odile Bellenguez, Nadia Brauner, Christine Solnon +1

This document, intended for computer science teachers, describes a case study that puts into practice a questioning of ethical, societal and environmental issues when designing or…

cs.CL2025

Improving Diversity in Language Models: When Temperature Fails, Change the Loss

Alexandre Verine, Florian Le Bronnec, Kunhao Zheng +3

Increasing diversity in language models is a challenging yet essential objective. A common approach is to raise the decoding temperature. In this work, we investigate this approach…

econ.TH2025

Independence Axioms in Social Ranking

Takahiro Suzuki, Michele Aleandri, Stefano Moretti

Independence from non-essential changes in input information is a widely recognized axiom in social choice theory. This independence reduces the cost of specifying and/or analyzing…

econ.TH2025

Mill's canons meet social ranking: A characterization of plurality

Takahiro Suzuki, Michele Aleandri, Stefano Moretti

In his book entitled ''A System of Logic, Ratiocinative and Inductive'' (1843), John Stuart Mill proposed principles of inductive reasoning in the form of five canons. To date, the…

math.CO2025

Totally equimodular matrices: decomposition and triangulation

Patrick Chervet, Roland Grappe, Mathieu Vallée

Totally equimodular matrices generalize totally unimodular matrices and arise in the context of box-total dual integral polyhedra. This work further explores the parallels between…