6 citations · 31 across the 8 of their papers we have counts for
9 papers
Egalitarian and Just Digital Currency Networks
Gal Shahaf, Ehud Shapiro, Nimrod Talmon
Cryptocurrencies are a digital medium of exchange with decentralized control that renders the community operating the cryptocurrency its sovereign. Leading cryptocurrencies use pro…
Digital Social Contracts: A Foundation for an Egalitarian and Just Digital Society
Luca Cardelli, Liav Orgad, Gal Shahaf +2
Almost two centuries ago Pierre-Joseph Proudhon proposed social contracts -- voluntary agreements among free people -- as a foundation from which an egalitarian and just society ca…
Safe Voting: Resilience to Abstention and Sybils
Reshef Meir, Gal Shahaf, Ehud Shapiro +1
Voting rules may implement the will of the society when all eligible voters vote, and only them. However, they may fail to do so when sybil (fake or duplicate) votes are present an…
Genuine Personal Identifiers and Mutual Sureties for Sybil-Resilient Community Formation
Gal Shahaf, Ehud Shapiro, Nimrod Talmon
While most of humanity is suddenly on the net, the value of this singularity is hampered by the lack of credible digital identities: Social networking, person-to-person transaction…
Building a Sybil-Resilient Digital Community Utilizing Trust-Graph Connectivity
Ouri Poupko, Gal Shahaf, Ehud Shapiro +1
Preventing fake or duplicate digital identities (aka sybils) from joining a digital community may be crucial to its survival, especially if it utilizes a consensus protocol among i…
Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation
Laurent Bulteau, Gal Shahaf, Ehud Shapiro +1
We present a unifying framework encompassing many social choice settings. Viewing each social choice setting as voting in a suitable metric space, we consider a general model of so…
Oblivious Routing via Random Walks
Michael Schapira, Gal Shahaf
We present novel oblivious routing algorithms for both splittable and unsplittable multicommodity flow. Our algorithm for minimizing congestion for \emph{unsplittable} multicommodi…
Large Fixed-Diameter Graphs are Good Expanders
Michael Dinitz, Michael Schapira, Gal Shahaf
We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essent…
Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension
Amit Daniely, Michael Schapira, Gal Shahaf
Algorithmic mechanism design (AMD) studies the delicate interplay between computational efficiency, truthfulness, and optimality. We focus on AMD's paradigmatic problem: combinator…