3 citations · 5 across the 10 of their papers we have counts for
6 papers · 1 filter
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…