← Latest papers
💻 computer science

One Vote, Several Parliaments: An Empirical Analysis of the Algorithmic Ambiguity of the Italian Electoral Law on the 2022 General Election Data

This paper empirically validates that the Italian Rosatellum electoral law's statutory text for seat allocation admits multiple algorithmic interpretations, demonstrating that while party strengths remain stable, the specific order of processing constituencies and the chosen interpretation significantly alter which individual candidates are elected.

Original authors: Paolo Coppola

Published 2026-07-14
📖 5 min read🧠 Deep dive

Original authors: Paolo Coppola

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you have a giant, delicious pizza representing all the votes cast in Italy's 2022 election. The law says exactly how to slice this pizza: first, you cut out the big slices for the single-winner districts, then you divide the remaining "proportional" cheese among the political parties based on how many votes they got.

But here's the twist: the recipe for the proportional part is written in a way that's like a puzzle with missing instructions. It tells you what to do (cut slices, count crumbs, move extra pieces around), but it doesn't say in what order to do it.

This paper, written by Paolo Coppola, is like a super-smart chef who decided to test what happens if you follow that recipe in different ways. They took the real 2022 election data—the actual votes from every town—and ran the numbers through three different "recipes" (called Algorithms A, B, and C) to see if the final pizza looked the same.

The Big Discovery: The Order Matters
The main finding is that the order in which you process the regions changes who gets to eat the pizza.

  • Algorithm C (The Real-World Chef): This is the method actually used by the election officials. It's like a chef who cuts all the big crusts first, then looks at the whole table to decide who gets the extra crumbs. This method is stable; if you shuffle the order of the regions, the final list of who gets a seat stays the same.
  • Algorithm A (The Sequential Chef): This is the most "natural" way to read the text: process Region 1, finish it, then move to Region 2, and so on. The paper found that if you use this method, the order you pick matters a lot.
    • If you process the regions in the official order, you get one list of 391 elected people.
    • If you reverse the order (starting from the end), 6 different people lose their seats, and 6 different people get them instead.
    • The authors ran a simulation with 1,000 random orders. They found 560 different possible outcomes. In some of these random orders, the pizza wasn't even fully sliced! In 29% of the random runs, the recipe failed to assign one or two seats at all, leaving the parliament with empty chairs. In another 9% of the runs, the total number of seats for each political party changed, even though the total votes didn't.

The "Mattarella" Glitch (Algorithm B)
There's a third way to read the recipe, similar to how a law from 1993 was interpreted. The authors found that if you use this method, 2 seats simply cannot be assigned by the rules in the text, no matter what order you pick. It's like the recipe says "give the last slice to the hungriest person," but if everyone is full, the slice just vanishes. This actually happened in real elections in 1994, 1996, and 2001.

Did the Chefs Get It Right?
Before showing these results, the authors had to prove their computer code was perfect. They compared their "Algorithm C" (the real-world method) against the official government records.

  • They matched 389 out of 391 elected people by name (99.5%).
  • The two people they didn't match? Those are the exact same two people that the Italian Parliament's own election committee is currently investigating because the official records are confusing or inconsistent. So, the code is actually more accurate than the messy official paperwork in those specific cases.

Why Does This Matter?
The paper argues that the law isn't just "vague"; it's operationally ambiguous. It's not that the words are hard to understand; it's that the instructions don't lock down a single, unique result.

  • The Party Strength: In the real-world method (C), the total number of seats for each party stays the same. The ambiguity only changes which specific person gets the seat and which region they represent.
  • The Chaos: But if you use the sequential method (A) with a random order, even the party strength can change.

The Bottom Line
The authors didn't just guess; they ran the full math on the real 2022 data. They proved that the same votes, processed with different "admissible" readings of the same law, elect different parliaments.

  • In their simulations, 119 different people were elected in some scenarios but not others.
  • Only 339 people were elected in every single scenario tested.

So, the next time you hear that "one vote, one parliament," this paper suggests that for proportional seats, it might be more like "one vote, several possible parliaments," depending on which version of the recipe the computer happens to follow. The law works, but it works in a way that leaves the final outcome up to a scheduling choice that the text itself never defined.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →