Zobrazeno 1 - 10
of 466
pro vyhledávání: '"Roughgarden, Tim"'
Autor:
Durvasula, Naveen, Roughgarden, Tim
We study the risks of validator reuse across multiple services in a restaking protocol. We characterize the robust security of a restaking network as a function of the buffer between the costs and profits from attacks. For example, our results imply
Externí odkaz:
http://arxiv.org/abs/2407.21785
In repeated interaction problems with adaptive agents, our objective often requires anticipating and optimizing over the space of possible agent responses. We show that many problems of this form can be cast as instances of online (nonlinear) control
Externí odkaz:
http://arxiv.org/abs/2406.18805
The purpose of a consensus protocol is to keep a distributed network of nodes "in sync," even in the presence of an unpredictable communication network and adversarial behavior by some of the participating nodes. In the permissionless setting, these
Externí odkaz:
http://arxiv.org/abs/2405.09173
Autor:
Roughgarden, Tim1 (AUTHOR) tim.roughgarden@gmail.com
Publikováno v:
Journal of the ACM. Aug2024, Vol. 71 Issue 4, p1-25. 25p.
In a single-item auction, a duplicitous seller may masquerade as one or more bidders in order to manipulate the clearing price. This paper characterizes auction formats that are shill-proof: a profit-maximizing seller has no incentive to submit any s
Externí odkaz:
http://arxiv.org/abs/2404.00475
Users bid in a transaction fee mechanism (TFM) to get their transactions included and confirmed by a blockchain protocol. Roughgarden (EC'21) initiated the formal treatment of TFMs and proposed three requirements: user incentive compatibility (UIC),
Externí odkaz:
http://arxiv.org/abs/2402.09321
Autor:
Haghtalab, Nika1 (AUTHOR) nhaghtal@gmail.com, Roughgarden, Tim2 (AUTHOR) tim.roughgarden@gmail.com, Shetty, Abhishek1 (AUTHOR) shetty@berkeley.edu
Publikováno v:
Journal of the ACM. Jun2024, Vol. 71 Issue 3, p1-34. 34p.
The goal of this paper is to rigorously interrogate conventional wisdom about centralization in block-building (due to, e.g., MEV and private order flow) and the outsourcing of block-building by validators to specialists (i.e., proposer-builder separ
Externí odkaz:
http://arxiv.org/abs/2401.12120
We present the first nontrivial procedure for configuring heuristic algorithms to maximize the utility provided to their end users while also offering theoretical guarantees about performance. Existing procedures seek configurations that minimize exp
Externí odkaz:
http://arxiv.org/abs/2310.20401