Deposit Schemes for Incentivizing Honesty in Finite Games of Perfect Information Nikolaj I. Schwartzbach pdf - widget
Game Theory on the Blockchain: A Model for Games with Smart Contracts Mathias Hall-Andersen and Nikolaj I. Schwartzbach SAGT 2021: 14th International Symposium on Algorithmic Game Theory link - preprint - widget
More Communication Lower Bounds for Information-Theoretic MPC Ivan Damgård, Boyang Li, and Nikolaj I. Schwartzbach ITC 2021: 2nd Conference on Information-Theoretic Cryptography link - preprint - video
An Incentive-Compatible Smart Contract for Decentralized Commerce Nikolaj I. Schwartzbach ICBC 2021: 3rd IEEE International Conference on Blockchain and Cryptocurrency link - preprint - widget
Selected list of talks I have given at workshops / conferences.
More Communication Lower Bounds for Information-Theoretic MPC 24th July, 2021 ITC 2021: 2nd Conference on Information-Theoretic Cryptography
Game theory on the blockchain: a model for games with smart contracts 14th June, 2021 SAET 2021: Society for the Advancement of Economic Theory Conference
An Incentive-Compatible Smart Contract for Decentralized Commerce 4th May, 2021 ICBC 2021: 3rd IEEE International Conference on Blockchain and Cryptocurrency
Communication Lower Bounds for Perfect Maliciously Secure MPC 25th May, 2020 TPMPC 2020: Theory and Practice of Multi-Party Computation Workshop
List of all courses where I have worked as a teaching assistant.
Collection of small interactive applications I have developed as supplementary material for selected papers.
Deposit Scheme Calculator. Computes a deposit scheme for incentivizing an intended behavior in a finite game of perfect information. Parties initially make a deposit that is (partially) repaid if the deposit schemes observes certain behavior.
Reverse Stackelberg Calculator. Computes a reverse Stackelberg equilibrium on two-player games of perfect information. This corresponds to the players deploying smart contracts before playing the game. When there are more than two contracts, the problem is conjectured to be NP-complete.