|
 | Up a level |
Dütting, Paul, Roughgarden, Tim and Talgam-Cohen, Inbal (2021) The complexity of contracts. SIAM Journal on Computing, 50 (1). 211 - 254. ISSN 0097-5397
Dütting, Paul, Roughgarden, Tim and Talgam-Cohen, Inbal (2020) The complexity of contracts. In: Chawla, Shuchi, (ed.) Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 2688 - 2707. ISBN 9781611975994
Dütting, Paul, Roughgarden, Tim and Talgam-Cohen, Inbal (2019) Simple versus optimal contracts. In: 20th ACM conference on Economics and Computation, 2019-06-24 - 2019-06-28, Phoenix, United States, USA.
Dütting, Paul, Talgam-Cohen, Inbal and Roughgarden, Tim (2017) Modularity and greed in double auctions. Games and Economic Behavior, 105. pp. 59-83. ISSN 0899-8256
Dütting, Paul, Talgam-Cohen, Inbal and Roughgarden, Tim (2014) Modularity and greed in double auctions. In: Babaioff, Moshe, Conitzer, Vincent and Easley, David, (eds.) EC '14: Proceedings of the Fifteenth ACM Conference on Economics and Computation. Association for Computing Machinery, New York, USA, pp. 241-258. ISBN 9781450325653
