3 citations · 5 across the 10 of their papers we have counts for
10 papers · 1 filter
Byzantine Game Theory: Sun Tzus Boxes
Andrei Constantinescu, Roger Wattenhofer
We introduce the Byzantine Selection Problem, living at the intersection of game theory and fault-tolerant distributed computing. Here, an event organizer is presented with a group…
Condorcet Winners and Anscombes Paradox Under Weighted Binary Voting
Carmel Baharav, Andrei Constantinescu, Roger Wattenhofer
We consider voting on multiple independent binary issues. In addition, a weighting vector for each voter defines how important they consider each issue. The most natural way to agg…
Transaction Fee Market Design for Parallel Execution
Bahar Acilan, Andrei Constantinescu, Lioba Heimbach +1
Given the low throughput of blockchains like Bitcoin and Ethereum, scalability - the ability to process an increasing number of transactions - has become a central focus of blockch…
Unravelling Expressive Delegations: Complexity and Normative Analysis
Giannis Tyrovolas, Andrei Constantinescu, Edith Elkind
We consider binary group decision-making under a rich model of liquid democracy recently proposed by Colley, Grandi, and Novaro (2022): agents submit ranked delegation options, whe…
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser +2
A decade ago, Gerhard Woeginger posed an open problem that became well-known as "Woeginger's Hiking Problem": Consider a group of people that want to go hiking; everyone expres…
Recovering Single-Crossing Preferences From Approval Ballots
Andrei Constantinescu, Roger Wattenhofer
An electorate with fully-ranked innate preferences casts approval votes over a finite set of alternatives. As a result, only partial information about the true preferences is revea…
Stable Dinner Party Seating Arrangements
Damien Berriaud, Andrei Constantinescu, Roger Wattenhofer
A group of agents with numerical preferences for each other are to be assigned to the seats of a dining table. We study two natural topologies:~circular (cycle) tables and…
Computing the Best Policy That Survives a Vote
Andrei Constantinescu, Roger Wattenhofer
An assembly of voters needs to decide on independent binary issues. Each voter has opinions about the issues, given by a -bit vector. Anscombe's paradox shows that a pol…
Voting in Two-Crossing Elections
Andrei Constantinescu, Roger Wattenhofer
We introduce two-crossing elections as a generalization of single-crossing elections, showing a number of new results. First, we show that two-crossing elections can be recognized…
Proportional Representation under Single-Crossing Preferences Revisited
Andrei Constantinescu, Edith Elkind
We study the complexity of determining a winning committee under the Chamberlin--Courant voting rule when voters' preferences are single-crossing on a line, or, more generally, on…