Items where Author is "Roughgarden, Tim"

Budish, Eric, Lewis-Pye, Andrew and Roughgarden, Tim (2024) The economic limits of permissionless consensus. ACM Transactions on Economics and Computation. ISSN 2167-8375 (In Press)

Lewis-Pye, Andrew and Roughgarden, Tim (2023) Byzantine generals in the permissionless setting. In: Baldimtsi, Foteini and Cachin, Christian, (eds.) Financial Cryptography and Data Security: 27th International Conference, FC 2023, Bol, Brač, Croatia, May 1–5, 2023, Revised Selected Papers, Part I. Lecture Notes in Computer Science. Springer-Verlag, Berlin, DE, 21 - 37. ISBN 9783031477539

Behera, Balaram, Husić, Edin ORCID: 0000-0002-6708-5112, Jain, Shweta, Roughgarden, Tim and Seshadhri, C. (2022) FPT algorithms for finding near-cliques in c-closed graphs. In: Braverman, Mark, (ed.) 13th Innovations in Theoretical Computer Science Conference, ITCS 2022. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 17:1 - 17:24. ISBN 9783959772174

Lewis-Pye, Andrew and Roughgarden, Tim (2021) How does blockchain security dictate blockchain implementation? In: CCS 2021 - Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. Proceedings of the ACM Conference on Computer and Communications Security. ACM Press, USA, 1006 - 1019. ISBN 9781450384544

Dütting, Paul, Roughgarden, Tim and Talgam-Cohen, Inbal (2021) The complexity of contracts. SIAM Journal on Computing, 50 (1). 211 - 254. ISSN 0097-5397

Dütting, Paul, Roughgarden, Tim and Talgam-Cohen, Inbal (2020) The complexity of contracts. In: Chawla, Shuchi, (ed.) Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 2688 - 2707. ISBN 9781611975994

Dütting, Paul, Roughgarden, Tim and Talgam-Cohen, Inbal (2019) Simple versus optimal contracts. In: 20th ACM conference on Economics and Computation, 2019-06-24 - 2019-06-28, Phoenix, United States, USA.

Barmpalias, George, Huang, Neng, Lewis-Pye, Andrew, Li, Angsheng, Li, Xuechen, Pan, Yicheng and Roughgarden, Tim (2019) The idemetric property: when most distances are (almost) the same. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 475 (2222). ISSN 1364-5021

Dütting, Paul, Gkatzelis, Vasilis and Roughgarden, Tim (2017) The performance of deferred-acceptance auctions. Mathematics of Operations Research, 42 (4). pp. 897-914. ISSN 0364-765X

Dütting, Paul, Talgam-Cohen, Inbal and Roughgarden, Tim (2017) Modularity and greed in double auctions. Games and Economic Behavior, 105. pp. 59-83. ISSN 0899-8256

Dütting, Paul, Gkatzelis, Vasillis and Roughgarden, Tim (2015) Spectrum auctions: greed is good… if you do it well! In: LSE Research Festival 2015, 2015-05-21, London, United Kingdom, GBR.

Dütting, Paul, Talgam-Cohen, Inbal and Roughgarden, Tim (2014) Modularity and greed in double auctions. In: Babaioff, Moshe, Conitzer, Vincent and Easley, David, (eds.) EC '14: Proceedings of the Fifteenth ACM Conference on Economics and Computation. Association for Computing Machinery, New York, USA, pp. 241-258. ISBN 9781450325653

Dütting, Paul, Gkatzelis, Vasilis and Roughgarden, Tim (2014) The performance of deferred-acceptance auctions. In: Babaioff, Moshe, Conitze, Vincent and Easley, David, (eds.) Proceedings of the 15th ACM Conference on Economics and Computation. Association for Computing Machinery, New York, NY, pp. 187-204. ISBN 9781450325653