69 citations · 336 across the 41 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2014★ 4 cited
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…
cs.GT2014
Learning Economic Parameters from Revealed Preferences
Maria-Florina Balcan, Amit Daniely, Ruta Mehta +2
A recent line of work, starting with Beigman and Vohra (2006) and Zadimoghaddam and Roth (2012), has addressed the problem of {\em learning} a utility function from revealed prefer…