Communication Lower Bounds for Perfect Maliciously Secure MPC. - Ivan Damgård; Nikolaj I. Schwartzbach (IACR Cryptol. ePrint Arch., 2020)

Game Theory on the Blockchain: A Model for Games with Smart Contracts. - Mathias Hall-Andersen; Nikolaj I. Schwartzbach (SAGT, 2021)

Deposit schemes for incentivizing behavior in finite games of perfect information. - Nikolaj I. Schwartzbach (CoRR, 2021)

More Communication Lower Bounds for Information-Theoretic MPC. - Ivan Damgård; Boyang Li 012; Nikolaj I. Schwartzbach (IACR Cryptol. ePrint Arch., 2021)

An Incentive-Compatible Smart Contract for Decentralized Commerce. - Nikolaj I. Schwartzbach (IACR Cryptol. ePrint Arch., 2021)

Payment Schemes from Limited Information with Applications in Distributed Computing. - Nikolaj Ignatieff Schwartzbach (EC, 2022)

Adjudication with Rational Jurors. - Ioannis Caragiannis; Nikolaj I. Schwartzbach (CoRR, 2022)

PPP-Completeness and Extremal Combinatorics. - Romain Bourneuf; Lukás Folwarczný; Pavel Hubácek; Alon Rosen; Nikolaj I. Schwartzbach (Electron. Colloquium Comput. Complex., 2022)

Stackelberg Attacks on Auctions and Blockchain Transaction Fee Mechanisms. - Daji Landis; Nikolaj I. Schwartzbach (ECAI, 2023)

Outsourcing Adjudication to Strategic Jurors. - Ioannis Caragiannis; Nikolaj I. Schwartzbach (IJCAI, 2023)

Stackelberg Attacks or: How I Learned to Stop Worrying and Trust the Blockchain. - Daji Landis; Nikolaj I. Schwartzbach (CoRR, 2023)

k-SUM in the Sparse Regime. - Shweta Agrawal 001; Sagnik Saha; Nikolaj I. Schwartzbach; Akhil Vanukuri; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2023)

Which Games are Unaffected by Absolute Commitments? - Daji Landis; Nikolaj I. Schwartzbach (AAMAS, 2024)

k-SUM in the Sparse Regime: Complexity and Applications. - Shweta Agrawal 001; Sagnik Saha; Nikolaj I. Schwartzbach; Akhil Vanukuri; Prashant Nalini Vasudevan (CRYPTO (2), 2024)

Optimal MEV Extraction Using Absolute Commitments. - Daji Landis; Nikolaj I. Schwartzbach (CoRR, 2024)