32 citations · 162 across the 26 of their papers we have counts for
8 papers · 1 filter
Nash-Peering: A New Techno-Economic Framework for Internet Interconnections
Doron Zarchy, Amogh Dhamdhere, Constantine Dovrolis +1
The current framework of Internet interconnections, based on transit and settlement-free peering relations, has systemic problems that often cause peering disputes. We propose a ne…
Dynamics at the Boundary of Game Theory and Distributed Computing
Aaron D. Jaggard, Neil Lutz, Michael Schapira +1
We use ideas from distributed computing and game theory to study dynamic and decentralized environments in which computational nodes, or decision makers, interact strategically and…
Setting Lower Bounds on Truthfulness
Ahuva Mu'alem, Michael Schapira
We present and discuss general techniques for proving inapproximability results for truthful mechanisms. We make use of these techniques to prove lower bounds on the approximabilit…
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…
Self-stabilizing uncoupled dynamics
Aaron D. Jaggard, Neil Lutz, Michael Schapira +1
Dynamics in a distributed system are self-stabilizing if they are guaranteed to reach a stable state regardless of how the system is initialized. Game dynamics are uncoupled if eac…
Pay or Play
Sigal Oren, Michael Schapira, Moshe Tennenholtz
We introduce the class of pay or play games, which captures scenarios in which each decision maker is faced with a choice between two actions: one with a fixed payoff and an- other…