Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Timothy Roughgarden
@inproceedings{DBLP:conf/innovations/MilionisMR24, author = {Jason Milionis and Ciamac C. Moallemi and Tim Roughgarden}, editor = {Venkatesan Guruswami}, title = {A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers}, booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS} 2024, January 30 to February 2, 2024, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {287}, pages = {81:1--81:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2024}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.81}, doi = {10.4230/LIPICS.ITCS.2024.81}, timestamp = {Wed, 24 Jan 2024 15:25:09 +0100}, biburl = {https://dblp.org/rec/conf/innovations/MilionisMR24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2401-12120, author = {Maryam Bahrani and Pranav Garimidi and Tim Roughgarden}, title = {Centralization in Block Building and Proposer-Builder Separation}, journal = {CoRR}, volume = {abs/2401.12120}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2401.12120}, doi = {10.48550/ARXIV.2401.12120}, eprinttype = {arXiv}, eprint = {2401.12120}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2401-12120.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2402-09321, author = {Hao Chung and Tim Roughgarden and Elaine Shi}, title = {Collusion-Resilience in Transaction Fee Mechanism Design}, journal = {CoRR}, volume = {abs/2402.09321}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2402.09321}, doi = {10.48550/ARXIV.2402.09321}, eprinttype = {arXiv}, eprint = {2402.09321}, timestamp = {Tue, 20 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2402-09321.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/ChungRS24, author = {Hao Chung and Tim Roughgarden and Elaine Shi}, title = {Collusion-Resilience in Transaction Fee Mechanism Design}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {237}, year = {2024}, url = {https://eprint.iacr.org/2024/237}, timestamp = {Mon, 18 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/ChungRS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/BahraniGR24, author = {Maryam Bahrani and Pranav Garimidi and Tim Roughgarden}, title = {Transaction Fee Mechanism Design in a Post-MEV World}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {331}, year = {2024}, url = {https://eprint.iacr.org/2024/331}, timestamp = {Mon, 18 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/BahraniGR24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aft/BahraniGR23, author = {Maryam Bahrani and Pranav Garimidi and Tim Roughgarden}, editor = {Joseph Bonneau and S. Matthew Weinberg}, title = {When Bidders Are DAOs}, booktitle = {5th Conference on Advances in Financial Technologies, {AFT} 2023, October 23-25, 2023, Princeton, NJ, {USA}}, series = {LIPIcs}, volume = {282}, pages = {21:1--21:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.AFT.2023.21}, doi = {10.4230/LIPICS.AFT.2023.21}, timestamp = {Wed, 18 Oct 2023 16:53:28 +0200}, biburl = {https://dblp.org/rec/conf/aft/BahraniGR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fc/LewisPyeR23, author = {Andrew Lewis{-}Pye and Tim Roughgarden}, editor = {Foteini Baldimtsi and Christian Cachin}, title = {Byzantine Generals in the Permissionless Setting}, booktitle = {Financial Cryptography and Data Security - 27th International Conference, {FC} 2023, Bol, Bra{\v{c}}, Croatia, May 1-5, 2023, Revised Selected Papers, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {13950}, pages = {21--37}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-47754-6\_2}, doi = {10.1007/978-3-031-47754-6\_2}, timestamp = {Sun, 10 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/fc/LewisPyeR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fc/MilionisMR23a, author = {Jason Milionis and Ciamac C. Moallemi and Tim Roughgarden}, editor = {Aleksander Essex and Shin'ichiro Matsuo and Oksana Kulyk and Lewis Gudgeon and Ariah Klages{-}Mundt and Daniel Perez and Sam Werner and Andrea Bracciali and Geoff Goodell}, title = {Extended Abstract: The Effect of Trading Fees on Arbitrage Profits in Automated Market Makers}, booktitle = {Financial Cryptography and Data Security. {FC} 2023 International Workshops - Voting, CoDecFin, DeFi, WTSC, Bol, Bra{\v{c}}, Croatia, May 5, 2023, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {13953}, pages = {262--265}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-48806-1\_17}, doi = {10.1007/978-3-031-48806-1\_17}, timestamp = {Mon, 18 Dec 2023 16:44:30 +0100}, biburl = {https://dblp.org/rec/conf/fc/MilionisMR23a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fc/MilionisMR23, author = {Jason Milionis and Ciamac C. Moallemi and Tim Roughgarden}, editor = {Foteini Baldimtsi and Christian Cachin}, title = {Complexity-Approximation Trade-Offs in Exchange Mechanisms: AMMs vs. LOBs}, booktitle = {Financial Cryptography and Data Security - 27th International Conference, {FC} 2023, Bol, Bra{\v{c}}, Croatia, May 1-5, 2023, Revised Selected Papers, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {13950}, pages = {326--343}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-47754-6\_19}, doi = {10.1007/978-3-031-47754-6\_19}, timestamp = {Sun, 10 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/fc/MilionisMR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/GrahamLR23, author = {Devon R. Graham and Kevin Leyton{-}Brown and Tim Roughgarden}, editor = {Andreas Krause and Emma Brunskill and Kyunghyun Cho and Barbara Engelhardt and Sivan Sabato and Jonathan Scarlett}, title = {Formalizing Preferences Over Runtime Distributions}, booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July 2023, Honolulu, Hawaii, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {202}, pages = {11659--11682}, publisher = {{PMLR}}, year = {2023}, url = {https://proceedings.mlr.press/v202/graham23a.html}, timestamp = {Mon, 28 Aug 2023 17:23:08 +0200}, biburl = {https://dblp.org/rec/conf/icml/GrahamLR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/GrahamLR23, author = {Devon R. Graham and Kevin Leyton{-}Brown and Tim Roughgarden}, editor = {Alice Oh and Tristan Naumann and Amir Globerson and Kate Saenko and Moritz Hardt and Sergey Levine}, title = {Utilitarian Algorithm Configuration}, booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023}, year = {2023}, url = {http://papers.nips.cc/paper\_files/paper/2023/hash/d98d9cef0c189f1db95f1d94652f7051-Abstract-Conference.html}, timestamp = {Fri, 01 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/GrahamLR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/NeymanR23, author = {Eric Neyman and Tim Roughgarden}, editor = {Alice Oh and Tristan Naumann and Amir Globerson and Kate Saenko and Moritz Hardt and Sergey Levine}, title = {No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling}, booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023}, year = {2023}, url = {http://papers.nips.cc/paper\_files/paper/2023/hash/44ecfb60950e868a13172b935b7964a9-Abstract-Conference.html}, timestamp = {Fri, 01 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/NeymanR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2302-11652, author = {Jason Milionis and Ciamac C. Moallemi and Tim Roughgarden}, title = {Complexity-Approximation Trade-offs in Exchange Mechanisms: AMMs vs. LOBs}, journal = {CoRR}, volume = {abs/2302.11652}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2302.11652}, doi = {10.48550/ARXIV.2302.11652}, eprinttype = {arXiv}, eprint = {2302.11652}, timestamp = {Tue, 28 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2302-11652.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2303-00208, author = {Jason Milionis and Ciamac C. Moallemi and Tim Roughgarden}, title = {A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers}, journal = {CoRR}, volume = {abs/2303.00208}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2303.00208}, doi = {10.48550/ARXIV.2303.00208}, eprinttype = {arXiv}, eprint = {2303.00208}, timestamp = {Mon, 06 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2303-00208.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2304-14701, author = {Andrew Lewis{-}Pye and Tim Roughgarden}, title = {Permissionless Consensus}, journal = {CoRR}, volume = {abs/2304.14701}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2304.14701}, doi = {10.48550/ARXIV.2304.14701}, eprinttype = {arXiv}, eprint = {2304.14701}, timestamp = {Thu, 04 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2304-14701.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2306-17099, author = {Maryam Bahrani and Pranav Garimidi and Tim Roughgarden}, title = {When Bidders Are DAOs}, journal = {CoRR}, volume = {abs/2306.17099}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2306.17099}, doi = {10.48550/ARXIV.2306.17099}, eprinttype = {arXiv}, eprint = {2306.17099}, timestamp = {Mon, 03 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2306-17099.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2307-01686, author = {Maryam Bahrani and Pranav Garimidi and Tim Roughgarden}, title = {Transaction Fee Mechanism Design with Active Block Producers}, journal = {CoRR}, volume = {abs/2307.01686}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2307.01686}, doi = {10.48550/ARXIV.2307.01686}, eprinttype = {arXiv}, eprint = {2307.01686}, timestamp = {Mon, 10 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2307-01686.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2310-20401, author = {Devon R. Graham and Kevin Leyton{-}Brown and Tim Roughgarden}, title = {Utilitarian Algorithm Configuration}, journal = {CoRR}, volume = {abs/2310.20401}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2310.20401}, doi = {10.48550/ARXIV.2310.20401}, eprinttype = {arXiv}, eprint = {2310.20401}, timestamp = {Fri, 03 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2310-20401.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaai/NeymanR22, author = {Eric Neyman and Tim Roughgarden}, title = {Strictly Proper Contract Functions Can Be Arbitrage-Free}, booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI} 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22 - March 1, 2022}, pages = {5150--5155}, publisher = {{AAAI} Press}, year = {2022}, url = {https://doi.org/10.1609/aaai.v36i5.20449}, doi = {10.1609/AAAI.V36I5.20449}, timestamp = {Mon, 04 Sep 2023 12:29:24 +0200}, biburl = {https://dblp.org/rec/conf/aaai/NeymanR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ccs/MilionisMRZ22, author = {Jason Milionis and Ciamac C. Moallemi and Tim Roughgarden and Anthony Lee Zhang}, editor = {Fan Zhang and Patrick McCorry}, title = {Quantifying Loss in Automated Market Makers}, booktitle = {Proceedings of the 2022 {ACM} {CCS} Workshop on Decentralized Finance and Security, DeFi 2022, Los Angeles, CA, USA, 11 November 2022}, pages = {71--74}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3560832.3563441}, doi = {10.1145/3560832.3563441}, timestamp = {Tue, 08 Nov 2022 15:09:10 +0100}, biburl = {https://dblp.org/rec/conf/ccs/MilionisMRZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/BeheraH0RS22, author = {Balaram Behera and Edin Husic and Shweta Jain and Tim Roughgarden and C. Seshadhri}, editor = {Mark Braverman}, title = {{FPT} Algorithms for Finding Near-Cliques in c-Closed Graphs}, booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS} 2022, January 31 - February 3, 2022, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {215}, pages = {17:1--17:24}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.17}, doi = {10.4230/LIPICS.ITCS.2022.17}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/BeheraH0RS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/NeymanR22, author = {Eric Neyman and Tim Roughgarden}, editor = {David M. Pennock and Ilya Segal and Sven Seuken}, title = {Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals}, booktitle = {{EC} '22: The 23rd {ACM} Conference on Economics and Computation, Boulder, CO, USA, July 11 - 15, 2022}, pages = {990--1012}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3490486.3538243}, doi = {10.1145/3490486.3538243}, timestamp = {Fri, 15 Jul 2022 09:13:21 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/NeymanR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2202-11219, author = {Eric Neyman and Tim Roughgarden}, title = {No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling}, journal = {CoRR}, volume = {abs/2202.11219}, year = {2022}, url = {https://arxiv.org/abs/2202.11219}, eprinttype = {arXiv}, eprint = {2202.11219}, timestamp = {Wed, 02 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2202-11219.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2205-13028, author = {Devon R. Graham and Kevin Leyton{-}Brown and Tim Roughgarden}, title = {Formalizing Preferences Over Runtime Distributions}, journal = {CoRR}, volume = {abs/2205.13028}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2205.13028}, doi = {10.48550/ARXIV.2205.13028}, eprinttype = {arXiv}, eprint = {2205.13028}, timestamp = {Mon, 30 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2205-13028.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DuttingRT21, author = {Paul D{\"{u}}tting and Tim Roughgarden and Inbal Talgam{-}Cohen}, title = {The Complexity of Contracts}, journal = {{SIAM} J. Comput.}, volume = {50}, number = {1}, pages = {211--254}, year = {2021}, url = {https://doi.org/10.1137/20M132153X}, doi = {10.1137/20M132153X}, timestamp = {Fri, 05 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/DuttingRT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigecom/Roughgarden21, author = {Tim Roughgarden}, title = {Transaction fee mechanism design}, journal = {SIGecom Exch.}, volume = {19}, number = {1}, pages = {52--55}, year = {2021}, url = {https://doi.org/10.1145/3476436.3476445}, doi = {10.1145/3476436.3476445}, timestamp = {Thu, 02 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigecom/Roughgarden21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ccs/Lewis-PyeR21, author = {Andrew Lewis{-}Pye and Tim Roughgarden}, editor = {Yongdae Kim and Jong Kim and Giovanni Vigna and Elaine Shi}, title = {How Does Blockchain Security Dictate Blockchain Implementation?}, booktitle = {{CCS} '21: 2021 {ACM} {SIGSAC} Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15 - 19, 2021}, pages = {1006--1019}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3460120.3484752}, doi = {10.1145/3460120.3484752}, timestamp = {Tue, 16 Nov 2021 12:59:46 +0100}, biburl = {https://dblp.org/rec/conf/ccs/Lewis-PyeR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fc/RoughgardenS21, author = {Tim Roughgarden and Clara Shikhelman}, editor = {Nikita Borisov and Claudia D{\'{\i}}az}, title = {Ignore the Extra Zeroes: Variance-Optimal Mining Pools}, booktitle = {Financial Cryptography and Data Security - 25th International Conference, {FC} 2021, Virtual Event, March 1-5, 2021, Revised Selected Papers, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {12675}, pages = {233--249}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-662-64331-0\_12}, doi = {10.1007/978-3-662-64331-0\_12}, timestamp = {Thu, 16 Mar 2023 14:52:53 +0100}, biburl = {https://dblp.org/rec/conf/fc/RoughgardenS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/HaghtalabRS21, author = {Nika Haghtalab and Tim Roughgarden and Abhishek Shetty}, title = {Smoothed Analysis with Adaptive Adversaries}, booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2021, Denver, CO, USA, February 7-10, 2022}, pages = {942--953}, publisher = {{IEEE}}, year = {2021}, url = {https://doi.org/10.1109/FOCS52979.2021.00095}, doi = {10.1109/FOCS52979.2021.00095}, timestamp = {Wed, 09 Mar 2022 12:12:23 +0100}, biburl = {https://dblp.org/rec/conf/focs/HaghtalabRS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/NeymanR21, author = {Eric Neyman and Tim Roughgarden}, editor = {P{\'{e}}ter Bir{\'{o}} and Shuchi Chawla and Federico Echenique}, title = {From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation}, booktitle = {{EC} '21: The 22nd {ACM} Conference on Economics and Computation, Budapest, Hungary, July 18-23, 2021}, pages = {734}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3465456.3467599}, doi = {10.1145/3465456.3467599}, timestamp = {Fri, 09 Feb 2024 20:36:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/NeymanR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/Roughgarden21, author = {Tim Roughgarden}, editor = {P{\'{e}}ter Bir{\'{o}} and Shuchi Chawla and Federico Echenique}, title = {Transaction Fee Mechanism Design}, booktitle = {{EC} '21: The 22nd {ACM} Conference on Economics and Computation, Budapest, Hungary, July 18-23, 2021}, pages = {792}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3465456.3467591}, doi = {10.1145/3465456.3467591}, timestamp = {Wed, 21 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/Roughgarden21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/aft/2021, editor = {Foteini Baldimtsi and Tim Roughgarden}, title = {{AFT} '21: 3rd {ACM} Conference on Advances in Financial Technologies, Arlington, Virginia, USA, September 26 - 28, 2021}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3479722}, doi = {10.1145/3479722}, isbn = {978-1-4503-9082-8}, timestamp = {Wed, 01 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/aft/2021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2102-07081, author = {Eric Neyman and Tim Roughgarden}, title = {From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation}, journal = {CoRR}, volume = {abs/2102.07081}, year = {2021}, url = {https://arxiv.org/abs/2102.07081}, eprinttype = {arXiv}, eprint = {2102.07081}, timestamp = {Thu, 18 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2102-07081.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2102-08446, author = {Nika Haghtalab and Tim Roughgarden and Abhishek Shetty}, title = {Smoothed Analysis with Adaptive Adversaries}, journal = {CoRR}, volume = {abs/2102.08446}, year = {2021}, url = {https://arxiv.org/abs/2102.08446}, eprinttype = {arXiv}, eprint = {2102.08446}, timestamp = {Fri, 19 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2102-08446.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2106-01340, author = {Tim Roughgarden}, title = {Transaction Fee Mechanism Design}, journal = {CoRR}, volume = {abs/2106.01340}, year = {2021}, url = {https://arxiv.org/abs/2106.01340}, eprinttype = {arXiv}, eprint = {2106.01340}, timestamp = {Thu, 10 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2106-01340.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2109-01308, author = {Eric Neyman and Tim Roughgarden}, title = {Strictly Proper Contract Functions Can Be Arbitrage-Free}, journal = {CoRR}, volume = {abs/2109.01308}, year = {2021}, url = {https://arxiv.org/abs/2109.01308}, eprinttype = {arXiv}, eprint = {2109.01308}, timestamp = {Mon, 20 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2109-01308.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2109-04848, author = {Andrew Lewis{-}Pye and Tim Roughgarden}, title = {How Does Blockchain Security Dictate Blockchain Implementation?}, journal = {CoRR}, volume = {abs/2109.04848}, year = {2021}, url = {https://arxiv.org/abs/2109.04848}, eprinttype = {arXiv}, eprint = {2109.04848}, timestamp = {Tue, 21 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2109-04848.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-03153, author = {Eric Neyman and Tim Roughgarden}, title = {Are You Smarter Than a Random Expert? The Robust Aggregation of Substitutable Signals}, journal = {CoRR}, volume = {abs/2111.03153}, year = {2021}, url = {https://arxiv.org/abs/2111.03153}, eprinttype = {arXiv}, eprint = {2111.03153}, timestamp = {Wed, 10 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-03153.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cacm/GuptaR20, author = {Rishi Gupta and Tim Roughgarden}, title = {Data-driven algorithm design}, journal = {Commun. {ACM}}, volume = {63}, number = {6}, pages = {87--94}, year = {2020}, url = {https://doi.org/10.1145/3394625}, doi = {10.1145/3394625}, timestamp = {Fri, 12 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cacm/GuptaR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fttcs/Roughgarden20, author = {Tim Roughgarden}, title = {Complexity Theory, Game Theory, and Economics: The Barbados Lectures}, journal = {Found. Trends Theor. Comput. Sci.}, volume = {14}, number = {3-4}, pages = {222--407}, year = {2020}, url = {https://doi.org/10.1561/0400000085}, doi = {10.1561/0400000085}, timestamp = {Tue, 24 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/fttcs/Roughgarden20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ior/RoughgardenTY20, author = {Tim Roughgarden and Inbal Talgam{-}Cohen and Qiqi Yan}, title = {Robust Auctions for Revenue via Enhanced Competition}, journal = {Oper. Res.}, volume = {68}, number = {4}, pages = {1074--1094}, year = {2020}, url = {https://doi.org/10.1287/opre.2019.1929}, doi = {10.1287/OPRE.2019.1929}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ior/RoughgardenTY20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jmlr/NiazadehRW20, author = {Rad Niazadeh and Tim Roughgarden and Joshua R. Wang}, title = {Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization}, journal = {J. Mach. Learn. Res.}, volume = {21}, pages = {125:1--125:31}, year = {2020}, url = {http://jmlr.org/papers/v21/18-527.html}, timestamp = {Wed, 18 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jmlr/NiazadehRW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/PlautR20, author = {Benjamin Plaut and Tim Roughgarden}, title = {Communication Complexity of Discrete Fair Division}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {1}, pages = {206--243}, year = {2020}, url = {https://doi.org/10.1137/19M1244305}, doi = {10.1137/19M1244305}, timestamp = {Wed, 11 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/PlautR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/FoxRSWW20, author = {Jacob Fox and Tim Roughgarden and C. Seshadhri and Fan Wei and Nicole Wein}, title = {Finding Cliques in Social Networks: {A} New Distribution-Free Model}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {2}, pages = {448--464}, year = {2020}, url = {https://doi.org/10.1137/18M1210459}, doi = {10.1137/18M1210459}, timestamp = {Thu, 07 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/FoxRSWW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/PlautR20, author = {Benjamin Plaut and Tim Roughgarden}, title = {Almost Envy-Freeness with General Valuations}, journal = {{SIAM} J. Discret. Math.}, volume = {34}, number = {2}, pages = {1039--1068}, year = {2020}, url = {https://doi.org/10.1137/19M124397X}, doi = {10.1137/19M124397X}, timestamp = {Thu, 06 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/PlautR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BhattacharyaKKL20, author = {Sayan Bhattacharya and Elias Koutsoupias and Janardhan Kulkarni and Stefano Leonardi and Tim Roughgarden and Xiaoming Xu}, title = {Prior-free multi-unit auctions with ordered bidders}, journal = {Theor. Comput. Sci.}, volume = {846}, pages = {160--171}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2020.09.030}, doi = {10.1016/J.TCS.2020.09.030}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BhattacharyaKKL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/EzraFRS20, author = {Tomer Ezra and Michal Feldman and Tim Roughgarden and Warut Suksompong}, title = {Pricing Multi-Unit Markets}, journal = {{ACM} Trans. Economics and Comput.}, volume = {7}, number = {4}, pages = {20:1--20:29}, year = {2020}, url = {https://doi.org/10.1145/3373715}, doi = {10.1145/3373715}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/teco/EzraFRS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/Colini-Baldeschi20, author = {Riccardo Colini{-}Baldeschi and Paul W. Goldberg and Bart de Keijzer and Stefano Leonardi and Tim Roughgarden and Stefano Turchetta}, title = {Approximately Efficient Two-Sided Combinatorial Auctions}, journal = {{ACM} Trans. Economics and Comput.}, volume = {8}, number = {1}, pages = {4:1--4:29}, year = {2020}, url = {https://doi.org/10.1145/3381523}, doi = {10.1145/3381523}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/teco/Colini-Baldeschi20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/HaghtalabRS20, author = {Nika Haghtalab and Tim Roughgarden and Abhishek Shetty}, editor = {Hugo Larochelle and Marc'Aurelio Ranzato and Raia Hadsell and Maria{-}Florina Balcan and Hsuan{-}Tien Lin}, title = {Smoothed Analysis of Online and Differentially Private Learning}, booktitle = {Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual}, year = {2020}, url = {https://proceedings.neurips.cc/paper/2020/hash/685bfde03eb646c27ed565881917c71c-Abstract.html}, timestamp = {Tue, 19 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/HaghtalabRS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DuttingRT20, author = {Paul D{\"{u}}tting and Tim Roughgarden and Inbal Talgam{-}Cohen}, editor = {Shuchi Chawla}, title = {The Complexity of Contracts}, booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020}, pages = {2688--2707}, publisher = {{SIAM}}, year = {2020}, url = {https://doi.org/10.1137/1.9781611975994.164}, doi = {10.1137/1.9781611975994.164}, timestamp = {Thu, 15 Jul 2021 13:48:53 +0200}, biburl = {https://dblp.org/rec/conf/soda/DuttingRT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/cu/20/Roughgarden20, author = {Tim Roughgarden}, editor = {Tim Roughgarden}, title = {Introduction}, booktitle = {Beyond the Worst-Case Analysis of Algorithms}, pages = {1--24}, publisher = {Cambridge University Press}, year = {2020}, url = {https://doi.org/10.1017/9781108637435.002}, doi = {10.1017/9781108637435.002}, timestamp = {Mon, 04 Jan 2021 16:41:48 +0100}, biburl = {https://dblp.org/rec/books/cu/20/Roughgarden20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/cu/20/Roughgarden20a, author = {Tim Roughgarden}, editor = {Tim Roughgarden}, title = {Resource Augmentation}, booktitle = {Beyond the Worst-Case Analysis of Algorithms}, pages = {72--92}, publisher = {Cambridge University Press}, year = {2020}, url = {https://doi.org/10.1017/9781108637435.006}, doi = {10.1017/9781108637435.006}, timestamp = {Mon, 04 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/books/cu/20/Roughgarden20a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/cu/20/Roughgarden20b, author = {Tim Roughgarden}, editor = {Tim Roughgarden}, title = {Distributional Analysis}, booktitle = {Beyond the Worst-Case Analysis of Algorithms}, pages = {167--188}, publisher = {Cambridge University Press}, year = {2020}, url = {https://doi.org/10.1017/9781108637435.012}, doi = {10.1017/9781108637435.012}, timestamp = {Mon, 04 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/books/cu/20/Roughgarden20b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/cu/20/RoughgardenS20, author = {Tim Roughgarden and C. Seshadhri}, editor = {Tim Roughgarden}, title = {Distribution-Free Models of Social Networks}, booktitle = {Beyond the Worst-Case Analysis of Algorithms}, pages = {606--625}, publisher = {Cambridge University Press}, year = {2020}, url = {https://doi.org/10.1017/9781108637435.035}, doi = {10.1017/9781108637435.035}, timestamp = {Thu, 07 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/cu/20/RoughgardenS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/cu/20/R2020, editor = {Tim Roughgarden}, title = {Beyond the Worst-Case Analysis of Algorithms}, publisher = {Cambridge University Press}, year = {2020}, url = {https://doi.org/10.1017/9781108637435}, doi = {10.1017/9781108637435}, isbn = {9781108637435}, timestamp = {Mon, 04 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/books/cu/20/R2020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-12034, author = {Paul Duetting and Tim Roughgarden and Inbal Talgam{-}Cohen}, title = {The Complexity of Contracts}, journal = {CoRR}, volume = {abs/2002.12034}, year = {2020}, url = {https://arxiv.org/abs/2002.12034}, eprinttype = {arXiv}, eprint = {2002.12034}, timestamp = {Tue, 03 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-12034.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2006-10129, author = {Nika Haghtalab and Tim Roughgarden and Abhishek Shetty}, title = {Smoothed Analysis of Online and Differentially Private Learning}, journal = {CoRR}, volume = {abs/2006.10129}, year = {2020}, url = {https://arxiv.org/abs/2006.10129}, eprinttype = {arXiv}, eprint = {2006.10129}, timestamp = {Tue, 23 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2006-10129.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2006-10698, author = {Andrew Lewis{-}Pye and Tim Roughgarden}, title = {Resource Pools and the {CAP} Theorem}, journal = {CoRR}, volume = {abs/2006.10698}, year = {2020}, url = {https://arxiv.org/abs/2006.10698}, eprinttype = {arXiv}, eprint = {2006.10698}, timestamp = {Tue, 23 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2006-10698.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-03661, author = {Yiling Chen and Arpita Ghosh and Michael Kearns and Tim Roughgarden and Jennifer Wortman Vaughan}, title = {Mathematical Foundations for Social Computing}, journal = {CoRR}, volume = {abs/2007.03661}, year = {2020}, url = {https://arxiv.org/abs/2007.03661}, eprinttype = {arXiv}, eprint = {2007.03661}, timestamp = {Thu, 08 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-03661.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-09768, author = {Edin Husic and Tim Roughgarden}, title = {{FPT} Algorithms for Finding Dense Subgraphs in c-Closed Graphs}, journal = {CoRR}, volume = {abs/2007.09768}, year = {2020}, url = {https://arxiv.org/abs/2007.09768}, eprinttype = {arXiv}, eprint = {2007.09768}, timestamp = {Wed, 29 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-09768.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-13234, author = {Tim Roughgarden}, title = {Resource Augmentation}, journal = {CoRR}, volume = {abs/2007.13234}, year = {2020}, url = {https://arxiv.org/abs/2007.13234}, eprinttype = {arXiv}, eprint = {2007.13234}, timestamp = {Wed, 29 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-13234.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-13240, author = {Tim Roughgarden}, title = {Distributional Analysis}, journal = {CoRR}, volume = {abs/2007.13240}, year = {2020}, url = {https://arxiv.org/abs/2007.13240}, eprinttype = {arXiv}, eprint = {2007.13240}, timestamp = {Wed, 29 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-13240.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-13241, author = {Tim Roughgarden}, title = {Beyond the Worst-Case Analysis of Algorithms (Introduction)}, journal = {CoRR}, volume = {abs/2007.13241}, year = {2020}, url = {https://arxiv.org/abs/2007.13241}, eprinttype = {arXiv}, eprint = {2007.13241}, timestamp = {Wed, 29 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-13241.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-15743, author = {Tim Roughgarden and C. Seshadhri}, title = {Distribution-Free Models of Social Networks}, journal = {CoRR}, volume = {abs/2007.15743}, year = {2020}, url = {https://arxiv.org/abs/2007.15743}, eprinttype = {arXiv}, eprint = {2007.15743}, timestamp = {Thu, 07 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-15743.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2012-00854, author = {Tim Roughgarden}, title = {Transaction Fee Mechanism Design for the Ethereum Blockchain: An Economic Analysis of {EIP-1559}}, journal = {CoRR}, volume = {abs/2012.00854}, year = {2020}, url = {https://arxiv.org/abs/2012.00854}, eprinttype = {arXiv}, eprint = {2012.00854}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2012-00854.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cacm/Roughgarden19, author = {Tim Roughgarden}, title = {Beyond worst-case analysis}, journal = {Commun. {ACM}}, volume = {62}, number = {3}, pages = {88--96}, year = {2019}, url = {https://doi.org/10.1145/3232535}, doi = {10.1145/3232535}, timestamp = {Thu, 09 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cacm/Roughgarden19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/DevanurHR19, author = {Nikhil R. Devanur and Jason D. Hartline and Tim Roughgarden}, title = {Introduction to the Special Issue - Algorithmic Game Theory - {STOC/FOCS/SODA} 2012}, journal = {Games Econ. Behav.}, volume = {113}, pages = {1--3}, year = {2019}, url = {https://doi.org/10.1016/j.geb.2016.03.006}, doi = {10.1016/J.GEB.2016.03.006}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/DevanurHR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/RoughgardenW19, author = {Tim Roughgarden and Joshua R. Wang}, title = {Minimizing Regret with Multiple Reserves}, journal = {{ACM} Trans. Economics and Comput.}, volume = {7}, number = {3}, pages = {17:1--17:18}, year = {2019}, url = {https://doi.org/10.1145/3355900}, doi = {10.1145/3355900}, timestamp = {Tue, 15 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/teco/RoughgardenW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aft/ChenPR19, author = {Xi Chen and Christos H. Papadimitriou and Tim Roughgarden}, title = {An Axiomatic Approach to Block Rewards}, booktitle = {Proceedings of the 1st {ACM} Conference on Advances in Financial Technologies, {AFT} 2019, Zurich, Switzerland, October 21-23, 2019}, pages = {124--131}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3318041.3355470}, doi = {10.1145/3318041.3355470}, timestamp = {Thu, 13 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/aft/ChenPR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/ChatziafratisRW19, author = {Vaggos Chatziafratis and Tim Roughgarden and Joshua R. Wang}, editor = {Alina Beygelzimer and Daniel Hsu}, title = {On the Computational Power of Online Gradient Descent}, booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix, AZ, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {99}, pages = {624--662}, publisher = {{PMLR}}, year = {2019}, url = {http://proceedings.mlr.press/v99/chatziafratis19a.html}, timestamp = {Mon, 08 Jul 2019 16:13:41 +0200}, biburl = {https://dblp.org/rec/conf/colt/ChatziafratisRW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ec/DuttingRT19, author = {Paul D{\"{u}}tting and Tim Roughgarden and Inbal Talgam{-}Cohen}, editor = {Anna Karlin and Nicole Immorlica and Ramesh Johari}, title = {Simple versus Optimal Contracts}, booktitle = {Proceedings of the 2019 {ACM} Conference on Economics and Computation, {EC} 2019, Phoenix, AZ, USA, June 24-28, 2019}, pages = {369--387}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3328526.3329591}, doi = {10.1145/3328526.3329591}, timestamp = {Wed, 26 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ec/DuttingRT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/Roughgarden19, author = {Tim Roughgarden}, editor = {Arkadev Chattopadhyay and Paul Gastin}, title = {How Computer Science Informs Modern Auction Design (Invited Talk)}, booktitle = {39th {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019, Bombay, India}, series = {LIPIcs}, volume = {150}, pages = {5:1--5:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2019.5}, doi = {10.4230/LIPICS.FSTTCS.2019.5}, timestamp = {Thu, 05 Dec 2019 15:12:21 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/Roughgarden19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/PlautR19, author = {Benjamin Plaut and Tim Roughgarden}, editor = {Timothy M. Chan}, title = {Communication Complexity of Discrete Fair Division}, booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9, 2019}, pages = {2014--2033}, publisher = {{SIAM}}, year = {2019}, url = {https://doi.org/10.1137/1.9781611975482.122}, doi = {10.1137/1.9781611975482.122}, timestamp = {Thu, 15 Jul 2021 13:49:01 +0200}, biburl = {https://dblp.org/rec/conf/soda/PlautR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1909-10645, author = {Xi Chen and Christos H. Papadimitriou and Tim Roughgarden}, title = {An Axiomatic Approach to Block Rewards}, journal = {CoRR}, volume = {abs/1909.10645}, year = {2019}, url = {http://arxiv.org/abs/1909.10645}, eprinttype = {arXiv}, eprint = {1909.10645}, timestamp = {Thu, 13 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1909-10645.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/DobzinskiMRS18, author = {Shahar Dobzinski and Aranyak Mehta and Tim Roughgarden and Mukund Sundararajan}, title = {Is Shapley cost sharing optimal?}, journal = {Games Econ. Behav.}, volume = {108}, pages = {130--138}, year = {2018}, url = {https://doi.org/10.1016/j.geb.2017.03.008}, doi = {10.1016/J.GEB.2017.03.008}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/DobzinskiMRS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/RoughgardenVW18, author = {Tim Roughgarden and Sergei Vassilvitskii and Joshua R. Wang}, title = {Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)}, journal = {J. {ACM}}, volume = {65}, number = {6}, pages = {41:1--41:24}, year = {2018}, url = {https://doi.org/10.1145/3232536}, doi = {10.1145/3232536}, timestamp = {Thu, 09 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/RoughgardenVW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HuangMR18, author = {Zhiyi Huang and Yishay Mansour and Tim Roughgarden}, title = {Making the Most of Your Samples}, journal = {{SIAM} J. Comput.}, volume = {47}, number = {3}, pages = {651--674}, year = {2018}, url = {https://doi.org/10.1137/16M1065719}, doi = {10.1137/16M1065719}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HuangMR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/GopalanNR18, author = {Parikshit Gopalan and Noam Nisan and Tim Roughgarden}, title = {Public Projects, Boolean Functions, and the Borders of Border's Theorem}, journal = {{ACM} Trans. Economics and Comput.}, volume = {6}, number = {3-4}, pages = {18:1--18:21}, year = {2018}, url = {https://doi.org/10.1145/3274645}, doi = {10.1145/3274645}, timestamp = {Fri, 10 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/teco/GopalanNR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/RoughgardenW18, author = {Tim Roughgarden and Joshua R. Wang}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1307--1325}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/roughgarden18a.html}, timestamp = {Wed, 03 Apr 2019 18:17:23 +0200}, biburl = {https://dblp.org/rec/conf/colt/RoughgardenW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FoxRSWW18, author = {Jacob Fox and Tim Roughgarden and C. Seshadhri and Fan Wei and Nicole Wein}, editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'{a}}niel Marx and Donald Sannella}, title = {Finding Cliques in Social Networks: {A} New Distribution-Free Model}, booktitle = {45th International Colloquium on Automata, Languages, and Programming, {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic}, series = {LIPIcs}, volume = {107}, pages = {55:1--55:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.55}, doi = {10.4230/LIPICS.ICALP.2018.55}, timestamp = {Thu, 07 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/FoxRSWW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/NiazadehRW18, author = {Rad Niazadeh and Tim Roughgarden and Joshua R. Wang}, editor = {Samy Bengio and Hanna M. Wallach and Hugo Larochelle and Kristen Grauman and Nicol{\`{o}} Cesa{-}Bianchi and Roman Garnett}, title = {Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization}, booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3-8, 2018, Montr{\'{e}}al, Canada}, pages = {9617--9627}, year = {2018}, url = {https://proceedings.neurips.cc/paper/2018/hash/cdfa4c42f465a5a66871587c69fcfa34-Abstract.html}, timestamp = {Mon, 16 May 2022 15:41:51 +0200}, biburl = {https://dblp.org/rec/conf/nips/NiazadehRW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/PlautR18, author = {Benjamin Plaut and Tim Roughgarden}, editor = {Artur Czumaj}, title = {Almost Envy-Freeness with General Valuations}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018}, pages = {2584--2603}, publisher = {{SIAM}}, year = {2018}, url = {https://doi.org/10.1137/1.9781611975031.165}, doi = {10.1137/1.9781611975031.165}, timestamp = {Tue, 02 Feb 2021 17:07:58 +0100}, biburl = {https://dblp.org/rec/conf/soda/PlautR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/EzraFRS18, author = {Tomer Ezra and Michal Feldman and Tim Roughgarden and Warut Suksompong}, editor = {George Christodoulou and Tobias Harks}, title = {Pricing Multi-unit Markets}, booktitle = {Web and Internet Economics - 14th International Conference, {WINE} 2018, Oxford, UK, December 15-17, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11316}, pages = {140--153}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-04612-5\_10}, doi = {10.1007/978-3-030-04612-5\_10}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wine/EzraFRS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1801-00734, author = {Tim Roughgarden}, title = {Complexity Theory, Game Theory, and Economics}, journal = {CoRR}, volume = {abs/1801.00734}, year = {2018}, url = {http://arxiv.org/abs/1801.00734}, eprinttype = {arXiv}, eprint = {1801.00734}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1801-00734.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-07431, author = {Jacob Fox and Tim Roughgarden and C. Seshadhri and Fan Wei and Nicole Wein}, title = {Finding Cliques in Social Networks: {A} New Distribution-Free Model}, journal = {CoRR}, volume = {abs/1804.07431}, year = {2018}, url = {http://arxiv.org/abs/1804.07431}, eprinttype = {arXiv}, eprint = {1804.07431}, timestamp = {Thu, 07 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-07431.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-11187, author = {George Barmpalias and Neng Huang and Andrew Lewis{-}Pye and Angsheng Li and Xuechen Li and Yicheng Pan and Tim Roughgarden}, title = {The idemetric property: when most distances are (almost) the same}, journal = {CoRR}, volume = {abs/1804.11187}, year = {2018}, url = {http://arxiv.org/abs/1804.11187}, eprinttype = {arXiv}, eprint = {1804.11187}, timestamp = {Wed, 06 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-11187.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1805-09480, author = {Rad Niazadeh and Tim Roughgarden and Joshua R. Wang}, title = {Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization}, journal = {CoRR}, volume = {abs/1805.09480}, year = {2018}, url = {http://arxiv.org/abs/1805.09480}, eprinttype = {arXiv}, eprint = {1805.09480}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1805-09480.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-03349, author = {Tim Roughgarden and Joshua R. Wang}, title = {An Optimal Algorithm for Online Unconstrained Submodular Maximization}, journal = {CoRR}, volume = {abs/1806.03349}, year = {2018}, url = {http://arxiv.org/abs/1806.03349}, eprinttype = {arXiv}, eprint = {1806.03349}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-03349.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-09817, author = {Tim Roughgarden}, title = {Beyond Worst-Case Analysis}, journal = {CoRR}, volume = {abs/1806.09817}, year = {2018}, url = {http://arxiv.org/abs/1806.09817}, eprinttype = {arXiv}, eprint = {1806.09817}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-09817.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1807-01280, author = {Vaggos Chatziafratis and Tim Roughgarden and Joshua R. Wang}, title = {On the Computational Power of Online Gradient Descent}, journal = {CoRR}, volume = {abs/1807.01280}, year = {2018}, url = {http://arxiv.org/abs/1807.01280}, eprinttype = {arXiv}, eprint = {1807.01280}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1807-01280.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1808-03713, author = {Paul D{\"{u}}tting and Tim Roughgarden and Inbal Talgam{-}Cohen}, title = {Simple versus Optimal Contracts}, journal = {CoRR}, volume = {abs/1808.03713}, year = {2018}, url = {http://arxiv.org/abs/1808.03713}, eprinttype = {arXiv}, eprint = {1808.03713}, timestamp = {Sun, 02 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1808-03713.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1812-11896, author = {Tim Roughgarden and Inbal Talgam{-}Cohen}, title = {Approximately Optimal Mechanism Design}, journal = {CoRR}, volume = {abs/1812.11896}, year = {2018}, url = {http://arxiv.org/abs/1812.11896}, eprinttype = {arXiv}, eprint = {1812.11896}, timestamp = {Thu, 03 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1812-11896.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Roughgarden18, author = {Tim Roughgarden}, title = {Complexity Theory, Game Theory, and Economics}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-001}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/001}, eprinttype = {ECCC}, eprint = {TR18-001}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Roughgarden18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/RoughgardenI17, author = {Tim Roughgarden and Kazuo Iwama}, title = {Twenty Lectures on Algorithmic Game Theory}, journal = {Bull. {EATCS}}, volume = {122}, year = {2017}, url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/486}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eatcs/RoughgardenI17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/DuttingTR17, author = {Paul D{\"{u}}tting and Inbal Talgam{-}Cohen and Tim Roughgarden}, title = {Modularity and greed in double auctions}, journal = {Games Econ. Behav.}, volume = {105}, pages = {59--83}, year = {2017}, url = {https://doi.org/10.1016/j.geb.2017.06.008}, doi = {10.1016/J.GEB.2017.06.008}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/DuttingTR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/RoughgardenST17, author = {Tim Roughgarden and Vasilis Syrgkanis and {\'{E}}va Tardos}, title = {The Price of Anarchy in Auctions}, journal = {J. Artif. Intell. Res.}, volume = {59}, pages = {59--101}, year = {2017}, url = {https://doi.org/10.1613/jair.5272}, doi = {10.1613/JAIR.5272}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/RoughgardenST17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mor/DuttingGR17, author = {Paul D{\"{u}}tting and Vasilis Gkatzelis and Tim Roughgarden}, title = {The Performance of Deferred-Acceptance Auctions}, journal = {Math. Oper. Res.}, volume = {42}, number = {4}, pages = {897--914}, year = {2017}, url = {https://doi.org/10.1287/moor.2016.0835}, doi = {10.1287/MOOR.2016.0835}, timestamp = {Tue, 28 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mor/DuttingGR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GuptaR17, author = {Rishi Gupta and Tim Roughgarden}, title = {A {PAC} Approach to Application-Specific Algorithm Selection}, journal = {{SIAM} J. Comput.}, volume = {46}, number = {3}, pages = {992--1017}, year = {2017}, url = {https://doi.org/10.1137/15M1050276}, doi = {10.1137/15M1050276}, timestamp = {Wed, 05 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/GuptaR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/RoughgardenTV17, author = {Tim Roughgarden and Inbal Talgam{-}Cohen and Jan Vondr{\'{a}}k}, editor = {Klaus Jansen and Jos{\'{e}} D. P. Rolim and David Williamson and Santosh S. Vempala}, title = {When Are Welfare Guarantees Robust?}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {81}, pages = {22:1--22:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.22}, doi = {10.4230/LIPICS.APPROX-RANDOM.2017.22}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/RoughgardenTV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/ChatziafratisRV17, author = {Vaggos Chatziafratis and Tim Roughgarden and Jan Vondr{\'{a}}k}, editor = {Kirk Pruhs and Christian Sohler}, title = {Stability and Recovery for Independence Systems}, booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September 4-6, 2017, Vienna, Austria}, series = {LIPIcs}, volume = {87}, pages = {26:1--26:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ESA.2017.26}, doi = {10.4230/LIPICS.ESA.2017.26}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/esa/ChatziafratisRV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/RoughgardenS17, author = {Tim Roughgarden and Okke Schrijvers}, editor = {Isabelle Guyon and Ulrike von Luxburg and Samy Bengio and Hanna M. Wallach and Rob Fergus and S. V. N. Vishwanathan and Roman Garnett}, title = {Online Prediction with Selfish Experts}, booktitle = {Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, {USA}}, pages = {1300--1310}, year = {2017}, url = {https://proceedings.neurips.cc/paper/2017/hash/3b3dbaf68507998acd6a5a5254ab2d76-Abstract.html}, timestamp = {Thu, 21 Jan 2021 13:58:27 +0100}, biburl = {https://dblp.org/rec/conf/nips/RoughgardenS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/GkatzelisMR17, author = {Vasilis Gkatzelis and Evangelos Markakis and Tim Roughgarden}, editor = {Constantinos Daskalakis and Moshe Babaioff and Herv{\'{e}} Moulin}, title = {Deferred-Acceptance Auctions for Multiple Levels of Service}, booktitle = {Proceedings of the 2017 {ACM} Conference on Economics and Computation, {EC} '17, Cambridge, MA, USA, June 26-30, 2017}, pages = {21--38}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3033274.3085142}, doi = {10.1145/3033274.3085142}, timestamp = {Mon, 30 Jan 2023 21:01:44 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/GkatzelisMR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/Colini-Baldeschi17, author = {Riccardo Colini{-}Baldeschi and Paul W. Goldberg and Bart de Keijzer and Stefano Leonardi and Tim Roughgarden and Stefano Turchetta}, editor = {Constantinos Daskalakis and Moshe Babaioff and Herv{\'{e}} Moulin}, title = {Approximately Efficient Two-Sided Combinatorial Auctions}, booktitle = {Proceedings of the 2017 {ACM} Conference on Economics and Computation, {EC} '17, Cambridge, MA, USA, June 26-30, 2017}, pages = {591--608}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3033274.3085128}, doi = {10.1145/3033274.3085128}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/Colini-Baldeschi17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/RoughgardenT17, author = {Tim Roughgarden and Inbal Talgam{-}Cohen}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Why prices need algorithms (invited talk)}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {2}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3079077}, doi = {10.1145/3055399.3079077}, timestamp = {Sun, 02 Jun 2019 21:10:31 +0200}, biburl = {https://dblp.org/rec/conf/stoc/RoughgardenT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/RoughgardenS17, author = {Tim Roughgarden and Okke Schrijvers}, title = {Online Prediction with Selfish Experts}, journal = {CoRR}, volume = {abs/1702.03615}, year = {2017}, url = {http://arxiv.org/abs/1702.03615}, eprinttype = {arXiv}, eprint = {1702.03615}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/RoughgardenS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ChatziafratisRV17, author = {Vaggos Chatziafratis and Tim Roughgarden and Jan Vondr{\'{a}}k}, title = {Stability and Recovery for Independence Systems}, journal = {CoRR}, volume = {abs/1705.00127}, year = {2017}, url = {http://arxiv.org/abs/1705.00127}, eprinttype = {arXiv}, eprint = {1705.00127}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChatziafratisRV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/EzraFRS17, author = {Tomer Ezra and Michal Feldman and Tim Roughgarden and Warut Suksompong}, title = {Pricing Identical Items}, journal = {CoRR}, volume = {abs/1705.06623}, year = {2017}, url = {http://arxiv.org/abs/1705.06623}, eprinttype = {arXiv}, eprint = {1705.06623}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/EzraFRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/PlautR17, author = {Benjamin Plaut and Tim Roughgarden}, title = {Almost Envy-Freeness with General Valuations}, journal = {CoRR}, volume = {abs/1707.04769}, year = {2017}, url = {http://arxiv.org/abs/1707.04769}, eprinttype = {arXiv}, eprint = {1707.04769}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/PlautR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1711-04066, author = {Benjamin Plaut and Tim Roughgarden}, title = {Communication Complexity of Discrete Fair Division}, journal = {CoRR}, volume = {abs/1711.04066}, year = {2017}, url = {http://arxiv.org/abs/1711.04066}, eprinttype = {arXiv}, eprint = {1711.04066}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1711-04066.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cacm/ChenGKRV16, author = {Yiling Chen and Arpita Ghosh and Michael J. Kearns and Tim Roughgarden and Jennifer Wortman Vaughan}, title = {Mathematical foundations for social computing}, journal = {Commun. {ACM}}, volume = {59}, number = {12}, pages = {102--108}, year = {2016}, url = {https://doi.org/10.1145/2960403}, doi = {10.1145/2960403}, timestamp = {Thu, 08 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cacm/ChenGKRV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fttcs/Roughgarden16, author = {Tim Roughgarden}, title = {Communication Complexity (for Algorithm Designers)}, journal = {Found. Trends Theor. Comput. Sci.}, volume = {11}, number = {3-4}, pages = {217--404}, year = {2016}, url = {https://doi.org/10.1561/0400000076}, doi = {10.1561/0400000076}, timestamp = {Thu, 20 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fttcs/Roughgarden16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ior/GkatzelisKR16, author = {Vasilis Gkatzelis and Konstantinos Kollias and Tim Roughgarden}, title = {Optimal Cost-Sharing in General Resource Selection Games}, journal = {Oper. Res.}, volume = {64}, number = {6}, pages = {1230--1238}, year = {2016}, url = {https://doi.org/10.1287/opre.2016.1512}, doi = {10.1287/OPRE.2016.1512}, timestamp = {Tue, 31 Mar 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ior/GkatzelisKR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/DughmiRY16, author = {Shaddin Dughmi and Tim Roughgarden and Qiqi Yan}, title = {Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding}, journal = {J. {ACM}}, volume = {63}, number = {4}, pages = {30:1--30:33}, year = {2016}, url = {https://doi.org/10.1145/2908735}, doi = {10.1145/2908735}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/DughmiRY16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GuptaRS16, author = {Rishi Gupta and Tim Roughgarden and C. Seshadhri}, title = {Decompositions of Triangle-Dense Graphs}, journal = {{SIAM} J. Comput.}, volume = {45}, number = {2}, pages = {197--215}, year = {2016}, url = {https://doi.org/10.1137/140955331}, doi = {10.1137/140955331}, timestamp = {Thu, 07 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/GuptaRS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HsuHRRW16, author = {Justin Hsu and Zhiyi Huang and Aaron Roth and Tim Roughgarden and Zhiwei Steven Wu}, title = {Private Matchings and Allocations}, journal = {{SIAM} J. Comput.}, volume = {45}, number = {6}, pages = {1953--1984}, year = {2016}, url = {https://doi.org/10.1137/15100271X}, doi = {10.1137/15100271X}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HsuHRRW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/RoughgardenS16, author = {Tim Roughgarden and Okke Schrijvers}, title = {Network Cost-Sharing without Anonymity}, journal = {{ACM} Trans. Economics and Comput.}, volume = {4}, number = {2}, pages = {8:1--8:24}, year = {2016}, url = {https://doi.org/10.1145/2841228}, doi = {10.1145/2841228}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/teco/RoughgardenS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/RoughgardenT16, author = {Tim Roughgarden and Inbal Talgam{-}Cohen}, title = {Optimal and Robust Mechanism Design with Interdependent Values}, journal = {{ACM} Trans. Economics and Comput.}, volume = {4}, number = {3}, pages = {18:1--18:34}, year = {2016}, url = {https://doi.org/10.1145/2910577}, doi = {10.1145/2910577}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/teco/RoughgardenT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/MorgensternR16, author = {Jamie Morgenstern and Tim Roughgarden}, editor = {Vitaly Feldman and Alexander Rakhlin and Ohad Shamir}, title = {Learning Simple Auctions}, booktitle = {Proceedings of the 29th Conference on Learning Theory, {COLT} 2016, New York, USA, June 23-26, 2016}, series = {{JMLR} Workshop and Conference Proceedings}, volume = {49}, pages = {1298--1318}, publisher = {JMLR.org}, year = {2016}, url = {http://proceedings.mlr.press/v49/morgenstern16.html}, timestamp = {Wed, 29 May 2019 08:41:47 +0200}, biburl = {https://dblp.org/rec/conf/colt/MorgensternR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/RoughgardenW16, author = {Tim Roughgarden and Joshua R. Wang}, editor = {Piotr Sankowski and Christos D. Zaroliagis}, title = {The Complexity of the k-means Method}, booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24, 2016, Aarhus, Denmark}, series = {LIPIcs}, volume = {57}, pages = {78:1--78:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ESA.2016.78}, doi = {10.4230/LIPICS.ESA.2016.78}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/esa/RoughgardenW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fc/SchrijversBBR16, author = {Okke Schrijvers and Joseph Bonneau and Dan Boneh and Tim Roughgarden}, editor = {Jens Grossklags and Bart Preneel}, title = {Incentive Compatibility of Bitcoin Mining Pool Reward Functions}, booktitle = {Financial Cryptography and Data Security - 20th International Conference, {FC} 2016, Christ Church, Barbados, February 22-26, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9603}, pages = {477--498}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-54970-4\_28}, doi = {10.1007/978-3-662-54970-4\_28}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/fc/SchrijversBBR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/RoughgardenW16, author = {Tim Roughgarden and Omri Weinstein}, editor = {Irit Dinur}, title = {On the Communication Complexity of Approximate Fixed Points}, booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS} 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, {USA}}, pages = {229--238}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/FOCS.2016.32}, doi = {10.1109/FOCS.2016.32}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/RoughgardenW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ijcai/RoughgardenT16, author = {Tim Roughgarden and Inbal Talgam{-}Cohen}, editor = {Subbarao Kambhampati}, title = {Why Prices Need Algorithms}, booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, {IJCAI} 2016, New York, NY, USA, 9-15 July 2016}, pages = {4210--4212}, publisher = {{IJCAI/AAAI} Press}, year = {2016}, url = {http://www.ijcai.org/Abstract/16/632}, timestamp = {Tue, 20 Aug 2019 16:19:00 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/RoughgardenT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/GuptaR16, author = {Rishi Gupta and Tim Roughgarden}, editor = {Madhu Sudan}, title = {A {PAC} Approach to Application-Specific Algorithm Selection}, booktitle = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, January 14-16, 2016}, pages = {123--134}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2840728.2840766}, doi = {10.1145/2840728.2840766}, timestamp = {Tue, 14 Jun 2022 13:12:41 +0200}, biburl = {https://dblp.org/rec/conf/innovations/GuptaR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/RoughgardenS16, author = {Tim Roughgarden and Okke Schrijvers}, editor = {Vincent Conitzer and Dirk Bergemann and Yiling Chen}, title = {Ironing in the Dark}, booktitle = {Proceedings of the 2016 {ACM} Conference on Economics and Computation, {EC} '16, Maastricht, The Netherlands, July 24-28, 2016}, pages = {1--18}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2940716.2940723}, doi = {10.1145/2940716.2940723}, timestamp = {Fri, 09 Jul 2021 11:46:27 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/RoughgardenS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/Roughgarden16, author = {Tim Roughgarden}, editor = {Vincent Conitzer and Dirk Bergemann and Yiling Chen}, title = {Intrinsic Robustness of the Price of Anarchy: Abstract of the Kalai Prize Talk}, booktitle = {Proceedings of the 2016 {ACM} Conference on Economics and Computation, {EC} '16, Maastricht, The Netherlands, July 24-28, 2016}, pages = {457}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2940716.2940797}, doi = {10.1145/2940716.2940797}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/Roughgarden16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/RoughgardenW16, author = {Tim Roughgarden and Joshua R. Wang}, editor = {Vincent Conitzer and Dirk Bergemann and Yiling Chen}, title = {Minimizing Regret with Multiple Reserves}, booktitle = {Proceedings of the 2016 {ACM} Conference on Economics and Computation, {EC} '16, Maastricht, The Netherlands, July 24-28, 2016}, pages = {601--616}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2940716.2940792}, doi = {10.1145/2940716.2940792}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/RoughgardenW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/RoughgardenVW16, author = {Tim Roughgarden and Sergei Vassilvitskii and Joshua R. Wang}, editor = {Christian Scheideler and Seth Gilbert}, title = {Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation)}, booktitle = {Proceedings of the 28th {ACM} Symposium on Parallelism in Algorithms and Architectures, {SPAA} 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016}, pages = {1--12}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2935764.2935799}, doi = {10.1145/2935764.2935799}, timestamp = {Tue, 06 Nov 2018 16:59:33 +0100}, biburl = {https://dblp.org/rec/conf/spaa/RoughgardenVW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FeldmanILRS16, author = {Michal Feldman and Nicole Immorlica and Brendan Lucier and Tim Roughgarden and Vasilis Syrgkanis}, editor = {Daniel Wichs and Yishay Mansour}, title = {The price of anarchy in large games}, booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016}, pages = {963--976}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2897518.2897580}, doi = {10.1145/2897518.2897580}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/FeldmanILRS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/MorgensternR16, author = {Jamie Morgenstern and Tim Roughgarden}, title = {Learning Simple Auctions}, journal = {CoRR}, volume = {abs/1604.03171}, year = {2016}, url = {http://arxiv.org/abs/1604.03171}, eprinttype = {arXiv}, eprint = {1604.03171}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/MorgensternR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/RoughgardenST16, author = {Tim Roughgarden and Vasilis Syrgkanis and {\'{E}}va Tardos}, title = {The Price of Anarchy in Auctions}, journal = {CoRR}, volume = {abs/1607.07684}, year = {2016}, url = {http://arxiv.org/abs/1607.07684}, eprinttype = {arXiv}, eprint = {1607.07684}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/RoughgardenST16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/RoughgardenTV16, author = {Tim Roughgarden and Inbal Talgam{-}Cohen and Jan Vondr{\'{a}}k}, title = {When Are Welfare Guarantees Robust?}, journal = {CoRR}, volume = {abs/1608.02402}, year = {2016}, url = {http://arxiv.org/abs/1608.02402}, eprinttype = {arXiv}, eprint = {1608.02402}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/RoughgardenTV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Colini-Baldeschi16c, author = {Riccardo Colini{-}Baldeschi and Paul W. Goldberg and Bart de Keijzer and Stefano Leonardi and Tim Roughgarden and Stefano Turchetta}, title = {Approximately Efficient Two-Sided Combinatorial Auctions}, journal = {CoRR}, volume = {abs/1611.05342}, year = {2016}, url = {http://arxiv.org/abs/1611.05342}, eprinttype = {arXiv}, eprint = {1611.05342}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/Colini-Baldeschi16c.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/RoughgardenW16, author = {Tim Roughgarden and Omri Weinstein}, title = {On the Communication Complexity of Approximate Fixed Points}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-055}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/055}, eprinttype = {ECCC}, eprint = {TR16-055}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/RoughgardenW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/ChenR15, author = {Yan Chen and Tim Roughgarden}, title = {Special Section of Games and Economic Behavior dedicated to the 11th and 12th {ACM} Conference on Electronic Commerce}, journal = {Games Econ. Behav.}, volume = {91}, pages = {283}, year = {2015}, url = {https://doi.org/10.1016/j.geb.2015.03.008}, doi = {10.1016/J.GEB.2015.03.008}, timestamp = {Sun, 30 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/geb/ChenR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/DhangwatnotaiRY15, author = {Peerapong Dhangwatnotai and Tim Roughgarden and Qiqi Yan}, title = {Revenue maximization with a single sample}, journal = {Games Econ. Behav.}, volume = {91}, pages = {318--333}, year = {2015}, url = {https://doi.org/10.1016/j.geb.2014.03.011}, doi = {10.1016/J.GEB.2014.03.011}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/DhangwatnotaiRY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/ChawlaFHR15, author = {Shuchi Chawla and Lisa Fleischer and Jason D. Hartline and Tim Roughgarden}, title = {Introduction to the Special Issue - Algorithmic Game Theory - {STOC/FOCS/SODA} 2011}, journal = {Games Econ. Behav.}, volume = {92}, pages = {228--231}, year = {2015}, url = {https://doi.org/10.1016/j.geb.2015.02.011}, doi = {10.1016/J.GEB.2015.02.011}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/ChawlaFHR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Roughgarden15, author = {Tim Roughgarden}, title = {Intrinsic Robustness of the Price of Anarchy}, journal = {J. {ACM}}, volume = {62}, number = {5}, pages = {32:1--32:42}, year = {2015}, url = {https://doi.org/10.1145/2806883}, doi = {10.1145/2806883}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Roughgarden15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jet/RoughgardenS15, author = {Tim Roughgarden and Florian Schoppmann}, title = {Local smoothness and the price of anarchy in splittable congestion games}, journal = {J. Econ. Theory}, volume = {156}, pages = {317--342}, year = {2015}, url = {https://doi.org/10.1016/j.jet.2014.04.005}, doi = {10.1016/J.JET.2014.04.005}, timestamp = {Mon, 24 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jet/RoughgardenS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Roughgarden15, author = {Tim Roughgarden}, title = {Special Section on the Fifty-Third {IEEE} Annual Symposium on Foundations of Computer Science {(FOCS} 2012)}, journal = {{SIAM} J. Comput.}, volume = {44}, number = {5}, pages = {1286}, year = {2015}, url = {https://doi.org/10.1137/15N973939}, doi = {10.1137/15N973939}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Roughgarden15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/BhawalkarKLRS15, author = {Kshipra Bhawalkar and Jon M. Kleinberg and Kevin Lewi and Tim Roughgarden and Aneesh Sharma}, title = {Preventing Unraveling in Social Networks: The Anchored k-Core Problem}, journal = {{SIAM} J. Discret. Math.}, volume = {29}, number = {3}, pages = {1452--1475}, year = {2015}, url = {https://doi.org/10.1137/14097032X}, doi = {10.1137/14097032X}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/BhawalkarKLRS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigecom/RoughgardenT15, author = {Tim Roughgarden and Inbal Talgam{-}Cohen}, title = {Why prices need algorithms}, journal = {SIGecom Exch.}, volume = {14}, number = {2}, pages = {35--40}, year = {2015}, url = {https://doi.org/10.1145/2904104.2904109}, doi = {10.1145/2904104.2904109}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigecom/RoughgardenT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/Roughgarden15, author = {Tim Roughgarden}, title = {The Price of Anarchy in Games of Incomplete Information}, journal = {{ACM} Trans. Economics and Comput.}, volume = {3}, number = {1}, pages = {6:1--6:20}, year = {2015}, url = {https://doi.org/10.1145/2737816}, doi = {10.1145/2737816}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/teco/Roughgarden15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/KolliasR15, author = {Konstantinos Kollias and Tim Roughgarden}, title = {Restoring Pure Equilibria to Weighted Congestion Games}, journal = {{ACM} Trans. Economics and Comput.}, volume = {3}, number = {4}, pages = {21:1--21:24}, year = {2015}, url = {https://doi.org/10.1145/2781678}, doi = {10.1145/2781678}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/teco/KolliasR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/GlobersonRSY15, author = {Amir Globerson and Tim Roughgarden and David A. Sontag and Cafer Yildirim}, editor = {Francis R. Bach and David M. Blei}, title = {How Hard is Inference for Structured Prediction?}, booktitle = {Proceedings of the 32nd International Conference on Machine Learning, {ICML} 2015, Lille, France, 6-11 July 2015}, series = {{JMLR} Workshop and Conference Proceedings}, volume = {37}, pages = {2181--2190}, publisher = {JMLR.org}, year = {2015}, url = {http://proceedings.mlr.press/v37/globerson15.html}, timestamp = {Fri, 15 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icml/GlobersonRSY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/MorgensternR15, author = {Jamie Morgenstern and Tim Roughgarden}, editor = {Corinna Cortes and Neil D. Lawrence and Daniel D. Lee and Masashi Sugiyama and Roman Garnett}, title = {On the Pseudo-Dimension of Nearly Optimal Auctions}, booktitle = {Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, December 7-12, 2015, Montreal, Quebec, Canada}, pages = {136--144}, year = {2015}, url = {https://proceedings.neurips.cc/paper/2015/hash/fbd7939d674997cdb4692d34de8633c4-Abstract.html}, timestamp = {Mon, 16 May 2022 15:41:51 +0200}, biburl = {https://dblp.org/rec/conf/nips/MorgensternR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/RoughgardenT15, author = {Tim Roughgarden and Inbal Talgam{-}Cohen}, editor = {Tim Roughgarden and Michal Feldman and Michael Schwarz}, title = {Why Prices Need Algorithms}, booktitle = {Proceedings of the Sixteenth {ACM} Conference on Economics and Computation, {EC} '15, Portland, OR, USA, June 15-19, 2015}, pages = {19--36}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2764468.2764515}, doi = {10.1145/2764468.2764515}, timestamp = {Fri, 02 Jun 2023 16:54:30 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/RoughgardenT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/0002MR15, author = {Zhiyi Huang and Yishay Mansour and Tim Roughgarden}, editor = {Tim Roughgarden and Michal Feldman and Michael Schwarz}, title = {Making the Most of Your Samples}, booktitle = {Proceedings of the Sixteenth {ACM} Conference on Economics and Computation, {EC} '15, Portland, OR, USA, June 15-19, 2015}, pages = {45--60}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2764468.2764475}, doi = {10.1145/2764468.2764475}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/0002MR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/GopalanNR15, author = {Parikshit Gopalan and Noam Nisan and Tim Roughgarden}, editor = {Tim Roughgarden and Michal Feldman and Michael Schwarz}, title = {Public Projects, Boolean Functions, and the Borders of Border's Theorem}, booktitle = {Proceedings of the Sixteenth {ACM} Conference on Economics and Computation, {EC} '15, Portland, OR, USA, June 15-19, 2015}, pages = {395}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2764468.2764538}, doi = {10.1145/2764468.2764538}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/GopalanNR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/innovations/2015, editor = {Tim Roughgarden}, title = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015}, publisher = {{ACM}}, year = {2015}, url = {http://dl.acm.org/citation.cfm?id=2688073}, isbn = {978-1-4503-3333-7}, timestamp = {Sun, 25 Jan 2015 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/2015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/sigecom/2015, editor = {Tim Roughgarden and Michal Feldman and Michael Schwarz}, title = {Proceedings of the Sixteenth {ACM} Conference on Economics and Computation, {EC} '15, Portland, OR, USA, June 15-19, 2015}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2764468}, doi = {10.1145/2764468}, isbn = {978-1-4503-3410-5}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/2015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ColeR15, author = {Richard Cole and Tim Roughgarden}, title = {The Sample Complexity of Revenue Maximization}, journal = {CoRR}, volume = {abs/1502.00963}, year = {2015}, url = {http://arxiv.org/abs/1502.00963}, eprinttype = {arXiv}, eprint = {1502.00963}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ColeR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/FeldmanILRS15, author = {Michal Feldman and Nicole Immorlica and Brendan Lucier and Tim Roughgarden and Vasilis Syrgkanis}, title = {The Price of Anarchy in Large Games}, journal = {CoRR}, volume = {abs/1503.04755}, year = {2015}, url = {http://arxiv.org/abs/1503.04755}, eprinttype = {arXiv}, eprint = {1503.04755}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/FeldmanILRS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GopalanNR15, author = {Parikshit Gopalan and Noam Nisan and Tim Roughgarden}, title = {Public projects, Boolean functions and the borders of Border's theorem}, journal = {CoRR}, volume = {abs/1504.07687}, year = {2015}, url = {http://arxiv.org/abs/1504.07687}, eprinttype = {arXiv}, eprint = {1504.07687}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GopalanNR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/MorgensternR15, author = {Jamie Morgenstern and Tim Roughgarden}, title = {The Pseudo-Dimension of Near-Optimal Auctions}, journal = {CoRR}, volume = {abs/1506.03684}, year = {2015}, url = {http://arxiv.org/abs/1506.03684}, eprinttype = {arXiv}, eprint = {1506.03684}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/MorgensternR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Roughgarden15, author = {Tim Roughgarden}, title = {Communication Complexity (for Algorithm Designers)}, journal = {CoRR}, volume = {abs/1509.06257}, year = {2015}, url = {http://arxiv.org/abs/1509.06257}, eprinttype = {arXiv}, eprint = {1509.06257}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Roughgarden15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/RoughgardenS15, author = {Tim Roughgarden and Okke Schrijvers}, title = {Ironing in the Dark}, journal = {CoRR}, volume = {abs/1511.06918}, year = {2015}, url = {http://arxiv.org/abs/1511.06918}, eprinttype = {arXiv}, eprint = {1511.06918}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/RoughgardenS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GuptaR15b, author = {Rishi Gupta and Tim Roughgarden}, title = {A {PAC} Approach to Application-Specific Algorithm Selection}, journal = {CoRR}, volume = {abs/1511.07147}, year = {2015}, url = {http://arxiv.org/abs/1511.07147}, eprinttype = {arXiv}, eprint = {1511.07147}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GuptaR15b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Roughgarden15, author = {Tim Roughgarden}, title = {Computing Equilibria: {A} Computational Complexity Perspective}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-153}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/153}, eprinttype = {ECCC}, eprint = {TR15-153}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Roughgarden15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Roughgarden15a, author = {Tim Roughgarden}, title = {Communication Complexity (for Algorithm Designers)}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-156}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/156}, eprinttype = {ECCC}, eprint = {TR15-156}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Roughgarden15a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DughmiR14, author = {Shaddin Dughmi and Tim Roughgarden}, title = {Black-Box Randomized Reductions in Algorithmic Mechanism Design}, journal = {{SIAM} J. Comput.}, volume = {43}, number = {1}, pages = {312--336}, year = {2014}, url = {https://doi.org/10.1137/110843654}, doi = {10.1137/110843654}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DughmiR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigecom/Roughgarden14, author = {Tim Roughgarden}, title = {Approximately optimal mechanism design: motivation, examples, and lessons learned}, journal = {SIGecom Exch.}, volume = {13}, number = {2}, pages = {4--20}, year = {2014}, url = {https://doi.org/10.1145/2728732.2728733}, doi = {10.1145/2728732.2728733}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigecom/Roughgarden14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tac/MardenR14, author = {Jason R. Marden and Tim Roughgarden}, title = {Generalized Efficiency Bounds in Distributed Resource Allocation}, journal = {{IEEE} Trans. Autom. Control.}, volume = {59}, number = {3}, pages = {571--584}, year = {2014}, url = {https://doi.org/10.1109/TAC.2014.2301613}, doi = {10.1109/TAC.2014.2301613}, timestamp = {Wed, 20 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tac/MardenR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/teco/BhawalkarGR14, author = {Kshipra Bhawalkar and Martin Gairing and Tim Roughgarden}, title = {Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness}, journal = {{ACM} Trans. Economics and Comput.}, volume = {2}, number = {4}, pages = {14:1--14:23}, year = {2014}, url = {https://doi.org/10.1145/2629666}, doi = {10.1145/2629666}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/teco/BhawalkarGR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Roughgarden14, author = {Tim Roughgarden}, title = {Barriers to Near-Optimal Equilibria}, booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2014, Philadelphia, PA, USA, October 18-21, 2014}, pages = {71--80}, publisher = {{IEEE} Computer Society}, year = {2014}, url = {https://doi.org/10.1109/FOCS.2014.16}, doi = {10.1109/FOCS.2014.16}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Roughgarden14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/HsuRRU14, author = {Justin Hsu and Aaron Roth and Tim Roughgarden and Jonathan R. Ullman}, editor = {Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias}, title = {Privately Solving Linear Programs}, booktitle = {Automata, Languages, and Programming - 41st International Colloquium, {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {8572}, pages = {612--624}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-43948-7\_51}, doi = {10.1007/978-3-662-43948-7\_51}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/HsuRRU14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/GuptaRS14, author = {Rishi Gupta and Tim Roughgarden and C. Seshadhri}, editor = {Moni Naor}, title = {Decompositions of triangle-dense graphs}, booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ, USA, January 12-14, 2014}, pages = {471--482}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2554797.2554840}, doi = {10.1145/2554797.2554840}, timestamp = {Thu, 07 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/GuptaRS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sagt/RoughgardenS14, author = {Tim Roughgarden and Okke Schrijvers}, editor = {Ron Lavi}, title = {Network Cost-Sharing without Anonymity}, booktitle = {Algorithmic Game Theory - 7th International Symposium, {SAGT} 2014, Haifa, Israel, September 30 - October 2, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8768}, pages = {134--145}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-44803-8\_12}, doi = {10.1007/978-3-662-44803-8\_12}, timestamp = {Tue, 14 May 2019 10:00:42 +0200}, biburl = {https://dblp.org/rec/conf/sagt/RoughgardenS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/DuttingGR14, author = {Paul D{\"{u}}tting and Vasilis Gkatzelis and Tim Roughgarden}, editor = {Moshe Babaioff and Vincent Conitzer and David A. Easley}, title = {The performance of deferred-acceptance auctions}, booktitle = {{ACM} Conference on Economics and Computation, {EC} '14, Stanford , CA, USA, June 8-12, 2014}, pages = {187--204}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2600057.2602861}, doi = {10.1145/2600057.2602861}, timestamp = {Tue, 15 Oct 2019 12:02:28 +0200}, biburl = {https://dblp.org/rec/conf/sigecom/DuttingGR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/DuttingRT14, author = {Paul D{\"{u}}tting and Tim Roughgarden and Inbal Talgam{-}Cohen}, editor = {Moshe Babaioff and Vincent Conitzer and David A. Easley}, title = {Modularity and greed in double auctions}, booktitle = {{ACM} Conference on Economics and Computation, {EC} '14, Stanford , CA, USA, June 8-12, 2014}, pages = {241--258}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2600057.2602854}, doi = {10.1145/2600057.2602854}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/DuttingRT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HsuHRRW14, author = {Justin Hsu and Zhiyi Huang and Aaron Roth and Tim Roughgarden and Zhiwei Steven Wu}, editor = {David B. Shmoys}, title = {Private matchings and allocations}, booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA, May 31 - June 03, 2014}, pages = {21--30}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2591796.2591826}, doi = {10.1145/2591796.2591826}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/HsuHRRW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ColeR14, author = {Richard Cole and Tim Roughgarden}, editor = {David B. Shmoys}, title = {The sample complexity of revenue maximization}, booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA, May 31 - June 03, 2014}, pages = {243--252}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2591796.2591867}, doi = {10.1145/2591796.2591867}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ColeR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/GkatzelisKR14, author = {Vasilis Gkatzelis and Konstantinos Kollias and Tim Roughgarden}, editor = {Tie{-}Yan Liu and Qi Qi and Yinyu Ye}, title = {Optimal Cost-Sharing in Weighted Congestion Games}, booktitle = {Web and Internet Economics - 10th International Conference, {WINE} 2014, Beijing, China, December 14-17, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8877}, pages = {72--88}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13129-0\_6}, doi = {10.1007/978-3-319-13129-0\_6}, timestamp = {Sun, 18 Dec 2022 19:02:44 +0100}, biburl = {https://dblp.org/rec/conf/wine/GkatzelisKR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HsuRRU14, author = {Justin Hsu and Aaron Roth and Tim Roughgarden and Jonathan R. Ullman}, title = {Privately Solving Linear Programs}, journal = {CoRR}, volume = {abs/1402.3631}, year = {2014}, url = {http://arxiv.org/abs/1402.3631}, eprinttype = {arXiv}, eprint = {1402.3631}, timestamp = {Tue, 27 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/HsuRRU14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Roughgarden14, author = {Tim Roughgarden}, title = {Approximately Optimal Mechanism Design: Motivation, Examples, and Lessons Learned}, journal = {CoRR}, volume = {abs/1406.6773}, year = {2014}, url = {http://arxiv.org/abs/1406.6773}, eprinttype = {arXiv}, eprint = {1406.6773}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Roughgarden14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HuangMR14, author = {Zhiyi Huang and Yishay Mansour and Tim Roughgarden}, title = {Making the Most of Your Samples}, journal = {CoRR}, volume = {abs/1407.2479}, year = {2014}, url = {http://arxiv.org/abs/1407.2479}, eprinttype = {arXiv}, eprint = {1407.2479}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/HuangMR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GlobersonRSY14, author = {Amir Globerson and Tim Roughgarden and David A. Sontag and Cafer Yildirim}, title = {Tight Error Bounds for Structured Prediction}, journal = {CoRR}, volume = {abs/1409.5834}, year = {2014}, url = {http://arxiv.org/abs/1409.5834}, eprinttype = {arXiv}, eprint = {1409.5834}, timestamp = {Fri, 15 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/GlobersonRSY14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HartlineR14, author = {Jason D. Hartline and Tim Roughgarden}, title = {Optimal Platform Design}, journal = {CoRR}, volume = {abs/1412.8518}, year = {2014}, url = {http://arxiv.org/abs/1412.8518}, eprinttype = {arXiv}, eprint = {1412.8518}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/HartlineR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/BalcanMRR14, author = {Maria{-}Florina Balcan and Bodo Manthey and Heiko R{\"{o}}glin and Tim Roughgarden}, title = {Analysis of Algorithms Beyond the Worst Case (Dagstuhl Seminar 14372)}, journal = {Dagstuhl Reports}, volume = {4}, number = {9}, pages = {30--49}, year = {2014}, url = {https://doi.org/10.4230/DagRep.4.9.30}, doi = {10.4230/DAGREP.4.9.30}, timestamp = {Wed, 07 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BalcanMRR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/RoughgardenK13, author = {Tim Roughgarden and Michael J. Kearns}, editor = {Christopher J. C. Burges and L{\'{e}}on Bottou and Zoubin Ghahramani and Kilian Q. Weinberger}, title = {Marginals-to-Models Reducibility}, booktitle = {Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013, Lake Tahoe, Nevada, United States}, pages = {1043--1051}, year = {2013}, url = {https://proceedings.neurips.cc/paper/2013/hash/94c7bb58efc3b337800875b5d382a072-Abstract.html}, timestamp = {Mon, 16 May 2022 15:41:51 +0200}, biburl = {https://dblp.org/rec/conf/nips/RoughgardenK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/BhattacharyaKKLRX13, author = {Sayan Bhattacharya and Elias Koutsoupias and Janardhan Kulkarni and Stefano Leonardi and Tim Roughgarden and Xiaoming Xu}, editor = {Michael J. Kearns and R. Preston McAfee and {\'{E}}va Tardos}, title = {Near-optimal multi-unit auctions with ordered bidders}, booktitle = {Proceedings of the fourteenth {ACM} Conference on Electronic Commerce, {EC} 2013, Philadelphia, PA, USA, June 16-20, 2013}, pages = {91--102}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2492002.2482555}, doi = {10.1145/2492002.2482555}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/BhattacharyaKKLRX13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/RoughgardenT13, author = {Tim Roughgarden and Inbal Talgam{-}Cohen}, editor = {Michael J. Kearns and R. Preston McAfee and {\'{E}}va Tardos}, title = {Optimal and near-optimal mechanism design with interdependent values}, booktitle = {Proceedings of the fourteenth {ACM} Conference on Electronic Commerce, {EC} 2013, Philadelphia, PA, USA, June 16-20, 2013}, pages = {767--784}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2492002.2482606}, doi = {10.1145/2492002.2482606}, timestamp = {Tue, 27 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/RoughgardenT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/stoc/2013, editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum}, title = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013}, publisher = {{ACM}}, year = {2013}, url = {http://dl.acm.org/citation.cfm?id=2488608}, isbn = {978-1-4503-2029-0}, timestamp = {Sun, 26 May 2013 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/2013.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GuptaRS13, author = {Rishi Gupta and Tim Roughgarden and C. Seshadhri}, title = {Decompositions of Triangle-Dense Graphs}, journal = {CoRR}, volume = {abs/1309.7440}, year = {2013}, url = {http://arxiv.org/abs/1309.7440}, eprinttype = {arXiv}, eprint = {1309.7440}, timestamp = {Thu, 07 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GuptaRS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HsuHRRW13, author = {Justin Hsu and Zhiyi Huang and Aaron Roth and Tim Roughgarden and Zhiwei Steven Wu}, title = {Private Matchings and Allocations}, journal = {CoRR}, volume = {abs/1311.2828}, year = {2013}, url = {http://arxiv.org/abs/1311.2828}, eprinttype = {arXiv}, eprint = {1311.2828}, timestamp = {Tue, 08 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/HsuHRRW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cacm/Roughgarden12, author = {Tim Roughgarden}, title = {Intrinsic robustness of the price of anarchy}, journal = {Commun. {ACM}}, volume = {55}, number = {7}, pages = {116--123}, year = {2012}, url = {https://doi.org/10.1145/2209249.2209274}, doi = {10.1145/2209249.2209274}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cacm/Roughgarden12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/ColeDR12, author = {Richard Cole and Yevgeniy Dodis and Tim Roughgarden}, title = {Bottleneck links, variable demand, and the tragedy of the commons}, journal = {Networks}, volume = {60}, number = {3}, pages = {194--203}, year = {2012}, url = {https://doi.org/10.1002/net.21458}, doi = {10.1002/NET.21458}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/ColeDR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GhoshRS12, author = {Arpita Ghosh and Tim Roughgarden and Mukund Sundararajan}, title = {Universally Utility-maximizing Privacy Mechanisms}, journal = {{SIAM} J. Comput.}, volume = {41}, number = {6}, pages = {1673--1693}, year = {2012}, url = {https://doi.org/10.1137/09076828X}, doi = {10.1137/09076828X}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/GhoshRS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigecom/Roughgarden12, author = {Tim Roughgarden}, title = {The price of anarchy in games of incomplete information}, journal = {SIGecom Exch.}, volume = {11}, number = {1}, pages = {18--20}, year = {2012}, url = {https://doi.org/10.1145/2325713.2325716}, doi = {10.1145/2325713.2325716}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigecom/Roughgarden12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/DughmiRS12, author = {Shaddin Dughmi and Tim Roughgarden and Mukund Sundararajan}, title = {Revenue Submodularity}, journal = {Theory Comput.}, volume = {8}, number = {1}, pages = {95--119}, year = {2012}, url = {https://doi.org/10.4086/toc.2012.v008a005}, doi = {10.4086/TOC.2012.V008A005}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/DughmiRS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BhawalkarKLRS12, author = {Kshipra Bhawalkar and Jon M. Kleinberg and Kevin Lewi and Tim Roughgarden and Aneesh Sharma}, editor = {Artur Czumaj and Kurt Mehlhorn and Andrew M. Pitts and Roger Wattenhofer}, title = {Preventing Unraveling in Social Networks: The Anchored k-Core Problem}, booktitle = {Automata, Languages, and Programming - 39th International Colloquium, {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {7392}, pages = {440--451}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-31585-5\_40}, doi = {10.1007/978-3-642-31585-5\_40}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BhawalkarKLRS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/AbrahamBDR12, author = {Ittai Abraham and Moshe Babaioff and Shaddin Dughmi and Tim Roughgarden}, editor = {Boi Faltings and Kevin Leyton{-}Brown and Panos Ipeirotis}, title = {Combinatorial auctions with restricted complements}, booktitle = {Proceedings of the 13th {ACM} Conference on Electronic Commerce, {EC} 2012, Valencia, Spain, June 4-8, 2012}, pages = {3--16}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2229012.2229016}, doi = {10.1145/2229012.2229016}, timestamp = {Tue, 27 Nov 2018 11:56:48 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/AbrahamBDR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/RoughgardenTY12, author = {Tim Roughgarden and Inbal Talgam{-}Cohen and Qiqi Yan}, editor = {Boi Faltings and Kevin Leyton{-}Brown and Panos Ipeirotis}, title = {Supply-limiting mechanisms}, booktitle = {Proceedings of the 13th {ACM} Conference on Electronic Commerce, {EC} 2012, Valencia, Spain, June 4-8, 2012}, pages = {844--861}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2229012.2229077}, doi = {10.1145/2229012.2229077}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/RoughgardenTY12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/Roughgarden12, author = {Tim Roughgarden}, editor = {Boi Faltings and Kevin Leyton{-}Brown and Panos Ipeirotis}, title = {The price of anarchy in games of incomplete information}, booktitle = {Proceedings of the 13th {ACM} Conference on Electronic Commerce, {EC} 2012, Valencia, Spain, June 4-8, 2012}, pages = {862--879}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2229012.2229078}, doi = {10.1145/2229012.2229078}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/Roughgarden12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BadanidiyuruDFKNR12, author = {Ashwinkumar Badanidiyuru and Shahar Dobzinski and Hu Fu and Robert Kleinberg and Noam Nisan and Tim Roughgarden}, editor = {Yuval Rabani}, title = {Sketching valuation functions}, booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012}, pages = {1025--1035}, publisher = {{SIAM}}, year = {2012}, url = {https://doi.org/10.1137/1.9781611973099.81}, doi = {10.1137/1.9781611973099.81}, timestamp = {Mon, 30 Oct 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BadanidiyuruDFKNR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LeonardiR12, author = {Stefano Leonardi and Tim Roughgarden}, editor = {Howard J. Karloff and Toniann Pitassi}, title = {Prior-free auctions with ordered bidders}, booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference, {STOC} 2012, New York, NY, USA, May 19 - 22, 2012}, pages = {427--434}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2213977.2214018}, doi = {10.1145/2213977.2214018}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/LeonardiR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/BhawalkarR12, author = {Kshipra Bhawalkar and Tim Roughgarden}, editor = {Paul W. Goldberg}, title = {Simultaneous Single-Item Auctions}, booktitle = {Internet and Network Economics - 8th International Workshop, {WINE} 2012, Liverpool, UK, December 10-12, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7695}, pages = {337--349}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35311-6\_25}, doi = {10.1007/978-3-642-35311-6\_25}, timestamp = {Tue, 14 May 2019 10:00:36 +0200}, biburl = {https://dblp.org/rec/conf/wine/BhawalkarR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1205-4104, author = {Ittai Abraham and Moshe Babaioff and Shaddin Dughmi and Tim Roughgarden}, title = {Combinatorial Auctions with Restricted Complements}, journal = {CoRR}, volume = {abs/1205.4104}, year = {2012}, url = {http://arxiv.org/abs/1205.4104}, eprinttype = {arXiv}, eprint = {1205.4104}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1205-4104.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1212-2825, author = {Elias Koutsoupias and Stefano Leonardi and Tim Roughgarden}, title = {Near-Optimal Multi-Unit Auctions with Ordered Bidders}, journal = {CoRR}, volume = {abs/1212.2825}, year = {2012}, url = {http://arxiv.org/abs/1212.2825}, eprinttype = {arXiv}, eprint = {1212.2825}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1212-2825.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DhangwatnotaiDDR11, author = {Peerapong Dhangwatnotai and Shahar Dobzinski and Shaddin Dughmi and Tim Roughgarden}, title = {Truthful Approximation Schemes for Single-Parameter Agents}, journal = {{SIAM} J. Comput.}, volume = {40}, number = {3}, pages = {915--933}, year = {2011}, url = {https://doi.org/10.1137/080744992}, doi = {10.1137/080744992}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DhangwatnotaiDDR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/LinRTW11, author = {Henry C. Lin and Tim Roughgarden and {\'{E}}va Tardos and Asher Walkover}, title = {Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing}, journal = {{SIAM} J. Discret. Math.}, volume = {25}, number = {4}, pages = {1667--1686}, year = {2011}, url = {https://doi.org/10.1137/090769600}, doi = {10.1137/090769600}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/LinRTW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/KrauthgamerR11, author = {Robert Krauthgamer and Tim Roughgarden}, title = {Metric Clustering via Consistent Labeling}, journal = {Theory Comput.}, volume = {7}, number = {1}, pages = {49--74}, year = {2011}, url = {https://doi.org/10.4086/toc.2011.v007a005}, doi = {10.4086/TOC.2011.V007A005}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/KrauthgamerR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cdc/NadavJR11, author = {Uri Nadav and Ramesh Johari and Tim Roughgarden}, title = {Uncoupled potentials for proportional allocation markets}, booktitle = {50th {IEEE} Conference on Decision and Control and European Control Conference, 11th European Control Conference, {CDC/ECC} 2011, Orlando, FL, USA, December 12-15, 2011}, pages = {4479--4484}, publisher = {{IEEE}}, year = {2011}, url = {https://doi.org/10.1109/CDC.2011.6160986}, doi = {10.1109/CDC.2011.6160986}, timestamp = {Wed, 24 Feb 2021 08:49:08 +0100}, biburl = {https://dblp.org/rec/conf/cdc/NadavJR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KolliasR11, author = {Konstantinos Kollias and Tim Roughgarden}, editor = {Luca Aceto and Monika Henzinger and Jir{\'{\i}} Sgall}, title = {Restoring Pure Equilibria to Weighted Congestion Games}, booktitle = {Automata, Languages and Programming - 38th International Colloquium, {ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6756}, pages = {539--551}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22012-8\_43}, doi = {10.1007/978-3-642-22012-8\_43}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KolliasR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ijcai/KumarTARK11, author = {Ranjitha Kumar and Jerry O. Talton and Salman Ahmad and Tim Roughgarden and Scott R. Klemmer}, editor = {Toby Walsh}, title = {Flexible Tree Matching}, booktitle = {{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011}, pages = {2674--2679}, publisher = {{IJCAI/AAAI}}, year = {2011}, url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-445}, doi = {10.5591/978-1-57735-516-8/IJCAI11-445}, timestamp = {Tue, 20 Aug 2019 16:16:04 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/KumarTARK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/RoughgardenS11, author = {Tim Roughgarden and Florian Schoppmann}, editor = {Dana Randall}, title = {Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games}, booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25, 2011}, pages = {255--267}, publisher = {{SIAM}}, year = {2011}, url = {https://doi.org/10.1137/1.9781611973082.22}, doi = {10.1137/1.9781611973082.22}, timestamp = {Tue, 02 Feb 2021 17:07:23 +0100}, biburl = {https://dblp.org/rec/conf/soda/RoughgardenS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BhawalkarR11, author = {Kshipra Bhawalkar and Tim Roughgarden}, editor = {Dana Randall}, title = {Welfare Guarantees for Combinatorial Auctions with Item Bidding}, booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25, 2011}, pages = {700--709}, publisher = {{SIAM}}, year = {2011}, url = {https://doi.org/10.1137/1.9781611973082.55}, doi = {10.1137/1.9781611973082.55}, timestamp = {Tue, 02 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BhawalkarR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DughmiRY11, author = {Shaddin Dughmi and Tim Roughgarden and Qiqi Yan}, editor = {Lance Fortnow and Salil P. Vadhan}, title = {From convex optimization to randomized mechanisms: toward optimal combinatorial auctions}, booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC} 2011, San Jose, CA, USA, 6-8 June 2011}, pages = {149--158}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993636.1993657}, doi = {10.1145/1993636.1993657}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DughmiRY11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/sigecom/2011, editor = {Yoav Shoham and Yan Chen and Tim Roughgarden}, title = {Proceedings 12th {ACM} Conference on Electronic Commerce (EC-2011), San Jose, CA, USA, June 5-9, 2011}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993574}, doi = {10.1145/1993574}, isbn = {978-1-4503-0261-6}, timestamp = {Tue, 27 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/2011.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1103-0040, author = {Shaddin Dughmi and Tim Roughgarden and Qiqi Yan}, title = {From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders}, journal = {CoRR}, volume = {abs/1103.0040}, year = {2011}, url = {http://arxiv.org/abs/1103.0040}, eprinttype = {arXiv}, eprint = {1103.0040}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1103-0040.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1109-1053, author = {Shaddin Dughmi and Tim Roughgarden and Jan Vondr{\'{a}}k and Qiqi Yan}, title = {An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries}, journal = {CoRR}, volume = {abs/1109.1053}, year = {2011}, url = {http://arxiv.org/abs/1109.1053}, eprinttype = {arXiv}, eprint = {1109.1053}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1109-1053.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cacm/Roughgarden10, author = {Tim Roughgarden}, title = {Algorithmic game theory}, journal = {Commun. {ACM}}, volume = {53}, number = {7}, pages = {78--86}, year = {2010}, url = {https://doi.org/10.1145/1785414.1785439}, doi = {10.1145/1785414.1785439}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cacm/Roughgarden10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/ValiantR10, author = {Gregory Valiant and Tim Roughgarden}, title = {Braess's Paradox in large random graphs}, journal = {Random Struct. Algorithms}, volume = {37}, number = {4}, pages = {495--515}, year = {2010}, url = {https://doi.org/10.1002/rsa.20325}, doi = {10.1002/RSA.20325}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/ValiantR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ChenRV10, author = {Ho{-}Lin Chen and Tim Roughgarden and Gregory Valiant}, title = {Designing Network Protocols for Good Equilibria}, journal = {{SIAM} J. Comput.}, volume = {39}, number = {5}, pages = {1799--1832}, year = {2010}, url = {https://doi.org/10.1137/08072721X}, doi = {10.1137/08072721X}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ChenRV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamjo/Mosk-AoyamaRS10, author = {Damon Mosk{-}Aoyama and Tim Roughgarden and Devavrat Shah}, title = {Fully Distributed Algorithms for Convex Optimization Problems}, journal = {{SIAM} J. Optim.}, volume = {20}, number = {6}, pages = {3260--3279}, year = {2010}, url = {https://doi.org/10.1137/080743706}, doi = {10.1137/080743706}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamjo/Mosk-AoyamaRS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/bqgt/DughmiR10, author = {Shaddin Dughmi and Tim Roughgarden}, editor = {Moshe Dror and Greys Sosic}, title = {Truthfulness via smoothed complexity}, booktitle = {Proceedings of the Behavioral and Quantitative Game Theory - Conference on Future Directions, {BQGT} '10, Newport Beach, California, USA, May 14-16, 2010}, pages = {21:1}, publisher = {{ACM}}, year = {2010}, url = {https://doi.org/10.1145/1807406.1807427}, doi = {10.1145/1807406.1807427}, timestamp = {Tue, 06 Nov 2018 16:57:10 +0100}, biburl = {https://dblp.org/rec/conf/bqgt/DughmiR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cdc/MardenR10, author = {Jason R. Marden and Tim Roughgarden}, title = {Generalized efficiency bounds in distributed resource allocation}, booktitle = {Proceedings of the 49th {IEEE} Conference on Decision and Control, {CDC} 2010, December 15-17, 2010, Atlanta, Georgia, {USA}}, pages = {2233--2238}, publisher = {{IEEE}}, year = {2010}, url = {https://doi.org/10.1109/CDC.2010.5717472}, doi = {10.1109/CDC.2010.5717472}, timestamp = {Fri, 04 Mar 2022 13:28:01 +0100}, biburl = {https://dblp.org/rec/conf/cdc/MardenR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BhawalkarGR10, author = {Kshipra Bhawalkar and Martin Gairing and Tim Roughgarden}, editor = {Mark de Berg and Ulrich Meyer}, title = {Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness}, booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6347}, pages = {17--28}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-15781-3\_2}, doi = {10.1007/978-3-642-15781-3\_2}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/BhawalkarGR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DughmiR10, author = {Shaddin Dughmi and Tim Roughgarden}, title = {Black-Box Randomized Reductions in Algorithmic Mechanism Design}, booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2010, October 23-26, 2010, Las Vegas, Nevada, {USA}}, pages = {775--784}, publisher = {{IEEE} Computer Society}, year = {2010}, url = {https://doi.org/10.1109/FOCS.2010.79}, doi = {10.1109/FOCS.2010.79}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DughmiR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/DhangwatnotaiRY10, author = {Peerapong Dhangwatnotai and Tim Roughgarden and Qiqi Yan}, editor = {David C. Parkes and Chrysanthos Dellarocas and Moshe Tennenholtz}, title = {Revenue maximization with a single sample}, booktitle = {Proceedings 11th {ACM} Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7-11, 2010}, pages = {129--138}, publisher = {{ACM}}, year = {2010}, url = {https://doi.org/10.1145/1807342.1807364}, doi = {10.1145/1807342.1807364}, timestamp = {Tue, 27 Nov 2018 11:56:48 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/DhangwatnotaiRY10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/RothR10, author = {Aaron Roth and Tim Roughgarden}, editor = {Leonard J. Schulman}, title = {Interactive privacy via the median mechanism}, booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC} 2010, Cambridge, Massachusetts, USA, 5-8 June 2010}, pages = {765--774}, publisher = {{ACM}}, year = {2010}, url = {https://doi.org/10.1145/1806689.1806794}, doi = {10.1145/1806689.1806794}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/RothR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/NadavR10, author = {Uri Nadav and Tim Roughgarden}, editor = {Amin Saberi}, title = {The Limits of Smoothness: {A} Primal-Dual Framework for Price of Anarchy Bounds}, booktitle = {Internet and Network Economics - 6th International Workshop, {WINE} 2010, Stanford, CA, USA, December 13-17, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6484}, pages = {319--326}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17572-5\_26}, doi = {10.1007/978-3-642-17572-5\_26}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/wine/NadavR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/MehtaRS09, author = {Aranyak Mehta and Tim Roughgarden and Mukund Sundararajan}, title = {Beyond Moulin mechanisms}, journal = {Games Econ. Behav.}, volume = {67}, number = {1}, pages = {125--155}, year = {2009}, url = {https://doi.org/10.1016/j.geb.2008.06.005}, doi = {10.1016/J.GEB.2008.06.005}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/MehtaRS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/RoughgardenS09, author = {Tim Roughgarden and Mukund Sundararajan}, title = {Quantifying inefficiency in cost-sharing mechanisms}, journal = {J. {ACM}}, volume = {56}, number = {4}, pages = {23:1--23:33}, year = {2009}, url = {https://doi.org/10.1145/1538902.1538907}, doi = {10.1145/1538902.1538907}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/RoughgardenS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/ChenR09, author = {Ho{-}Lin Chen and Tim Roughgarden}, title = {Network Design with Weighted Players}, journal = {Theory Comput. Syst.}, volume = {45}, number = {2}, pages = {302--324}, year = {2009}, url = {https://doi.org/10.1007/s00224-008-9128-8}, doi = {10.1007/S00224-008-9128-8}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/ChenR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigecom/ChawlaNR09, author = {Shuchi Chawla and Feng Niu and Tim Roughgarden}, title = {Bertrand competition in networks}, journal = {SIGecom Exch.}, volume = {8}, number = {1}, year = {2009}, url = {https://doi.org/10.1145/1598780.1598790}, doi = {10.1145/1598780.1598790}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigecom/ChawlaNR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigecom/HartlineR09, author = {Jason D. Hartline and Tim Roughgarden}, title = {Simple versus optimal mechanisms}, journal = {SIGecom Exch.}, volume = {8}, number = {1}, year = {2009}, url = {https://doi.org/10.1145/1598780.1598785}, doi = {10.1145/1598780.1598785}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigecom/HartlineR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/amma/DughmiRS09, author = {Shaddin Dughmi and Tim Roughgarden and Mukund Sundararajan}, editor = {Sanmay Das and Michael Ostrovsky and David M. Pennock and Boleslaw K. Szymanski}, title = {Revenue Submodularity}, booktitle = {Auctions, Market Mechanisms and Their Applications, First International {ICST} Conference, {AMMA} 2009, Boston, MA, USA, May 8-9, 2009, Revised Selected Papers}, series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering}, volume = {14}, pages = {89--91}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03821-1\_13}, doi = {10.1007/978-3-642-03821-1\_13}, timestamp = {Fri, 19 May 2017 01:25:54 +0200}, biburl = {https://dblp.org/rec/conf/amma/DughmiRS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Mosk-AoyamaR09, author = {Damon Mosk{-}Aoyama and Tim Roughgarden}, editor = {Susanne Albers and Alberto Marchetti{-}Spaccamela and Yossi Matias and Sotiris E. Nikoletseas and Wolfgang Thomas}, title = {Worst-Case Efficiency Analysis of Queueing Disciplines}, booktitle = {Automata, Languages and Programming, 36th Internatilonal Colloquium, {ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {5556}, pages = {546--557}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-02930-1\_45}, doi = {10.1007/978-3-642-02930-1\_45}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Mosk-AoyamaR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/infocom/MotskinRSG09, author = {Arik Motskin and Tim Roughgarden and Primoz Skraba and Leonidas J. Guibas}, title = {Lightweight Coloring and Desynchronization for Networks}, booktitle = {{INFOCOM} 2009. 28th {IEEE} International Conference on Computer Communications, Joint Conference of the {IEEE} Computer and Communications Societies, 19-25 April 2009, Rio de Janeiro, Brazil}, pages = {2383--2391}, publisher = {{IEEE}}, year = {2009}, url = {https://doi.org/10.1109/INFCOM.2009.5062165}, doi = {10.1109/INFCOM.2009.5062165}, timestamp = {Wed, 16 Oct 2019 14:14:51 +0200}, biburl = {https://dblp.org/rec/conf/infocom/MotskinRSG09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/HartlineR09, author = {Jason D. Hartline and Tim Roughgarden}, editor = {John Chuang and Lance Fortnow and Pearl Pu}, title = {Simple versus optimal mechanisms}, booktitle = {Proceedings 10th {ACM} Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009}, pages = {225--234}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1566374.1566407}, doi = {10.1145/1566374.1566407}, timestamp = {Tue, 27 Nov 2018 11:56:48 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/HartlineR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/DughmiRS09, author = {Shaddin Dughmi and Tim Roughgarden and Mukund Sundararajan}, editor = {John Chuang and Lance Fortnow and Pearl Pu}, title = {Revenue submodularity}, booktitle = {Proceedings 10th {ACM} Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009}, pages = {243--252}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1566374.1566409}, doi = {10.1145/1566374.1566409}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/DughmiRS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GhoshRS09, author = {Arpita Ghosh and Tim Roughgarden and Mukund Sundararajan}, editor = {Michael Mitzenmacher}, title = {Universally utility-maximizing privacy mechanisms}, booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing, {STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009}, pages = {351--360}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1536414.1536464}, doi = {10.1145/1536414.1536464}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GhoshRS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Roughgarden09, author = {Tim Roughgarden}, editor = {Michael Mitzenmacher}, title = {Intrinsic robustness of the price of anarchy}, booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing, {STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009}, pages = {513--522}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1536414.1536485}, doi = {10.1145/1536414.1536485}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Roughgarden09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0911-1813, author = {Aaron Roth and Tim Roughgarden}, title = {The Median Mechanism: Interactive and Efficient Privacy with Multiple Queries}, journal = {CoRR}, volume = {abs/0911.1813}, year = {2009}, url = {http://arxiv.org/abs/0911.1813}, eprinttype = {arXiv}, eprint = {0911.1813}, timestamp = {Tue, 08 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0911-1813.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/PapadimitriouR08, author = {Christos H. Papadimitriou and Tim Roughgarden}, title = {Computing correlated equilibria in multi-player games}, journal = {J. {ACM}}, volume = {55}, number = {3}, pages = {14:1--14:29}, year = {2008}, url = {https://doi.org/10.1145/1379759.1379762}, doi = {10.1145/1379759.1379762}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/PapadimitriouR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AnshelevichDKTWR08, author = {Elliot Anshelevich and Anirban Dasgupta and Jon M. Kleinberg and {\'{E}}va Tardos and Tom Wexler and Tim Roughgarden}, title = {The Price of Stability for Network Design with Fair Cost Allocation}, journal = {{SIAM} J. Comput.}, volume = {38}, number = {4}, pages = {1602--1623}, year = {2008}, url = {https://doi.org/10.1137/070680096}, doi = {10.1137/070680096}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AnshelevichDKTWR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DhangwatnotaiDDR08, author = {Peerapong Dhangwatnotai and Shahar Dobzinski and Shaddin Dughmi and Tim Roughgarden}, title = {Truthful Approximation Schemes for Single-Parameter Agents}, booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2008, October 25-28, 2008, Philadelphia, PA, {USA}}, pages = {15--24}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/FOCS.2008.71}, doi = {10.1109/FOCS.2008.71}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DhangwatnotaiDDR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ifipTCS/Roughgarden08, author = {Tim Roughgarden}, editor = {Giorgio Ausiello and Juhani Karhum{\"{a}}ki and Giancarlo Mauri and C.{-}H. Luke Ong}, title = {Algorithmic Game Theory: Some Greatest Hits and Future Directions}, booktitle = {Fifth {IFIP} International Conference On Theoretical Computer Science - {TCS} 2008, {IFIP} 20th World Computer Congress, {TC} 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy}, series = {{IFIP}}, volume = {273}, pages = {21--42}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-0-387-09680-3\_2}, doi = {10.1007/978-0-387-09680-3\_2}, timestamp = {Fri, 27 Sep 2019 10:35:17 +0200}, biburl = {https://dblp.org/rec/conf/ifipTCS/Roughgarden08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sagt/ChawlaR08, author = {Shuchi Chawla and Tim Roughgarden}, editor = {Burkhard Monien and Ulf{-}Peter Schroeder}, title = {Bertrand Competition in Networks}, booktitle = {Algorithmic Game Theory, First International Symposium, {SAGT} 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4997}, pages = {70--82}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-79309-0\_8}, doi = {10.1007/978-3-540-79309-0\_8}, timestamp = {Tue, 14 May 2019 10:00:42 +0200}, biburl = {https://dblp.org/rec/conf/sagt/ChawlaR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sagt/DobzinskiMRS08, author = {Shahar Dobzinski and Aranyak Mehta and Tim Roughgarden and Mukund Sundararajan}, editor = {Burkhard Monien and Ulf{-}Peter Schroeder}, title = {Is Shapley Cost Sharing Optimal?}, booktitle = {Algorithmic Game Theory, First International Symposium, {SAGT} 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4997}, pages = {327--336}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-79309-0\_29}, doi = {10.1007/978-3-540-79309-0\_29}, timestamp = {Sun, 21 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sagt/DobzinskiMRS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KrauthgamerR08, author = {Robert Krauthgamer and Tim Roughgarden}, editor = {Shang{-}Hua Teng}, title = {Metric clustering via consistent labeling}, booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22, 2008}, pages = {809--818}, publisher = {{SIAM}}, year = {2008}, url = {http://dl.acm.org/citation.cfm?id=1347082.1347171}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/KrauthgamerR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ChenRV08, author = {Ho{-}Lin Chen and Tim Roughgarden and Gregory Valiant}, editor = {Shang{-}Hua Teng}, title = {Designing networks with good equilibria}, booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22, 2008}, pages = {854--863}, publisher = {{SIAM}}, year = {2008}, url = {http://dl.acm.org/citation.cfm?id=1347082.1347176}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ChenRV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HartlineR08, author = {Jason D. Hartline and Tim Roughgarden}, editor = {Cynthia Dwork}, title = {Optimal mechanism design and money burning}, booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008}, pages = {75--84}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1374376.1374390}, doi = {10.1145/1374376.1374390}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HartlineR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0804-2097, author = {Jason D. Hartline and Tim Roughgarden}, title = {Optimal Mechansim Design and Money Burning}, journal = {CoRR}, volume = {abs/0804.2097}, year = {2008}, url = {http://arxiv.org/abs/0804.2097}, eprinttype = {arXiv}, eprint = {0804.2097}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0804-2097.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0811-2841, author = {Arpita Ghosh and Tim Roughgarden and Mukund Sundararajan}, title = {Universally Utility-Maximizing Privacy Mechanisms}, journal = {CoRR}, volume = {abs/0811.2841}, year = {2008}, url = {http://arxiv.org/abs/0811.2841}, eprinttype = {arXiv}, eprint = {0811.2841}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0811-2841.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/GuptaKPR07, author = {Anupam Gupta and Amit Kumar and Martin P{\'{a}}l and Tim Roughgarden}, title = {Approximation via cost sharing: Simpler and better approximation algorithms for network design}, journal = {J. {ACM}}, volume = {54}, number = {3}, pages = {11}, year = {2007}, url = {https://doi.org/10.1145/1236457.1236458}, doi = {10.1145/1236457.1236458}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/GuptaKPR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsac/ButtyanHLLRL07, author = {Levente Butty{\'{a}}n and Jean{-}Pierre Hubaux and Li Li and Xiang{-}Yang Li and Tim Roughgarden and Alberto Leon{-}Garcia}, title = {Guest Editorial Non-Cooperative Behavior in Networking}, journal = {{IEEE} J. Sel. Areas Commun.}, volume = {25}, number = {6}, pages = {1065--1068}, year = {2007}, url = {https://doi.org/10.1109/JSAC.2007.070801}, doi = {10.1109/JSAC.2007.070801}, timestamp = {Thu, 02 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsac/ButtyanHLLRL07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/HavivR07, author = {Moshe Haviv and Tim Roughgarden}, title = {The price of anarchy in an exponential multi-server}, journal = {Oper. Res. Lett.}, volume = {35}, number = {4}, pages = {421--426}, year = {2007}, url = {https://doi.org/10.1016/j.orl.2006.09.005}, doi = {10.1016/J.ORL.2006.09.005}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/HavivR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/RoughgardenS07, author = {Tim Roughgarden and Mukund Sundararajan}, editor = {Matteo Fischetti and David P. Williamson}, title = {Optimal Efficiency Guarantees for Network Design Mechanisms}, booktitle = {Integer Programming and Combinatorial Optimization, 12th International {IPCO} Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4513}, pages = {469--483}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-72792-7\_35}, doi = {10.1007/978-3-540-72792-7\_35}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/ipco/RoughgardenS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/MehtaRS07, author = {Aranyak Mehta and Tim Roughgarden and Mukund Sundararajan}, editor = {Jeffrey K. MacKie{-}Mason and David C. Parkes and Paul Resnick}, title = {Beyond moulin mechanisms}, booktitle = {Proceedings 8th {ACM} Conference on Electronic Commerce (EC-2007), San Diego, California, USA, June 11-15, 2007}, pages = {1--10}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1250910.1250912}, doi = {10.1145/1250910.1250912}, timestamp = {Tue, 27 Nov 2018 11:56:48 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/MehtaRS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/Mosk-AoyamaRS07, author = {Damon Mosk{-}Aoyama and Tim Roughgarden and Devavrat Shah}, editor = {Andrzej Pelc}, title = {Fully Distributed Algorithms for Convex Optimization Problems}, booktitle = {Distributed Computing, 21st International Symposium, {DISC} 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4731}, pages = {492--493}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-75142-7\_41}, doi = {10.1007/978-3-540-75142-7\_41}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/wdag/Mosk-AoyamaRS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/cu/NRTV2007, editor = {Noam Nisan and Tim Roughgarden and {\'{E}}va Tardos and Vijay V. Vazirani}, title = {Algorithmic Game Theory}, publisher = {Cambridge University Press}, year = {2007}, url = {https://doi.org/10.1017/CBO9780511800481}, doi = {10.1017/CBO9780511800481}, isbn = {9780511800481}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/cu/NRTV2007.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijrr/SahaRLS06, author = {Mitul Saha and Tim Roughgarden and Jean{-}Claude Latombe and Gildardo S{\'{a}}nchez{-}Ante}, title = {Planning Tours of Robotic Arms among Partitioned Goals}, journal = {Int. J. Robotics Res.}, volume = {25}, number = {3}, pages = {207--223}, year = {2006}, url = {https://doi.org/10.1177/0278364906061705}, doi = {10.1177/0278364906061705}, timestamp = {Thu, 17 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijrr/SahaRLS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/ColeDR06, author = {Richard Cole and Yevgeniy Dodis and Tim Roughgarden}, title = {How much can taxes help selfish routing?}, journal = {J. Comput. Syst. Sci.}, volume = {72}, number = {3}, pages = {444--467}, year = {2006}, url = {https://doi.org/10.1016/j.jcss.2005.09.010}, doi = {10.1016/J.JCSS.2005.09.010}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/ColeDR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Roughgarden06, author = {Tim Roughgarden}, title = {On the severity of Braess's Paradox: Designing networks for selfish users is hard}, journal = {J. Comput. Syst. Sci.}, volume = {72}, number = {5}, pages = {922--953}, year = {2006}, url = {https://doi.org/10.1016/j.jcss.2005.05.009}, doi = {10.1016/J.JCSS.2005.05.009}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Roughgarden06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/ChawlaR06, author = {Shuchi Chawla and Tim Roughgarden}, editor = {Josep D{\'{\i}}az and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Uri Zwick}, title = {Single-Source Stochastic Routing}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona, Spain, August 28-30 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4110}, pages = {82--94}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11830924\_10}, doi = {10.1007/11830924\_10}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/ChawlaR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/infocom/EnachescuGGMR06, author = {Mihaela Enachescu and Yashar Ganjali and Ashish Goel and Nick McKeown and Tim Roughgarden}, title = {Routers with Very Small Buffers}, booktitle = {{INFOCOM} 2006. 25th {IEEE} International Conference on Computer Communications, Joint Conference of the {IEEE} Computer and Communications Societies, 23-29 April 2006, Barcelona, Catalunya, Spain}, publisher = {{IEEE}}, year = {2006}, url = {https://doi.org/10.1109/INFOCOM.2006.240}, doi = {10.1109/INFOCOM.2006.240}, timestamp = {Wed, 16 Oct 2019 14:14:51 +0200}, biburl = {https://dblp.org/rec/conf/infocom/EnachescuGGMR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/ValiantR06, author = {Gregory Valiant and Tim Roughgarden}, editor = {Joan Feigenbaum and John C.{-}I. Chuang and David M. Pennock}, title = {Braess's paradox in large random graphs}, booktitle = {Proceedings 7th {ACM} Conference on Electronic Commerce (EC-2006), Ann Arbor, Michigan, USA, June 11-15, 2006}, pages = {296--305}, publisher = {{ACM}}, year = {2006}, url = {https://doi.org/10.1145/1134707.1134740}, doi = {10.1145/1134707.1134740}, timestamp = {Tue, 27 Nov 2018 11:56:48 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/ValiantR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ColeDR06, author = {Richard Cole and Yevgeniy Dodis and Tim Roughgarden}, title = {Bottleneck links, variable demand, and the tragedy of the commons}, booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006}, pages = {668--677}, publisher = {{ACM} Press}, year = {2006}, url = {http://dl.acm.org/citation.cfm?id=1109557.1109630}, timestamp = {Thu, 19 Mar 2015 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/ColeDR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/ChenR06, author = {Ho{-}Lin Chen and Tim Roughgarden}, editor = {Phillip B. Gibbons and Uzi Vishkin}, title = {Network design with weighted players}, booktitle = {{SPAA} 2006: Proceedings of the 18th Annual {ACM} Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006}, pages = {29--38}, publisher = {{ACM}}, year = {2006}, url = {https://doi.org/10.1145/1148109.1148114}, doi = {10.1145/1148109.1148114}, timestamp = {Wed, 21 Nov 2018 11:13:10 +0100}, biburl = {https://dblp.org/rec/conf/spaa/ChenR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/RoughgardenS06, author = {Tim Roughgarden and Mukund Sundararajan}, editor = {Jon M. Kleinberg}, title = {New trade-offs in cost-sharing mechanisms}, booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006}, pages = {79--88}, publisher = {{ACM}}, year = {2006}, url = {https://doi.org/10.1145/1132516.1132528}, doi = {10.1145/1132516.1132528}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/RoughgardenS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/ChawlaRS06, author = {Shuchi Chawla and Tim Roughgarden and Mukund Sundararajan}, editor = {Paul G. Spirakis and Marios Mavronicolas and Spyros C. Kontogiannis}, title = {Optimal Cost-Sharing Mechanisms for Steiner Forest Problems}, booktitle = {Internet and Network Economics, Second International Workshop, {WINE} 2006, Patras, Greece, December 15-17, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4286}, pages = {112--123}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11944874\_11}, doi = {10.1007/11944874\_11}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/wine/ChawlaRS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-cs-0606127, author = {Tim Roughgarden and Mukund Sundararajan}, title = {Approximately Efficient Cost-Sharing Mechanisms}, journal = {CoRR}, volume = {abs/cs/0606127}, year = {2006}, url = {http://arxiv.org/abs/cs/0606127}, eprinttype = {arXiv}, eprint = {cs/0606127}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-cs-0606127.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/daglib/0012676, author = {Tim Roughgarden}, title = {Selfish routing and the price of anarchy}, publisher = {{MIT} Press}, year = {2005}, isbn = {978-0-262-18243-0}, timestamp = {Thu, 03 Feb 2011 00:00:00 +0100}, biburl = {https://dblp.org/rec/books/daglib/0012676.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ccr/EnachescuGGMR05, author = {Mihaela Enachescu and Yashar Ganjali and Ashish Goel and Nick McKeown and Tim Roughgarden}, title = {Part {III:} routers with very small buffers}, journal = {Comput. Commun. Rev.}, volume = {35}, number = {3}, pages = {83--90}, year = {2005}, url = {https://doi.org/10.1145/1070873.1070886}, doi = {10.1145/1070873.1070886}, timestamp = {Sun, 06 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ccr/EnachescuGGMR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/Roughgarden05, author = {Tim Roughgarden}, title = {An interview with Vladimir Trifonov 2005 Danny Lewin best student paper award winner}, journal = {{SIGACT} News}, volume = {36}, number = {4}, pages = {111--114}, year = {2005}, url = {https://doi.org/10.1145/1107523.1107526}, doi = {10.1145/1107523.1107526}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/sigact/Roughgarden05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/LinRTW05, author = {Henry C. Lin and Tim Roughgarden and {\'{E}}va Tardos and Asher Walkover}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {497--512}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_41}, doi = {10.1007/11523468\_41}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/LinRTW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/PapadimitriouR05, author = {Christos H. Papadimitriou and Tim Roughgarden}, title = {Computing equilibria in multi-player games}, booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January 23-25, 2005}, pages = {82--91}, publisher = {{SIAM}}, year = {2005}, url = {http://dl.acm.org/citation.cfm?id=1070432.1070444}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/PapadimitriouR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Roughgarden05, author = {Tim Roughgarden}, title = {Selfish routing with atomic players}, booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January 23-25, 2005}, pages = {1184--1185}, publisher = {{SIAM}}, year = {2005}, url = {http://dl.acm.org/citation.cfm?id=1070432.1070600}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Roughgarden05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/geb/RoughgardenT04, author = {Tim Roughgarden and {\'{E}}va Tardos}, title = {Bounding the inefficiency of equilibria in nonatomic congestion games}, journal = {Games Econ. Behav.}, volume = {47}, number = {2}, pages = {389--403}, year = {2004}, url = {https://doi.org/10.1016/j.geb.2003.06.004}, doi = {10.1016/J.GEB.2003.06.004}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/geb/RoughgardenT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/ChudakRW04, author = {Fabi{\'{a}}n A. Chudak and Tim Roughgarden and David P. Williamson}, title = {Approximate \emph{k}-MSTs and \emph{k}-Steiner trees via the primal-dual method and Lagrangean relaxation}, journal = {Math. Program.}, volume = {100}, number = {2}, pages = {411--421}, year = {2004}, url = {https://doi.org/10.1007/s10107-003-0479-2}, doi = {10.1007/S10107-003-0479-2}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/ChudakRW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Roughgarden04, author = {Tim Roughgarden}, title = {Stackelberg Scheduling Strategies}, journal = {{SIAM} J. Comput.}, volume = {33}, number = {2}, pages = {332--350}, year = {2004}, url = {https://doi.org/10.1137/S0097539701397059}, doi = {10.1137/S0097539701397059}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Roughgarden04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/AnshelevichDKTWR04, author = {Elliot Anshelevich and Anirban Dasgupta and Jon M. Kleinberg and {\'{E}}va Tardos and Tom Wexler and Tim Roughgarden}, title = {The Price of Stability for Network Design with Fair Cost Allocation}, booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19 October 2004, Rome, Italy, Proceedings}, pages = {295--304}, publisher = {{IEEE} Computer Society}, year = {2004}, url = {https://doi.org/10.1109/FOCS.2004.68}, doi = {10.1109/FOCS.2004.68}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/AnshelevichDKTWR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/LinRT04, author = {Henry C. Lin and Tim Roughgarden and {\'{E}}va Tardos}, editor = {J. Ian Munro}, title = {A stronger bound on Braess's Paradox}, booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14, 2004}, pages = {340--341}, publisher = {{SIAM}}, year = {2004}, url = {http://dl.acm.org/citation.cfm?id=982792.982840}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/LinRT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Roughgarden04, author = {Tim Roughgarden}, editor = {J. Ian Munro}, title = {The maximum latency of selfish routing}, booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14, 2004}, pages = {980--981}, publisher = {{SIAM}}, year = {2004}, url = {http://dl.acm.org/citation.cfm?id=982792.982939}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Roughgarden04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Roughgarden03, author = {Tim Roughgarden}, title = {The price of anarchy is independent of the network topology}, journal = {J. Comput. Syst. Sci.}, volume = {67}, number = {2}, pages = {341--364}, year = {2003}, url = {https://doi.org/10.1016/S0022-0000(03)00044-8}, doi = {10.1016/S0022-0000(03)00044-8}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Roughgarden03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/GuptaKPR03, author = {Anupam Gupta and Amit Kumar and Martin P{\'{a}}l and Tim Roughgarden}, title = {Approximation Via Cost-Sharing: {A} Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem}, booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings}, pages = {606--615}, publisher = {{IEEE} Computer Society}, year = {2003}, url = {https://doi.org/10.1109/SFCS.2003.1238233}, doi = {10.1109/SFCS.2003.1238233}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/GuptaKPR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigecom/ColeDR03, author = {Richard Cole and Yevgeniy Dodis and Tim Roughgarden}, editor = {Daniel A. Menasc{\'{e}} and Noam Nisan}, title = {How much can taxes help selfish routing?}, booktitle = {Proceedings 4th {ACM} Conference on Electronic Commerce (EC-2003), San Diego, California, USA, June 9-12, 2003}, pages = {98--107}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/779928.779941}, doi = {10.1145/779928.779941}, timestamp = {Tue, 27 Nov 2018 11:56:48 +0100}, biburl = {https://dblp.org/rec/conf/sigecom/ColeDR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GuptaKR03, author = {Anupam Gupta and Amit Kumar and Tim Roughgarden}, editor = {Lawrence L. Larmore and Michel X. Goemans}, title = {Simpler and better approximation algorithms for network design}, booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, {USA}}, pages = {365--372}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/780542.780597}, doi = {10.1145/780542.780597}, timestamp = {Wed, 18 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/GuptaKR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ColeDR03, author = {Richard Cole and Yevgeniy Dodis and Tim Roughgarden}, editor = {Lawrence L. Larmore and Michel X. Goemans}, title = {Pricing network edges for heterogeneous selfish users}, booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, {USA}}, pages = {521--530}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/780542.780618}, doi = {10.1145/780542.780618}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ColeDR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/us/Roughgarden02, author = {Tim Roughgarden}, title = {Selfish Routing}, school = {Cornell University, {USA}}, year = {2002}, timestamp = {Thu, 07 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/us/Roughgarden02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HoffmanJR02, author = {Alan J. Hoffman and Kate Jenkins and Tim Roughgarden}, title = {On a game in directed graphs}, journal = {Inf. Process. Lett.}, volume = {83}, number = {1}, pages = {13--16}, year = {2002}, url = {https://doi.org/10.1016/S0020-0190(01)00309-X}, doi = {10.1016/S0020-0190(01)00309-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HoffmanJR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/RoughgardenT02, author = {Tim Roughgarden and {\'{E}}va Tardos}, title = {How bad is selfish routing?}, journal = {J. {ACM}}, volume = {49}, number = {2}, pages = {236--259}, year = {2002}, url = {https://doi.org/10.1145/506147.506153}, doi = {10.1145/506147.506153}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/RoughgardenT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KumarGR02, author = {Amit Kumar and Anupam Gupta and Tim Roughgarden}, title = {A Constant-Factor Approximation Algorithm for the Multicommodity}, booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings}, pages = {333}, publisher = {{IEEE} Computer Society}, year = {2002}, url = {https://doi.org/10.1109/SFCS.2002.1181956}, doi = {10.1109/SFCS.2002.1181956}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KumarGR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Roughgarden02, author = {Tim Roughgarden}, editor = {David Eppstein}, title = {How unfair is optimal routing?}, booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, {USA}}, pages = {203--204}, publisher = {{ACM/SIAM}}, year = {2002}, url = {http://dl.acm.org/citation.cfm?id=545381.545406}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/Roughgarden02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Roughgarden02, author = {Tim Roughgarden}, editor = {John H. Reif}, title = {The price of anarchy is independent of the network topology}, booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing, May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada}, pages = {428--437}, publisher = {{ACM}}, year = {2002}, url = {https://doi.org/10.1145/509907.509971}, doi = {10.1145/509907.509971}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Roughgarden02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Roughgarden01, author = {Tim Roughgarden}, title = {Designing Networks for Selfish Users is Hard}, booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001, 14-17 October 2001, Las Vegas, Nevada, {USA}}, pages = {472--481}, publisher = {{IEEE} Computer Society}, year = {2001}, url = {https://doi.org/10.1109/SFCS.2001.959923}, doi = {10.1109/SFCS.2001.959923}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Roughgarden01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/ChudakRW01, author = {Fabi{\'{a}}n A. Chudak and Tim Roughgarden and David P. Williamson}, editor = {Karen I. Aardal and Bert Gerards}, title = {Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation}, booktitle = {Integer Programming and Combinatorial Optimization, 8th International {IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2081}, pages = {60--70}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45535-3\_5}, doi = {10.1007/3-540-45535-3\_5}, timestamp = {Tue, 25 Jul 2023 13:14:28 +0200}, biburl = {https://dblp.org/rec/conf/ipco/ChudakRW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Roughgarden01, author = {Tim Roughgarden}, editor = {Jeffrey Scott Vitter and Paul G. Spirakis and Mihalis Yannakakis}, title = {Stackelberg scheduling strategies}, booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece}, pages = {104--113}, publisher = {{ACM}}, year = {2001}, url = {https://doi.org/10.1145/380752.380783}, doi = {10.1145/380752.380783}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Roughgarden01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/RoughgardenT00, author = {Tim Roughgarden and {\'{E}}va Tardos}, title = {How Bad is Selfish Routing?}, booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000, 12-14 November 2000, Redondo Beach, California, {USA}}, pages = {93--102}, publisher = {{IEEE} Computer Society}, year = {2000}, url = {https://doi.org/10.1109/SFCS.2000.892069}, doi = {10.1109/SFCS.2000.892069}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/RoughgardenT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.