3 citations · 5 across the 10 of their papers we have counts for
16 papers
From Few to Many Faults: Optimal Adaptive Byzantine Agreement
Andrei Constantinescu, Marc Dufay, Anton Paramonov +1
Achieving agreement among distributed parties is a fundamental task in modern systems, underpinning applications such as consensus in blockchains, coordination in cloud infrastruct…
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…
Logarithmic Approximation for Road Pricing on Grids
Andrei Constantinescu, Andrzej Turko, Roger Wattenhofer
Consider a graph and some commuters, each specified by a tuple consisting of two nodes in the graph and a non-negative real number , specif…
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…
Byzantine Stable Matching
Andrei Constantinescu, Marc Dufay, Diana Ghinea +1
In stable matching, one must find a matching between two sets of agents, commonly men and women, or job applicants and job positions. Each agent has a preference ordering over who…
Validity in Network-Agnostic Byzantine Agreement
Andrei Constantinescu, Marc Dufay, Diana Ghinea +1
Byzantine Agreement (BA) considers a setting of parties, out of which up to can exhibit byzantine (malicious) behavior. Honest parties must decide on a common value (agreem…
Unifying Partial Synchrony
Andrei Constantinescu, Diana Ghinea, Jakub Sliwinski +1
The distributed computing literature considers multiple options for modeling communication. Most simply, communication is categorized as either synchronous or asynchronous. Synchro…
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…
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…
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…