activity
20132026
most citedNo truthful mechanism can be better than approximate for two natural problems

4 citations · 11 across the 25 of their papers we have counts for

collaborators
Showing 2023Show all

6 papers · 1 filter

econ.TH2023

Crowdsearch

Hans Gersbach, Akaki Mamageishvili, Fikri Pitsuwan

A common economic process is crowdsearch, wherein a group of agents is invited to search for a valuable object, such as a software vulnerability or a proof-of-work nonce. We study…

cs.GT2023

Shared Sequencing and Latency Competition as a Noisy Contest

Akaki Mamageishvili, Jan Christoph Schlegel

We study shared sequencing for different chains from an economic angle. We introduce a minimal non-trivial model that captures cross-domain arbitrageurs' behavior and compare the p…

cs.GT2023

EIP-4844 Economics and Rollup Strategies

Davide Crapis, Edward W. Felten, Akaki Mamageishvili

We study the economics of the Ethereum improvement proposal 4844 and its effect on rollups' data posting strategies. Rollups' cost consists of two parts: data posting and delay. In…

cs.GT2023

Incentive Schemes for Rollup Validators

Akaki Mamageishvili, Edward W. Felten

We design and analyze attention games that incentivize validators to check computation results. We show that no pure strategy Nash equilibrium of the game without outside parties e…

cs.GT2023

Buying Time: Latency Racing vs. Bidding in Transaction Ordering

Akaki Mamageishvili, Mahimna Kelkar, Jan Christoph Schlegel +1

We design TimeBoost: a practical transaction ordering policy for rollup sequencers that takes into account both transaction timestamps and bids; it works by creating a score from t…

econ.TH2023

Decentralized Attack Search and the Design of Bug Bounty Schemes

Hans Gersbach, Akaki Mamageishvili, Fikri Pitsuwan

Systems and blockchains often have security vulnerabilities and can be attacked by adversaries, with potentially significant negative consequences. Therefore, infrastructure provid…