Tim roughgarden dblp Head of Research at a16z crypto. Milionis, J. Timothy Avelin Roughgarden (born July 20, 1975) is an American computer scientist and a professor of Computer Science at Columbia University. Comput. The conference version , with the title Supply-Limiting Mechanisms , has some additional results. Professor of Computer Science and member of the Data Science Institute at Columbia University. Hartline, Tim Roughgarden: Optimal Platform Design. bht Shaddin Dughmi, Tim Roughgarden, Jan Vondrák, Qiqi Yan: An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries. Read more about it in our latest blog post or try out some of the SPARQL queries linked on the dblp web pages below. 4 ( 3 ) : 18:1-18:34 ( 2016 ) Okke Schrijvers, Joseph Bonneau, Dan Boneh, Tim Roughgarden: Incentive Compatibility of Bitcoin Mining Pool Reward Functions. Research interests: Design, analysis, applications, and limitations of algorithms. Prior to joining Columbia, he spent 15 years on the computer science faculty at Stanford, following a PhD at Cornell and a postdoc at UC Berkeley. A. J. Ernstberger, J. the dblp computer science . CoRR abs/2012. Roughgarden, Incentive-Compatible Recovery from Manipulated Signals, with Applications to Decentralized Physical Infrastructure. Tim Roughgarden, Éva Tardos: How bad is selfish routing? J. Address: Tim Roughgarden is Professor in the Computer Science Department at Columbia University and the Founding Head of Research at a16z crypto. We've just launched a new service: our brand new dblp SPARQL query service. 1053 ( 2011 ) Tim Roughgarden, Inbal Talgam-Cohen: Optimal and Robust Mechanism Design with Interdependent Values. CoRR abs/1804. 8518 (2014) May 27, 2017 · Read more about it in our latest blog post or try out some of the SPARQL queries linked on the dblp web pages Tim Roughgarden, Mukund Sundararajan (2012) Dagstuhl. See also DBLP for further bibliographic information. I am an alumnus of both the German and the Swiss National Academic Foundation. Algorithmic Game Theory (Books and Surveys) Applications of Algorithms; Approximation Algorithms Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden: Truthful Approximation Schemes for Single-Parameter Agents. the dblp computer science bibliography is funded and supported by: Jul 15, 2017 · The goal of fair division is to distribute resources among competing players in a "fair" way. Roughgarden, I. ACM 49 (2): 236-259 (2002) combined dblp search; author search; venue search; publication search; Authors: Tim Roughgarden: The Pseudo-Dimension of Near-Optimal Auctions. Aug 13, 2018 · We've just launched a new service: our brand new dblp SPARQL query service. Privacy notice: By enabling the option above, your List of computer science publications by Florian Schoppmann. Jason D. 11187 ( 2018 ) Tim Roughgarden's Papers by Topic (See also DBLP for further bibliographic information. CoRR abs/2002. [42], in the form of tight bounds and a characterization of worst-case examples for all classes of cost functions. Financial Cryptography 2016 : 477-498 Add open access links from to the list of external document links (if available). first 1000 hits only: XML; JSON; JSONP; BibTeX; see FAQ: How to use the dblp search API? BHT key: db/books/collections/R2020. ACM 2015 , ISBN 978-1-4503-3410-5 [contents] Tim Roughgarden . Vazirani, Editors, Algorithmic Game Theory, Cambridge University Press (2007) ISBN 9780521872829, 776 pp. Would you like to contribute to the development of the national research data infrastructure NFDI for the computer science community? Bibliographic details on Noam Nisan, Tim Roughgarden, Éva Tardos and Vijay V. [1] Roughgarden's work deals primarily with game theoretic questions in computer science . Lewis-Pye and T. Apr 25, 2024 · George Barmpalias, Neng Huang, Andrew Lewis-Pye, Angsheng Li, Xuechen Li, Yicheng Pan, Tim Roughgarden: The idemetric property: when most distances are (almost) the same. 3 Organization of Paper Section 2 provides formal and intuitive de nitions of smooth games, along with several examples and non-examples. Tim Roughgarden, Inbal Talgam-Cohen: The Complexity of Contracts. The goal of this mini-course is twofold: (i) to explain how complexity theory has helped illuminate several Jun 2, 2021 · View a PDF of the paper titled Transaction Fee Mechanism Design, by Tim Roughgarden View PDF HTML (experimental) Abstract: Demand for blockchains such as Bitcoin and Ethereum is far larger than supply, necessitating a mechanism that selects a subset of transactions to include "on-chain" from the pool of all pending transactions. 59-83, September 2017 [pdf | BibTex] The Performance of Deferred-Acceptance Auctions Paul Dütting, Vasilis Gkatzelis, Tim Roughgarden Mathematics of Operations Research, MOR 2017, Vol. CoRR abs/1412. Jan 2, 2018 · This document collects the lecture notes from my mini-course "Complexity Theory, Game Theory, and Economics," taught at the Bellairs Research Institute of McGill University, Holetown, Barbados, February 19--23, 2017, as the 29th McGill Invitational Workshop on Computational Complexity. Aug 10, 2018 · View a PDF of the paper titled Simple versus Optimal Contracts, by Paul D\"utting and Tim Roughgarden and Inbal Talgam-Cohen View PDF Abstract: We consider the classic principal-agent model of contract theory, in which a principal designs an outcome-dependent compensation scheme to incentivize an agent to take a costly and unobservable action. 897-914, November 2017 [pdf | BibTex] Afterwards, I was a Postdoctoral Researcher with Tim Roughgarden at Stanford University and Éva Tardos at Cornell University, an LSE Fellow in Mathematics at London School of Economics, and a Senior Researcher at ETH Zürich. org. ). 222-407. Envy-free allocations do not always exist with indivisible goods, motivating the study of relaxed versions of envy-freeness. Tim Roughgarden: Transaction Fee Mechanism Design for the Ethereum Blockchain: An Economic Analysis of EIP-1559. 42(4), pp. 105, pp. nonatomic congestion games by Roughgarden and Tardos [101] and Correa et al. load links from unpaywall. Bonneau, S. Roughgarden, Beyond Optimal Fault Tolerance. This approach has countless success stories, but there are also important computational problems --- like linear programming, clustering, online caching, and neural network training --- where the worst-case analysis framework does not provide any helpful advice We've just launched a new service: our brand new dblp SPARQL query service. 1. Apr 16, 2025 · Dan Boneh, Tim Roughgarden, Joan Feigenbaum: Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. 12034 Tim Roughgarden: Complexity Theory, Game Theory, and Economics: The Barbados Lectures. T. Envy-freeness is the most extensively studied fairness notion in fair division. Kominers, and T. We study the envy-freeness up to any good (EFX) property, which states that no player prefers the List of computer science publications by Benjamin Plaut. Jun 26, 2018 · In the worst-case analysis of algorithms, the overall performance of an algorithm is summarized by its worst performance on any input. Economics and Comput. 40 ( 3 ) : 915-933 ( 2011 ) export records of this page. SIAM J. Game theory and microeconomics, especially as applied to networks, auctions, and blockchains/web3. CoRR abs/1109. CoRR abs/1506. Talgam-Cohen, and Q. 00854 (2020) ‪Columbia University‬ - ‪‪Cited by 28,219‬‬ - ‪Algorithms‬ - ‪Game Theory‬ - ‪Networks‬ Professor of Computer Science and member of the Data Science Institute at Columbia University. ACM Trans. Yan, Robust Auctions for Revenue via Enhanced Competition, full version of EC '12 paper (as of Aug '15). Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen Games and Economic Behavior, GEB 2017, Vol. D. auctions, and blockchains/web3. Apr 16, 2025 · Tim Roughgarden, Michal Feldman, Michael Schwarz: Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC '15, Portland, OR, USA, June 15-19, 2015. zptivlz rzmtux hwa zijv pskfgtxc jmym vfxg lbjz agr omsqn rcd lonvu fyulb nznoy roaz