25 citations · 80 across the 30 of their papers we have counts for
37 papers
Contests to Incentivize a Target Group
Edith Elkind, Abheek Ghosh, Paul Goldberg
We study how to incentivize agents in a target group to produce a higher output in the context of incomplete information, by means of rank-order allocation contests. We describe a…
Complexity of Deliberative Coalition Formation
Edith Elkind, Abheek Ghosh, Paul Goldberg
Elkind et al. (AAAI, 2021) introduced a model for deliberative coalition formation, where a community wishes to identify a strongly supported proposal from a space of alternatives,…
Contest Design with Threshold Objectives
Edith Elkind, Abheek Ghosh, Paul W. Goldberg
We study contests where the designer's objective is an extension of the widely studied objective of maximizing the total output: The designer gets zero marginal utility from a play…
Equivalence of Models of Cake-Cutting Protocols
Paul W. Goldberg, Ioana Iaru
The cake-cutting problem involves dividing a heterogeneous, divisible resource fairly between agents. Brânzei et al. [6] introduced {\em generalised cut and choose} (GCC) proto…
Lower Bounds for the Query Complexity of Equilibria in Lipschitz Games
Paul W. Goldberg, Matthew J. Katzman
Nearly a decade ago, Azrieli and Shmaya introduced the class of -Lipschitz games in which every player's payoff function is -Lipschitz with respect to the actions of the othe…
The Complexity of Gradient Descent: CLS = PPAD PLS
John Fearnley, Paul W. Goldberg, Alexandros Hollender +1
We study search problems that can be solved by performing Gradient Descent on a bounded convex polytopal domain and show that this class is equal to the intersection of two well-kn…