Aranyak Mehta
Aranyak Mehta
Google Research
Email verificata su google.com
Titolo
Citata da
Citata da
Anno
Adwords and generalized online matching
A Mehta, A Saberi, U Vazirani, V Vazirani
Journal of the ACM (JACM) 54 (5), 22-es, 2007
7462007
Playing large games using simple strategies
RJ Lipton, E Markakis, A Mehta
Proceedings of the 4th ACM conference on Electronic commerce, 36-41, 2003
3892003
Online budgeted matching in random input models with applications to Adwords.
G Goel, A Mehta
SODA 8, 982-991, 2008
3002008
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
2672009
Online matching and ad allocation
A Mehta
2252013
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
1832011
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
1652011
Progress in approximate Nash equilibria
C Daskalakis, A Mehta, C Papadimitriou
Proceedings of the 8th ACM conference on Electronic commerce, 355-358, 2007
1292007
A note on approximate Nash equilibria
C Daskalakis, A Mehta, C Papadimitriou
International Workshop on Internet and Network Economics, 297-306, 2006
1172006
Beyond moulin mechanisms
A Mehta, T Roughgarden, M Sundararajan
Games and Economic Behavior 67 (1), 125-155, 2009
882009
Inapproximability results for combinatorial auctions with submodular utility functions
S Khot, RJ Lipton, E Markakis, A Mehta
International Workshop on Internet and Network Economics, 92-101, 2005
802005
A note on approximate Nash equilibria
C Daskalakis, A Mehta, C Papadimitriou
Theoretical Computer Science 410 (17), 1581-1588, 2009
792009
Inapproximability results for combinatorial auctions with submodular utility functions
S Khot, RJ Lipton, E Markakis, A Mehta
Algorithmica 52 (1), 3-18, 2008
592008
Some results on approximating the minimax solution in approval voting.
R LeGrand, E Markakis, A Mehta
AAMAS 7, 1185-1187, 2007
512007
Fairness and optimality in congestion games
D Chakrabarty, A Mehta, V Nagarajan
Proceedings of the 6th ACM Conference on Electronic Commerce, 52-57, 2005
462005
Online matching with stochastic rewards
A Mehta, D Panigrahi
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 728-737, 2012
442012
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
422013
Is Shapley cost sharing optimal?
S Dobzinski, A Mehta, T Roughgarden, M Sundararajan
International Symposium on Algorithmic Game Theory, 327-336, 2008
322008
Online stochastic matching with unequal probabilities
A Mehta, B Waggoner, M Zadimoghaddam
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
302014
Efficiency of (revenue-) optimal mechanisms
G Aggarwal, G Goel, A Mehta
Proceedings of the 10th ACM conference on Electronic commerce, 235-242, 2009
272009
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20