activity
20202025
most citedStable Dinner Party Seating Arrangements

3 citations · 5 across the 10 of their papers we have counts for

collaborators
Showing 2023Show all

6 papers · 1 filter

cs.GT2023

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…

cs.GT2023

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…

cs.GT2023

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…

cs.GT2023★ 3 cited

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…

cs.DC2023

A Fair and Resilient Decentralized Clock Network for Transaction Ordering

Andrei Constantinescu, Diana Ghinea, Lioba Heimbach +2

Traditional blockchain design gives miners or validators full control over transaction ordering, i.e., they can freely choose which transactions to include or exclude, as well as i…

cs.GT2023

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…