research
∙
09/11/2023
On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes
We study elections where voters are faced with the challenge of expressi...
share
research
∙
06/29/2023
Would Friedman Burn your Tokens?
Cryptocurrencies come with a variety of tokenomic policies as well as as...
research
∙
06/27/2023
Optimal Testing and Containment Strategies for Universities in Mexico amid COVID-19
This work sets out a testing and containment framework developed for reo...
research
∙
04/12/2023
Tiered Mechanisms for Blockchain Transaction Fees
Blockchain systems come with the promise of being inclusive for a variet...
research
∙
01/31/2023
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria
Fair allocation of indivisible goods has attracted extensive attention o...
research
∙
05/17/2022
Decentralised Update Selection with Semi-Strategic Experts
Motivated by governance models adopted in blockchain applications, we st...
research
∙
02/08/2022
Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria
Motivated by the intricacies of allocating treasury funds in blockchain ...
research
∙
01/18/2022
SoK: Blockchain Governance
Blockchain systems come with a promise of decentralization that often st...
research
∙
11/04/2021
Single-Sample Prophet Inequalities via Greedy-Ordered Selection
We study single-sample prophet inequalities (SSPIs), i.e., prophet inequ...
research
∙
09/17/2021
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
We consider the problem of fairly allocating a set of indivisible goods ...
research
∙
04/05/2021
Prophet Inequalities for Matching with a Single Sample
We consider the prophet inequality problem for (not necessarily bipartit...
research
∙
03/04/2021
On the Complexity of Equilibrium Computation in First-Price Auctions
We consider the problem of computing a (pure) Bayes-Nash equilibrium in ...
research
∙
02/16/2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
The growing need to deal with massive instances motivates the design of ...
research
∙
02/15/2021
RPPLNS: Pay-per-last-N-shares with a Randomised Twist
"Pay-per-last-N-shares" (PPLNS) is one of the most common payout strateg...
research
∙
07/09/2020
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Constrained submodular maximization problems encompass a wide variety of...
research
∙
03/17/2020
Efficient Two-Sided Markets with Limited Information
Many important practical markets inherently involve the interaction of s...
research
∙
02/17/2020
Pandora's Box Problem with Order Constraints
The Pandora's Box Problem, originally formalized by Weitzman in 1979, mo...
research
∙
10/04/2019
Fairness and Efficiency in DAG-based Cryptocurrencies
Bitcoin is a decentralised digital currency that serves as an alternativ...
research
∙
05/29/2019
Reallocating Multiple Facilities on the Line
We study the multistage K-facility reallocation problem on the real line...
research
∙
05/17/2019
Blockchain Mining Games with Pay Forward
We study the strategic implications that arise from adding one extra opt...
research
∙
12/28/2018
Online Trading as a Secretary Problem
We consider the online problem in which an intermediary trades identical...
research
∙
11/13/2018
Multi-unit Bilateral Trade
We characterise the set of dominant strategy incentive compatible (DSIC)...
research
∙
09/10/2018