9 citations · 27 across the 19 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 3 cited
The Complexity of Partial Function Extension for Coverage Functions
Umang Bhaskar, Gunjan Kumar
Coverage functions are an important subclass of submodular functions, finding applications in machine learning, game theory, social networks, and facility location. We study the co…
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…