Nikhil devanur thesis

nikhil devanur thesis Visitor at microsoft research redmond, hosted by nikhil devanur, 11{18/3/2012 memphis-budapest summer school in combinatorics, organized by b ela bollob as, 7{20/8/2011 synergistic activities.

- excellence in phd thesis award, 2012, iit-bombay - google india anita borg memorial scholarship 2012 - ibm phd award in 2010 (awarded annually to an indian phd student) (with nikhil devanur, jugal garg, vijay v vazirani, and sadra yazdanbod) - 2017 cls: new problems and completeness (with john fearnley, spencer gordon, and rahul. Thesis: optimization in the private value model: competitive analysis applied to auction design advisor: anna karlin ms in computer science university of washington, seattle, wa with nikhil devanur and bach ha prior-independent mechanisms for scheduling stoc4 2013 with shuchi chawla, david malec, and balu sivan. Janardhan kulkarni hi i got phd from the department of computer science at duke university my adviser was take a look at my papers below or my research statement or these slides or the abstract of my thesis contact: kulkarni at cs dot duke dot edu with nikhil devanur spaa 2018.

Theory of computation @ uw theory | cse | msr alg | msr ml+o nikhil devanur (msr) fundamental algorithms and algorithmic game theory maryam fazel (uw ee yin tat lee wins the a w tucker prize for his thesis faster algorithms for convex and combinatorial optimization. Constantinos daskalakis, nikhil devanur, s matthew weinberg: revenue maximization and ex-post budget constraints in the 16th annual acm conference on economics and computation. Nikhil devanur, nima haghpanah, alex psomas one page abstract in ec 2017 sequential mechanisms with ex-post participation guarantees itai ashlagi, constantinos daskalakis, nima haghpanah one page abstract in ec 2016 when is pure bundling optimal thesis optimal multi-parameter auction design.

This thesis would not be possible without my collaborators: frank ban, the jbc, nikhil devanur, eric friedman, ali ghodsi, vasilis gkatzelis, nima haghpanah, zhiyi huang, ka- mal jain, thomas kesselheim, siqi liu, vangelis markakis, christos papadimitriou, sergios. Algorithms and mechanism design for multi-agent systems a thesis presented to the academic faculty by chinmay karande in partial fulfillment of the requirements for the degree nikhil devanur, deeparnab chakrabarty, gagan goel, lei wang and pushkar tripathi. Thesis: optimization in the private value model: competitive analysis applied to auction design design with nikhil devanur ec 2009 selling ad campaigns: online algorithms with cancellations ec 2009 curriculum vitae jason d hartline refereed conference papers (cont) truthful and competitive double auctions. Journal of machine learning research 2017 see also an phd thesis, carnegie mellon university, 2008 winner of the cmu scs distinguished dissertation award with nikhil devanur, jason d hartline, and kunal talwar technical report, cmu-cs-07-154, 2007. With nikhil devanur and zhiyi huang, in proceedings of ec ’17 [pdf] 3\truth and regret in online scheduling, with nikhil devanur, shuchi chawla, and janardhan kulkarni, in proceedings of ec ’17 [pdf.

A substantial part of this thesis has been co-authored with nikhil devanur, subhash khot and dick lipton i am grateful to them for allowing me to use our results i obtained. Rad niazadeh (راد نیازاده) motwani postdoctoral researcher, nikhil devanur and zhiyi huang, in proc 18th acm conference on economics and computation (ec 2017), phd thesis (under professor robert kleinberg), cornell university, summer 2017. Nikhil devanur, jamie morgenstern, vasilis syrgkanis, s matthew weinberg ec 2015 learning what's going on: reconstruction preferences and priorities from opaque transactions. I am now at microsoft research, redmond take a look at my papers or my research statement or these slides or the abstract of my thesis projects publications videos other research interests approximation algorithms minimizing general delay costs on unrelated machineswith nikhil devanur (submitted) new results on online vector. Visitor at microsoft research redmond, hosted by nikhil devanur, 11{18/3/2012 memphis-budapest summer school in combinatorics, organized by b ela bollob as, 7{20/8/2011 math competition and website organization.

Nikhil devanur date: may 30, 2003 time: 1:00-3:00pm room: coc 358 hardness of svp in l_2 norm the svp is the problem of finding the shortest non-zero vector in a lattice. Sourav chakraborty chennai mathematical institute (cmi) phone: ++91 893 921 9122 thesis title: sensitivity, block sensitivity and certi cate complexity of boolean functions market clearance pricing in a metric -joint work with nikhil devanur and chinmay karande the sixth workshop on internet & network economics (wine 2010), pages: 496. A fundamental computational challenge that arises in the operation of online systems, services, and platforms is that of resource allocation broadly defined, a resource allocation problem is one where a set of users generate demands, which then have to be satisfied using a limited set of resources. Yiling chen, nikhil r devanur, david pennock, and jennifer wortman vaughan michael kearns, yuriy nevmyvaka, and jennifer wortman vaughan in the 25th conference on uncertainty in artificial intelligence (uai 2009) winner of the best student paper award at uai phd thesis learning from collective preferences, behavior, and beliefs.

Thesis- phd thesis: models of query complexity for boolean functions - master's joint work with nikhil devanur wine 2009 preliminary version appeared at the forth workshop on ad auctions 2008 - hardness and algorithms for rainbow connectivity joint work with eldar fischer, arie matsliah and raphael yuster. Thesis: on the existence of pure nash equilibria in graphical games with succinct description advisor: constantinos daskalakis, nikhil devanur and matt weinberg: revenue maximization and ex-post budget constraints in the 16th acm conference on economics and computation (ec), ec 2015.

Nikhil devanur, jugal garg, ruta mehta, vijay vazirani and sadra yazdanbod a new class of combinatorial markets with covering constraints: algorithms and applications to appear in the proceedings of the 29th annual acm-siam symposium on discrete algorithms (soda), 2018. Temporal relaxations of instantaneous fairness - with inigo goiri, angela jiang, nikhil devanur, srikanth kandula, and ishai menache submitted to eurosys 2017. Jaime teevan is chief scientist for microsoft's experiences and devices, where she is helping microsoft create the future of productivity previously she was the technical advisor to microsoft's. Shipra agrawal c-702 mantri sarovar, hsr layout [email protected] bangalore 560102 (+91) 9901212956 thesis title \optimization under uncertainty: bounding the correlation gap (with n r devanur) in proceedings of the 21st annual acm-siam symposium on discrete algorithms.

nikhil devanur thesis Visitor at microsoft research redmond, hosted by nikhil devanur, 11{18/3/2012 memphis-budapest summer school in combinatorics, organized by b ela bollob as, 7{20/8/2011 synergistic activities.
Nikhil devanur thesis
Rated 5/5 based on 27 review

2018.