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
672018
Approximation Algorithms for Maximin Fair Division
S Barman, SK Krishnamurthy
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
622017
Groupwise maximin fair allocation of indivisible goods
S Barman, A Biswas, SK Krishnamurthy, Y Narahari
Thirty-Second AAAI Conference on Artificial Intelligence, 2018
282018
Greedy algorithms for maximizing Nash social welfare
S Barman, SK Krishnamurthy, R Vaish
arXiv preprint arXiv:1801.09046, 2018
212018
On the proximity of markets with integral equilibria
S Barman, SK Krishnamurthy
Proceedings of the AAAI Conference on Artificial Intelligence 33, 1748-1755, 2019
112019
Approximation Algorithms for Maximin Fair Division
S Barman, SK Krishnamurthy
ACM Transactions on Economics and Computation (TEAC) 8 (1), 1-28, 2020
12020
Survey Bandits with Regret Guarantees
SK Krishnamurthy, S Athey
arXiv preprint arXiv:2002.09814, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–7