Showing 1 - 10 of 20
Persistent link: https://www.econbiz.de/10012661926
We study full surplus extraction and implementation in dynamic environments. We exploit intertemporal correlations of agents' types to construct within-period ex post incentive compatible mechanisms. First, we formulate one-shot environments, in which a single agent has a hidden type and the...
Persistent link: https://www.econbiz.de/10012020290
Persistent link: https://www.econbiz.de/10013337777
We study full surplus extraction and implementation in dynamic environments. We exploit intertemporal correlations of agents' types to construct within-period ex post incentive compatible mechanisms. First, we formulate one-shot environments, in which a single agent has a hidden type and the...
Persistent link: https://www.econbiz.de/10012215289
Persistent link: https://www.econbiz.de/10012637348
We study the design of self-enforcing mechanisms that rely on neither a trusted third party (e.g., court, trusted mechanism designer) nor a long-term relationship. Instead, we use a smart contract written on blockchains as a commitment device. We design the digital court, a smart contract that...
Persistent link: https://www.econbiz.de/10012839521
We study full surplus extraction and implementation in dynamic environments. We exploit intertemporal correlations of agents' types to construct within-period ex post incentive compatible mechanisms. First, we formulate one-shot environments, in which a single agent has a hidden type and the...
Persistent link: https://www.econbiz.de/10012905050
Mining application-specific integrated circuit (ASIC) is an essential facility for mining in Proof-of-Work (PoW) based blockchain systems. This paper regards ASIC as a financial asset and proposes a theoretical estimate of the pricing of ASIC. We show that the payouts from ASIC can be replicated...
Persistent link: https://www.econbiz.de/10012889023
We study the size of matchings (expected number of agents matched to some objects) generated by random mechanisms in the assignment problem. We show that no mechanism that satisfies two weak axioms, weak truncation robustness and weak regularity, achieves an approximation ratio better than 1 -...
Persistent link: https://www.econbiz.de/10012852426
In many random assignment problems, the central planner has their own policy objective, such as matching size and minimum quota fulfillment. A number of practically important policy objectives are not aligned with agents' preferences and known to be incompatible with strategy-proofness. This...
Persistent link: https://www.econbiz.de/10012861671