128 citations · 157 across the 4 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2015★ 128 cited
Approximation Algorithms for Computing Maximin Share Allocations
Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad +1
We study the problem of computing maximin share guarantees, a recently introduced fairness notion. Given a set of agents and a set of goods, the maximin share of a single agent…
cs.GT2014★ 7 cited
Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets
Nima Anari, Gagan Goel, Afshin Nikzad
In this paper we consider a mechanism design problem in the context of large-scale crowdsourcing markets such as Amazon's Mechanical Turk, ClickWorker, CrowdFlower. In these market…