6 citations · 9 across the 2 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2011
On the Structure of Weakly Acyclic Games
Alex Fabrikant, Aaron D. Jaggard, Michael Schapira
The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. In a weakly acyclic game, from any star…
cs.GT2009★ 6 cited
VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension
Elchanan Mossel, Christos Papadimitriou, Michael Schapira +1
The existence of incentive-compatible computationally-efficient protocols for combinatorial auctions with decent approximation ratios is the paradigmatic problem in computational m…