Zobrazeno 1 - 10
of 174
pro vyhledávání: '"Tim Roughgarden"'
In recent years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. Algorithmic Game Theory, first published in 2007, develops the central ideas and results of this exciting area in a c
Publikováno v:
Proceedings of the 2022 ACM CCS Workshop on Decentralized Finance and Security.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9b7b59a89592d85c8b8636a185052d8
https://doi.org/10.1145/3560832.3563441
https://doi.org/10.1145/3560832.3563441
Autor:
Tim Roughgarden
Publikováno v:
EC
Demand for blockchains such as Bitcoin and Ethereum is far larger than supply, necessitating a mechanism that selects a subset of transactions to include "on-chain" from the pool of all pending transactions. This paper investigates the problem of des
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c625ee17d690bb20b378e67721aeee19
https://doi.org/10.1145/3476436.3476445
https://doi.org/10.1145/3476436.3476445
Publikováno v:
Operations Research. 68:1074-1094
In “Robust Auctions for Revenue via Enhanced Competition,” T. Roughgarden, I. Talgam-Cohen, and Q. Yan revisit the classic Bulow–Klemperer result. This result compares the revenues of two well-known auction formats: the welfare-maximizing Vickr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09d3aa67387070a11ca353fda7feccf7
https://doi.org/10.1287/opre.2019.1929
https://doi.org/10.1287/opre.2019.1929
Autor:
Tim Roughgarden, Rishi Gupta
Publikováno v:
Communications of the ACM. 63:87-94
The best algorithm for a computational problem generally depends on the "relevant inputs," a concept that depends on the application domain and often defies formal articulation. Although there is a large literature on empirical approaches to selectin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c544d384fc791fb753e08ad7350cd5df
https://doi.org/10.1145/3394625
https://doi.org/10.1145/3394625
Autor:
Eric Neyman, Tim Roughgarden
The problem of aggregating expert forecasts is ubiquitous in fields as wide-ranging as machine learning, economics, climate science, and national security. Despite this, our theoretical understanding of this question is fairly shallow. This paper ini
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c0337e37588c63b24a3bd8e127d2af9c
http://arxiv.org/abs/2111.03153
http://arxiv.org/abs/2111.03153
Autor:
Tim Roughgarden
Publikováno v:
Communications of the ACM. 62:88-96
In the worst-case analysis of algorithms, the overall performance of an algorithm is summarized by its worst performance on any input. This approach has countless success stories, but there are also important computational problems --- like linear pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c4ee3f096228d4647df8b7cadae30cb
https://doi.org/10.1145/3232535
https://doi.org/10.1145/3232535
We initiate the study of computing (near-)optimal contracts in succinctly representable principal-agent settings. Here optimality means maximizing the principal's expected payoff over all incentive-compatible contracts---known in economics as "second
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3823224b3e4a4fc71b243707307d21b
http://eprints.lse.ac.uk/107917/
http://eprints.lse.ac.uk/107917/
Autor:
Eric Neyman, Tim Roughgarden
Publikováno v:
EC
This paper forges a strong connection between two seemingly unrelated forecasting problems: incentive-compatible forecast elicitation and forecast aggregation. Proper scoring rules are the well-known solution to the former problem. To each such rule
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1bfee066aa7ea99066c8362aea9eaed4
http://arxiv.org/abs/2102.07081
http://arxiv.org/abs/2102.07081
We prove novel algorithmic guarantees for several online problems in the smoothed analysis model. In this model, at each time an adversary chooses an input distribution with density function bounded above by $\tfrac{1}{\sigma}$ times that of the unif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56d757a123c9166f433b50b9d729c571