Aranyak Mehta

Navedeno

	Vse	Od leta 2019
Navedbe	5188	2441
indeks h	25	18
indeks i10	45	33

480

240

120

360

2005200620072008200920102011201220132014201520162017201820192020202120222023202427 60 132 148 147 184 187 187 212 287 236 309 285 288 348 417 344 436 479 416

Javni dostop

Prikaži vse

3 članki

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Vijay VaziraniDistinguished Professor, Dept. of Computer Science, University of California, Irvine.Preverjeni e-poštni naslov na ics.uci.edu
Evangelos MarkakisAthens University of Economics and BusinessPreverjeni e-poštni naslov na aueb.gr
Gagan GoelResearch Scientist, GooglePreverjeni e-poštni naslov na google.com
Amin SaberiProfessor, Stanford UniversityPreverjeni e-poštni naslov na stanford.edu
Jon FeldmanResearcher, GooglePreverjeni e-poštni naslov na google.com
Christopher LiawResearch Scientist, GooglePreverjeni e-poštni naslov na google.com
Vahab MirrokniGoogle Fellow, VP, Google ResearchPreverjeni e-poštni naslov na google.com
Christos H PAPADIMITRIOUColumbia UniversityPreverjeni e-poštni naslov na columbia.edu
Constantinos DaskalakisProfessor of Computer Science, MITPreverjeni e-poštni naslov na csail.mit.edu
Mukund SundararajanGooglePreverjeni e-poštni naslov na cs.stanford.edu
Tim RoughgardenColumbia UniversityPreverjeni e-poštni naslov na cs.columbia.edu
Deeparnab ChakrabartyDartmouth CollegePreverjeni e-poštni naslov na dartmouth.edu
Pushkar TripathiGeorgia Institute of TechnologyPreverjeni e-poštni naslov na google.com
D. SivakumarTonita.coPreverjeni e-poštni naslov na tonita.co
Yang CaiAssociate Professor of Computer Science and Economics, Yale UniversityPreverjeni e-poštni naslov na yale.edu
Robert KrauthgamerWeizmann Institute of SciencePreverjeni e-poštni naslov na weizmann.ac.il
Howard KarloffGoldman SachsPreverjeni e-poštni naslov na cc.gatech.edu
Bo WaggonerUniversity of Colorado, BoulderPreverjeni e-poštni naslov na colorado.edu
Shahar DobzinskiPreverjeni e-poštni naslov na cs.cornell.edu
Mihalis KolountzakisProfessor of Mathematics, University of Crete, GreecePreverjeni e-poštni naslov na math.uoc.gr

Spremljaj

Aranyak Mehta

Google Research

Preverjeni e-poštni naslov na google.com


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Adwords and generalized online matching A Mehta, A Saberi, U Vazirani, V Vazirani Journal of the ACM (JACM) 54 (5), 22-es, 2007	1046	2007
Online matching and ad allocation A Mehta Foundations and Trends® in Theoretical Computer Science 8 (4), 265-368, 2013	477	2013
Playing large games using simple strategies RJ Lipton, E Markakis, A Mehta Proceedings of the 4th ACM Conference on Electronic Commerce, 36-41, 2003	462	2003
Online budgeted matching in random input models with applications to Adwords. G Goel, A Mehta SODA 8, 982-991, 2008	415	2008
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	413	2009
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	280	2011
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	254	2011
Progress in approximate Nash equilibria C Daskalakis, A Mehta, C Papadimitriou Proceedings of the 8th ACM Conference on Electronic Commerce, 355-358, 2007	154	2007
A note on approximate Nash equilibria C Daskalakis, A Mehta, C Papadimitriou International Workshop on Internet and Network Economics, 297-306, 2006	139	2006
A note on approximate Nash equilibria C Daskalakis, A Mehta, C Papadimitriou Theoretical Computer Science 410 (17), 1581-1588, 2009	106	2009
Beyond moulin mechanisms A Mehta, T Roughgarden, M Sundararajan Proceedings of the 8th ACM Conference on Electronic Commerce, 1-10, 2007	93	2007
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	92	2005
Online matching with stochastic rewards A Mehta, D Panigrahi 2012 IEEE 53rd annual symposium on foundations of computer science, 728-737, 2012	89	2012
Autobidding with constraints G Aggarwal, A Badanidiyuru, A Mehta Web and Internet Economics: 15th International Conference, WINE 2019, New …, 2019	82	2019
Inapproximability results for combinatorial auctions with submodular utility functions S Khot, RJ Lipton, E Markakis, A Mehta Algorithmica 52, 3-18, 2008	68	2008
Online stochastic matching with unequal probabilities A Mehta, B Waggoner, M Zadimoghaddam Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014	67	2014
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	67	2013
Fairness and optimality in congestion games D Chakrabarty, A Mehta, V Nagarajan Proceedings of the 6th ACM Conference on Electronic Commerce, 52-57, 2005	60	2005
Some results on approximating the minimax solution in approval voting. R LeGrand, E Markakis, A Mehta AAMAS 7, 1185-1187, 2007	55	2007
A new dog learns old tricks: Rl finds classic optimization algorithms W Kong, C Liaw, A Mehta, D Sivakumar International conference on learning representations, 2018	53	2018

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji