Aranyak Mehta
Yeganeh Alimohammadi
Aranyak Mehta
Andrés Perlroth
Incentive Compatibility in the Auto-bidding World.
63
2023
EC
https://doi.org/10.1145/3580507.3597725
conf/sigecom/2023
db/conf/sigecom/sigecom2023.html#AlimohammadiMP23
Andrés Perlroth
Aranyak Mehta
Auctions without commitment in the auto-bidding world.
3478-3488
2023
WWW
https://doi.org/10.1145/3543507.3583416
conf/www/2023
db/conf/www/www2023.html#PerlrothM23
Christopher Liaw
Aranyak Mehta
Andrés Perlroth
Efficiency of Non-Truthful Auctions in Auto-bidding: The Power of Randomization.
3561-3571
2023
WWW
https://doi.org/10.1145/3543507.3583492
conf/www/2023
db/conf/www/www2023.html#LiawMP23
Aranyak Mehta
Andrés Perlroth
Auctions without commitment in the auto-bidding world.
2023
abs/2301.07312
CoRR
https://doi.org/10.48550/arXiv.2301.07312
db/journals/corr/corr2301.html#abs-2301-07312
Yeganeh Alimohammadi
Aranyak Mehta
Andrés Perlroth
Incentive Compatibility in the Auto-bidding World.
2023
abs/2301.13414
CoRR
https://doi.org/10.48550/arXiv.2301.13414
db/journals/corr/corr2301.html#abs-2301-13414
Yang Cai 0001
Zhe Feng 0004
Christopher Liaw
Aranyak Mehta
User Response in Ad Auctions: An MDP Formulation of Long-Term Revenue Optimization.
2023
abs/2302.08108
CoRR
https://doi.org/10.48550/arXiv.2302.08108
db/journals/corr/corr2302.html#abs-2302-08108
Yang Cai 0001
Christopher Liaw
Aranyak Mehta
Mingfei Zhao
The Power of Two-sided Recruitment in Two-sided Markets.
2023
abs/2307.03844
CoRR
https://doi.org/10.48550/arXiv.2307.03844
db/journals/corr/corr2307.html#abs-2307-03844
Kamyar Azizzadenesheli
Trung Dang
Aranyak Mehta
Alexandros Psomas 0001
Qian Zhang
Reward Selection with Noisy Observations.
2023
abs/2307.05953
CoRR
https://doi.org/10.48550/arXiv.2307.05953
db/journals/corr/corr2307.html#abs-2307-05953
Christopher Liaw
Aranyak Mehta
Wennan Zhu
Efficiency of Non-Truthful Auctions in Auto-bidding with Budget Constraints.
2023
abs/2310.09271
CoRR
https://doi.org/10.48550/arXiv.2310.09271
db/journals/corr/corr2310.html#abs-2310-09271
Gagan Aggarwal
Kshipra Bhawalkar
Aranyak Mehta
Divyarthi Mohan
Alexandros Psomas 0001
Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions.
2022
conf/nips/2022
NeurIPS
http://papers.nips.cc/paper_files/paper/2022/hash/b5b66077d016c037576cc56a82f97f66-Abstract-Conference.html
db/conf/nips/neurips2022.html#AggarwalBMM022
Aranyak Mehta
Auction Design in an Auto-bidding Setting: Randomization Improves Efficiency Beyond VCG.
173-181
2022
WWW
https://doi.org/10.1145/3485447.3512062
conf/www/2022
db/conf/www/www2022.html#Mehta22
Aranyak Mehta
Auction Design in an Auto-bidding Setting: Randomization Improves Efficiency Beyond VCG.
2022
abs/2204.10956
CoRR
https://doi.org/10.48550/arXiv.2204.10956
db/journals/corr/corr2204.html#abs-2204-10956
Gagan Aggarwal
Kshipra Bhawalkar
Aranyak Mehta
Divyarthi Mohan
Alexandros Psomas 0001
Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions.
2022
abs/2206.02948
CoRR
https://doi.org/10.48550/arXiv.2206.02948
db/journals/corr/corr2206.html#abs-2206-02948
Christopher Liaw
Aranyak Mehta
Andrés Perlroth
Efficiency of non-truthful auctions under auto-bidding.
2022
abs/2207.03630
CoRR
https://doi.org/10.48550/arXiv.2207.03630
db/journals/corr/corr2207.html#abs-2207-03630
Guru Guruganesh
Aranyak Mehta
Di Wang
Kangning Wang
Prior-Independent Auctions for Heterogeneous Bidders.
2022
abs/2207.09429
CoRR
https://doi.org/10.48550/arXiv.2207.09429
db/journals/corr/corr2207.html#abs-2207-09429
Zhe Feng 0004
Guru Guruganesh
Christopher Liaw
Aranyak Mehta
Abhishek Sethi
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions.
5399-5406
2021
AAAI
https://doi.org/10.1609/aaai.v35i6.16680
conf/aaai/2021
db/conf/aaai/aaai2021.html#0004GLMS21
Aranyak Mehta
Uri Nadav
Alexandros Psomas 0001
Aviad Rubinstein
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics.
2020
NeurIPS
https://proceedings.neurips.cc/paper/2020/hash/b6417f112bd27848533e54885b66c288-Abstract.html
conf/nips/2020
db/conf/nips/neurips2020.html#MehtaNPR20
Zhe Feng 0004
Guru Guruganesh
Christopher Liaw
Aranyak Mehta
Abhishek Sethi
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions.
2020
abs/2009.06136
CoRR
https://arxiv.org/abs/2009.06136
db/journals/corr/corr2009.html#abs-2009-06136
Goran Zuzic
Di Wang
Aranyak Mehta
D. Sivakumar 0001
Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training.
2020
abs/2010.08418
CoRR
https://arxiv.org/abs/2010.08418
db/journals/corr/corr2010.html#abs-2010-08418
Aranyak Mehta
Uri Nadav
Alexandros Psomas 0001
Aviad Rubinstein
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics.
2020
abs/2012.07935
CoRR
https://arxiv.org/abs/2012.07935
db/journals/corr/corr2012.html#abs-2012-07935
Weiwei Kong
Christopher Liaw
Aranyak Mehta
D. Sivakumar 0001
A new dog learns old tricks: RL finds classic optimization algorithms.
2019
ICLR (Poster)
https://openreview.net/forum?id=rkluJ2R9KQ
conf/iclr/2019
db/conf/iclr/iclr2019.html#KongLMS19
Gagan Aggarwal
Ashwinkumar Badanidiyuru
Aranyak Mehta
Autobidding with Constraints.
17-30
2019
WINE
https://doi.org/10.1007/978-3-030-35389-6_2
conf/wine/2019
db/conf/wine/wine2019.html#AggarwalBM19
Shahar Dobzinski
Aranyak Mehta
Tim Roughgarden
Mukund Sundararajan
Is Shapley cost sharing optimal?
130-138
2018
108
Games Econ. Behav.
https://doi.org/10.1016/j.geb.2017.03.008
db/journals/geb/geb108.html#DobzinskiMRS18
Florin Constantin
Christopher Harris
Samuel Ieong
Aranyak Mehta
Xi Tan
Optimizing Ad Refresh In Mobile App Advertising.
1399-1408
2018
WWW
https://doi.org/10.1145/3178876.3186045
conf/www/2018
db/conf/www/www2018.html#ConstantinHIMT18
Aranyak Mehta
Bo Waggoner
Morteza Zadimoghaddam
Online Stochastic Matching with Unequal Probabilities.
1388-1404
2015
SODA
https://doi.org/10.1137/1.9781611973730.92
conf/soda/2015
db/conf/soda/soda2015.html#MehtaWZ15
Gagan Aggarwal
Yang Cai 0001
Aranyak Mehta
George Pierrakos
Biobjective Online Bipartite Matching.
218-231
2014
WINE
https://doi.org/10.1007/978-3-319-13129-0_16
conf/wine/2014
db/conf/wine/wine2014.html#AggarwalCMP14
Aranyak Mehta
Online Matching and Ad Allocation.
265-368
2013
8
Found. Trends Theor. Comput. Sci.
4
https://doi.org/10.1561/0400000057
db/journals/fttcs/fttcs8.html#Mehta13
Yang Cai 0001
Mohammad Mahdian
Aranyak Mehta
Bo Waggoner
Designing Markets for Daily Deals.
82-95
2013
WINE
https://doi.org/10.1007/978-3-642-45046-4_8
conf/wine/2013
db/conf/wine/wine2013.html#CaiMMW13
Chinmay Karande
Aranyak Mehta
Ramakrishnan Srikant
Optimizing budget constrained spend in search advertising.
697-706
2013
WSDM
https://doi.org/10.1145/2433396.2433483
conf/wsdm/2013
db/conf/wsdm/wsdm2013.html#KarandeMS13
Yang Cai 0001
Mohammad Mahdian
Aranyak Mehta
Bo Waggoner
Designing Markets for Daily Deals.
2013
CoRR
http://arxiv.org/abs/1310.0548
abs/1310.0548
db/journals/corr/corr1310.html#CaiMMW13
Bahman Bahmani
Aranyak Mehta
Rajeev Motwani 0001
Online Graph Edge-Coloring in the Random-Order Arrival Model.
567-595
2012
8
Theory Comput.
1
https://doi.org/10.4086/toc.2012.v008a025
db/journals/toc/toc8.html#BahmaniMM12
Aranyak Mehta
Debmalya Panigrahi
Online Matching with Stochastic Rewards.
728-737
2012
FOCS
https://doi.org/10.1109/FOCS.2012.65
https://doi.ieeecomputersociety.org/10.1109/FOCS.2012.65
conf/focs/2012
db/conf/focs/focs2012.html#MehtaP12
Robert Krauthgamer
Aranyak Mehta
Atri Rudra
Pricing commodities.
602-613
2011
412
Theor. Comput. Sci.
7
https://doi.org/10.1016/j.tcs.2009.10.002
db/journals/tcs/tcs412.html#KrauthgamerMR11
Gagan Aggarwal
Gagan Goel
Chinmay Karande
Aranyak Mehta
Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations.
1253-1264
2011
SODA
https://doi.org/10.1137/1.9781611973082.95
http://dl.acm.org/citation.cfm?id=2133131
conf/soda/2011
db/conf/soda/soda2011.html#AggarwalGKM11
Chinmay Karande
Aranyak Mehta
Pushkar Tripathi
Online bipartite matching with unknown distributions.
587-596
2011
STOC
https://doi.org/10.1145/1993636.1993715
conf/stoc/2011
db/conf/stoc/stoc2011.html#KarandeMT11
Deeparnab Chakrabarty
Aranyak Mehta
Vijay V. Vazirani
Design is as Easy as Optimization.
270-286
2010
24
SIAM J. Discret. Math.
1
https://doi.org/10.1137/080735898
db/journals/siamdm/siamdm24.html#ChakrabartyMV10
Bahman Bahmani
Aranyak Mehta
Rajeev Motwani 0001
A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model.
31-39
2010
SODA
https://doi.org/10.1137/1.9781611973075.4
conf/soda/2010
db/conf/soda/soda2010.html#BahmaniMM10
Gagan Aggarwal
Gagan Goel
Chinmay Karande
Aranyak Mehta
Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations
http://arxiv.org/abs/1007.1271
2010
CoRR
abs/1007.1271
db/journals/corr/corr1007.html#abs-1007-1271
Mihail N. Kolountzakis
Richard J. Lipton
Evangelos Markakis
Aranyak Mehta
Nisheeth K. Vishnoi
On the Fourier spectrum of symmetric Boolean functions.
363-387
2009
29
Comb.
3
https://doi.org/10.1007/s00493-009-2310-z
db/journals/combinatorica/combinatorica29.html#KolountzakisLMMV09
Aranyak Mehta
Tim Roughgarden
Mukund Sundararajan
Beyond Moulin mechanisms.
125-155
2009
67
Games Econ. Behav.
1
https://doi.org/10.1016/j.geb.2008.06.005
db/journals/geb/geb67.html#MehtaRS09
Howard J. Karloff
Subhash Khot
Aranyak Mehta
Yuval Rabani
On Earthmover Distance, Metric Labeling, and 0-Extension.
371-387
2009
39
SIAM J. Comput.
2
https://doi.org/10.1137/070685671
db/journals/siamcomp/siamcomp39.html#KarloffKMR09
Constantinos Daskalakis
Aranyak Mehta
Christos H. Papadimitriou
A note on approximate Nash equilibria.
1581-1588
2009
410
Theor. Comput. Sci.
17
https://doi.org/10.1016/j.tcs.2008.12.031
db/journals/tcs/tcs410.html#DaskalakisMP09
Jon Feldman
Aranyak Mehta
Vahab S. Mirrokni
S. Muthukrishnan 0001
Online Stochastic Matching: Beating 1-1/e.
117-126
2009
FOCS
https://doi.org/10.1109/FOCS.2009.72
https://doi.ieeecomputersociety.org/10.1109/FOCS.2009.72
conf/focs/2009
db/conf/focs/focs2009.html#FeldmanMMM09
Gagan Aggarwal
Gagan Goel
Aranyak Mehta
Efficiency of (revenue-)optimal mechanisms.
235-242
2009
EC
https://doi.org/10.1145/1566374.1566408
conf/sigecom/2009
db/conf/sigecom/sigecom2009.html#AggarwalGM09
Jon Feldman
Aranyak Mehta
Vahab S. Mirrokni
S. Muthukrishnan 0001
Online Stochastic Matching: Beating 1-1/e
http://arxiv.org/abs/0905.4100
2009
CoRR
abs/0905.4100
db/journals/corr/corr0905.html#abs-0905-4100
Gagan Aggarwal
Gagan Goel
Aranyak Mehta
Efficiency of (Revenue-)Optimal Mechanisms
http://arxiv.org/abs/0906.1019
2009
CoRR
abs/0906.1019
db/journals/corr/corr0906.html#abs-0906-1019
Subhash Khot
Richard J. Lipton
Evangelos Markakis
Aranyak Mehta
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions.
3-18
2008
52
Algorithmica
1
https://doi.org/10.1007/s00453-007-9105-7
db/journals/algorithmica/algorithmica52.html#KhotLMM08
Robert Krauthgamer
Aranyak Mehta
Vijayshankar Raman
Atri Rudra
Greedy List Intersection.
1033-1042
2008
ICDE
https://doi.org/10.1109/ICDE.2008.4497512
https://doi.ieeecomputersociety.org/10.1109/ICDE.2008.4497512
conf/icde/2008
db/conf/icde/icde2008.html#KrauthgamerMRR08
Shahar Dobzinski
Aranyak Mehta
Tim Roughgarden
Mukund Sundararajan
Is Shapley Cost Sharing Optimal?
327-336
2008
SAGT
https://doi.org/10.1007/978-3-540-79309-0_29
conf/sagt/2008
db/conf/sagt/sagt2008.html#DobzinskiMRS08
Gagan Goel
Aranyak Mehta
Online budgeted matching in random input models with applications to Adwords.
982-991
2008
SODA
http://dl.acm.org/citation.cfm?id=1347082.1347189
conf/soda/2008
db/conf/soda/soda2008.html#GoelM08
Aranyak Mehta
Amin Saberi
Umesh V. Vazirani
Vijay V. Vazirani
AdWords and generalized online matching.
2007
54
J. ACM
5
https://doi.org/10.1145/1284320.1284321
https://www.wikidata.org/entity/Q56609588
db/journals/jacm/jacm54.html#MehtaSVV07
22
Sanjiv Kapoor
Aranyak Mehta
Vijay V. Vazirani
An auction-based market equilibrium algorithm for a production model.
153-164
2007
378
Theor. Comput. Sci.
2
https://doi.org/10.1016/j.tcs.2007.02.018
db/journals/tcs/tcs378.html#KapoorMV07
Rob LeGrand
Evangelos Markakis
Aranyak Mehta
Some results on approximating the minimax solution in approval voting.
198
2007
conf/atal/2007
AAMAS
https://doi.org/10.1145/1329125.1329365
https://www.wikidata.org/entity/Q56038381
db/conf/atal/aamas2007.html#LeGrandMM07
Aranyak Mehta
Tim Roughgarden
Mukund Sundararajan
Beyond moulin mechanisms.
1-10
2007
conf/sigecom/2007
EC
https://doi.org/10.1145/1250910.1250912
db/conf/sigecom/sigecom2007.html#MehtaRS07
Constantinos Daskalakis
Aranyak Mehta
Christos H. Papadimitriou
Progress in approximate nash equilibria.
355-358
2007
conf/sigecom/2007
EC
https://doi.org/10.1145/1250910.1250962
db/conf/sigecom/sigecom2007.html#DaskalakisMP07
Robert Krauthgamer
Aranyak Mehta
Atri Rudra
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations.
1-14
2007
conf/waoa/2007
WAOA
https://doi.org/10.1007/978-3-540-77918-6_1
db/conf/waoa/waoa2007.html#KrauthgamerMR07
Gagan Goel
Aranyak Mehta
Adwords Auctions with Decreasing Valuation Bids.
335-340
2007
conf/wine/2007
WINE
https://doi.org/10.1007/978-3-540-77105-0_35
db/conf/wine/wine2007.html#GoelM07
Aranyak Mehta
Scott Shenker
Vijay V. Vazirani
Posted price profit maximization for multicast by approximating fixed points.
150-164
2006
58
J. Algorithms
2
https://doi.org/10.1016/j.jalgor.2004.08.002
db/journals/jal/jal58.html#MehtaSV06
Deeparnab Chakrabarty
Aranyak Mehta
Vijay V. Vazirani
Design Is as Easy as Optimization.
477-488
2006
conf/icalp/2006-1
ICALP (1)
https://doi.org/10.1007/11786986_42
db/conf/icalp/icalp2006-1.html#ChakrabartyMV06
Howard J. Karloff
Subhash Khot
Aranyak Mehta
Yuval Rabani
On earthmover distance, metric labeling, and 0-extension.
547-556
2006
conf/stoc/2006
STOC
https://doi.org/10.1145/1132516.1132595
db/conf/stoc/stoc2006.html#KarloffKMR06
Constantinos Daskalakis
Aranyak Mehta
Christos H. Papadimitriou
A Note on Approximate Nash Equilibria.
297-306
2006
conf/wine/2006
WINE
https://doi.org/10.1007/11944874_27
db/conf/wine/wine2006.html#DaskalakisMP06
Parikshit Gopalan
Howard J. Karloff
Aranyak Mehta
Milena Mihail
Nisheeth K. Vishnoi
Caching with Expiration Times for Internet Applications.
2005
2
Internet Math.
2
db/journals/im/im2.html#GopalanKMMV05
https://doi.org/10.1080/15427951.2005.10129102
165-184
Richard J. Lipton
Evangelos Markakis
Aranyak Mehta
Nisheeth K. Vishnoi
On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas.
112-119
2005
conf/coco/2005
CCC
https://doi.org/10.1109/CCC.2005.19
https://doi.ieeecomputersociety.org/10.1109/CCC.2005.19
db/conf/coco/coco2005.html#LiptonMMV05
Aranyak Mehta
Amin Saberi
Umesh V. Vazirani
Vijay V. Vazirani
AdWords and Generalized On-line Matching.
264-273
2005
conf/focs/2005
FOCS
https://doi.org/10.1109/SFCS.2005.12
https://doi.ieeecomputersociety.org/10.1109/SFCS.2005.12
db/conf/focs/focs2005.html#MehtaSVV05
Deeparnab Chakrabarty
Aranyak Mehta
Viswanath Nagarajan
Fairness and optimality in congestion games.
52-57
2005
conf/sigecom/2005
EC
https://doi.org/10.1145/1064009.1064015
db/conf/sigecom/sigecom2005.html#ChakrabartyMN05
Subhash Khot
Richard J. Lipton
Evangelos Markakis
Aranyak Mehta
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions.
92-101
2005
conf/wine/2005
WINE
https://doi.org/10.1007/11600930_10
db/conf/wine/wine2005.html#KhotLMM05
Sanjiv Kapoor
Aranyak Mehta
Vijay V. Vazirani
An Auction-Based Market Equilibrium Algorithm for a Production Model.
102-111
2005
conf/wine/2005
WINE
https://doi.org/10.1007/11600930_11
db/conf/wine/wine2005.html#KapoorMV05
Kamal Jain
Aranyak Mehta
Kunal Talwar
Vijay V. Vazirani
A Simple Characterization for Truth-Revealing Single-Item Auctions.
122-128
2005
conf/wine/2005
WINE
https://doi.org/10.1007/11600930_13
db/conf/wine/wine2005.html#JainMTV05
Howard J. Karloff
Subhash Khot
Aranyak Mehta
Yuval Rabani
On earthmover distance, metric labeling, and 0-extension
Electron. Colloquium Comput. Complex.
2005
TR05
TR05-064
db/journals/eccc/eccc12.html#TR05-064
https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-064/index.html
Aranyak Mehta
Vijay V. Vazirani
Randomized truthful auctions of digital goods are randomizations over truthful auctions.
120-124
2004
conf/sigecom/2004
EC
https://doi.org/10.1145/988772.988791
db/conf/sigecom/sigecom2004.html#MehtaV04
Parikshit Gopalan
Richard J. Lipton
Aranyak Mehta
Randomized Time-Space Tradeoffs for Directed Graph Connectivity.
208-216
https://doi.org/10.1007/978-3-540-24597-1_18
2003
conf/fsttcs/2003
FSTTCS
db/conf/fsttcs/fsttcs2003.html#GopalanLM03
Richard J. Lipton
Evangelos Markakis
Aranyak Mehta
Playing large games using simple strategies.
36-41
2003
conf/sigecom/2003
EC
https://doi.org/10.1145/779928.779933
db/conf/sigecom/sigecom2003.html#LiptonMM03
Aranyak Mehta
Scott Shenker
Vijay V. Vazirani
Profit-maximizing multicast pricing by approximating fixed points.
218-219
2003
conf/sigecom/2003
EC
https://doi.org/10.1145/779928.779967
db/conf/sigecom/sigecom2003.html#MehtaSV03
Parikshit Gopalan
Howard J. Karloff
Aranyak Mehta
Milena Mihail
Nisheeth K. Vishnoi
Caching with expiration times.
540-547
2002
conf/soda/2002
SODA
http://dl.acm.org/citation.cfm?id=545381.545454
db/conf/soda/soda2002.html#GopalanKMMV02
Bharat Adsul
Aranyak Mehta
Milind A. Sohoni
Keeping Track of the Latest Gossip in Shared Memory Systems.
477-488
2000
conf/fsttcs/2000
FSTTCS
https://doi.org/10.1007/3-540-44450-5_39
db/conf/fsttcs/fsttcs2000.html#AdsulMS00
Bharat Adsul
Gagan Aggarwal
Yeganeh Alimohammadi
Kamyar Azizzadenesheli
Ashwinkumar Badanidiyuru
Bahman Bahmani
Kshipra Bhawalkar
Yang Cai 0001
Deeparnab Chakrabarty
Florin Constantin
Trung Dang
Constantinos Daskalakis
Shahar Dobzinski
Jon Feldman
Zhe Feng 0004
Gagan Goel
Parikshit Gopalan
Guru Guruganesh
Christopher Harris
Samuel Ieong
Kamal Jain
Sanjiv Kapoor
Chinmay Karande
Howard J. Karloff
Subhash Khot
Mihail N. Kolountzakis
Weiwei Kong
Robert Krauthgamer
Rob LeGrand
Christopher Liaw
Richard J. Lipton
Mohammad Mahdian
Evangelos Markakis
Milena Mihail
Vahab S. Mirrokni
Divyarthi Mohan
Rajeev Motwani 0001
S. Muthukrishnan 0001
Uri Nadav
Viswanath Nagarajan
Debmalya Panigrahi
Christos H. Papadimitriou
Andrés Perlroth
George Pierrakos
Christos-Alexandros PsomasAlexandros Psomas 0001
Yuval Rabani
Vijayshankar Raman
Timothy RoughgardenTim Roughgarden
Aviad Rubinstein
Atri Rudra
Amin Saberi
Abhishek Sethi
Scott Shenker
D. Sivakumar 0001
Milind A. Sohoni
Ramakrishnan Srikant
Mukund Sundararajan
Kunal Talwar
Xi Tan
Pushkar Tripathi
Umesh V. Vazirani
Vijay V. Vazirani
Nisheeth K. Vishnoi
Bo Waggoner
Di Wang
Kangning Wang
Morteza Zadimoghaddam
Qian Zhang
Mingfei Zhao
Wennan Zhu
Goran Zuzic