Sanath Kumar Krishnamurthy
Sanath Kumar Krishnamurthy
PhD student, Stanford
Verified email at stanford.edu - Homepage
Title
Cited by
Cited by
Year
Finding fair and efficient allocations
S Barman, SK Krishnamurthy, R Vaish
Proceedings of the 2018 ACM Conference on Economics and Computation, 557-574, 2018
822018
Approximation Algorithms for Maximin Fair Division
S Barman, SK Krishnamurthy
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
762017
Groupwise maximin fair allocation of indivisible goods
S Barman, A Biswas, S Krishnamurthy, Y Narahari
Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018
342018
Greedy algorithms for maximizing Nash social welfare
S Barman, SK Krishnamurthy, R Vaish
arXiv preprint arXiv:1801.09046, 2018
272018
On the proximity of markets with integral equilibria
S Barman, SK Krishnamurthy
Proceedings of the AAAI Conference on Artificial Intelligence 33, 1748-1755, 2019
142019
Survey Bandits with Regret Guarantees
SK Krishnamurthy, S Athey
arXiv preprint arXiv:2002.09814, 2020
32020
Approximation Algorithms for Maximin Fair Division
S Barman, SK Krishnamurthy
ACM Transactions on Economics and Computation (TEAC) 8 (1), 1-28, 2020
22020
Tractable contextual bandits beyond realizability
SK Krishnamurthy, V Hadad, S Athey
arXiv preprint arXiv:2010.13013, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–8