3 citations · 8 across the 5 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2019
Computational Aspects of Equilibria in Discrete Preference Games
Phani Raj Lolakapuri, Umang Bhaskar, Ramasuri Narayanam +2
We study the complexity of equilibrium computation in discrete preference games. These games were introduced by Chierichetti, Kleinberg, and Oren (EC '13, JCSS '18) to model decisi…
cs.GT2012★ 1 cited
Mechanism Design for Time Critical and Cost Critical Task Execution via Crowdsourcing
Swaprava Nath, Pankaj Dayama, Dinesh Garg +2
An exciting application of crowdsourcing is to use social networks in complex task execution. In this paper, we address the problem of a planner who needs to incentivize agents wit…