Obserwuj
Aranyak Mehta
Aranyak Mehta
Google Research
Zweryfikowany adres z google.com
Tytuł
Cytowane przez
Cytowane przez
Rok
Adwords and generalized online matching
A Mehta, A Saberi, U Vazirani, V Vazirani
Journal of the ACM (JACM) 54 (5), 22-es, 2007
9622007
Playing large games using simple strategies
RJ Lipton, E Markakis, A Mehta
Proceedings of the 4th ACM Conference on Electronic Commerce, 36-41, 2003
4342003
Online matching and ad allocation
A Mehta
Foundations and Trends® in Theoretical Computer Science 8 (4), 265-368, 2013
3942013
Online budgeted matching in random input models with applications to Adwords.
G Goel, A Mehta
SODA 8, 982-991, 2008
3842008
Online stochastic matching: Beating 1-1/e
J Feldman, A Mehta, V Mirrokni, S Muthukrishnan
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 117-126, 2009
3702009
Online vertex-weighted bipartite matching and single-bid budgeted allocations
G Aggarwal, G Goel, C Karande, A Mehta
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
2382011
Online bipartite matching with unknown distributions
C Karande, A Mehta, P Tripathi
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
2302011
Progress in approximate Nash equilibria
C Daskalakis, A Mehta, C Papadimitriou
Proceedings of the 8th ACM Conference on Electronic Commerce, 355-358, 2007
1542007
A note on approximate Nash equilibria
C Daskalakis, A Mehta, C Papadimitriou
Internet and Network Economics: Second International Workshop, WINE 2006 …, 2006
1342006
Beyond moulin mechanisms
A Mehta, T Roughgarden, M Sundararajan
Proceedings of the 8th ACM Conference on Electronic Commerce, 1-10, 2007
932007
A note on approximate Nash equilibria
C Daskalakis, A Mehta, C Papadimitriou
Theoretical Computer Science 410 (17), 1581-1588, 2009
922009
Inapproximability results for combinatorial auctions with submodular utility functions
S Khot, RJ Lipton, E Markakis, A Mehta
Internet and Network Economics: First International Workshop, WINE 2005 …, 2005
882005
Online matching with stochastic rewards
A Mehta, D Panigrahi
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 728-737, 2012
722012
Inapproximability results for combinatorial auctions with submodular utility functions
S Khot, RJ Lipton, E Markakis, A Mehta
Algorithmica 52, 3-18, 2008
672008
Optimizing budget constrained spend in search advertising
C Karande, A Mehta, R Srikant
Proceedings of the sixth ACM international conference on Web search and data …, 2013
562013
Fairness and optimality in congestion games
D Chakrabarty, A Mehta, V Nagarajan
Proceedings of the 6th ACM Conference on Electronic Commerce, 52-57, 2005
562005
Online stochastic matching with unequal probabilities
A Mehta, B Waggoner, M Zadimoghaddam
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
532014
Some results on approximating the minimax solution in approval voting.
R LeGrand, E Markakis, A Mehta
AAMAS 7, 1185-1187, 2007
502007
Autobidding with constraints
G Aggarwal, A Badanidiyuru, A Mehta
Web and Internet Economics: 15th International Conference, WINE 2019, New …, 2019
442019
A new dog learns old tricks: Rl finds classic optimization algorithms
W Kong, C Liaw, A Mehta, D Sivakumar
International conference on learning representations, 2019
342019
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20