Jan Christoph Schlegel

Orcid: 0000-0002-8385-8349

Affiliations:
  • City University of London, UK


According to our database1, Jan Christoph Schlegel authored at least 20 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Reallocation with priorities.
Games Econ. Behav., January, 2024

On sybil-proof mechanisms.
CoRR, 2024

2023
Transaction Ordering Auctions.
CoRR, 2023

Shared Sequencing and Latency Competition as a Noisy Contest.
CoRR, 2023

Would Friedman Burn your Tokens?
CoRR, 2023

Buying Time: Latency Racing vs. Bidding in Fair Transaction Ordering.
CoRR, 2023

Axioms for Constant Function Market Makers.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Buying Time: Latency Racing vs. Bidding for Transaction Ordering.
Proceedings of the 5th Conference on Advances in Financial Technologies, 2023

2022
Axioms for Constant Function AMMs.
CoRR, 2022

On-Chain Auctions with Deposits.
Proceedings of the Financial Cryptography and Data Security. FC 2022 International Workshops, 2022

2020
Welfare theorems for random assignments with priorities.
Games Econ. Behav., 2020

Equivalent choice functions and stable mechanisms.
Games Econ. Behav., 2020

Mechanism Design and Blockchains.
CoRR, 2020

Optimal Smart Contracts with Costly Verification.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2020

2019
Top trading cycles, consistency, and acyclic priorities for house allocation with existing tenants.
J. Econ. Theory, 2019

Trading Networks with General Preferences.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2016
Virtual Demand and Stable Mechanisms.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015
Contracts versus salaries in matching: A general result.
J. Econ. Theory, 2015

2013
The Price of Anarchy in Network Creation Games Is (Mostly) Constant.
Theory Comput. Syst., 2013

2012
Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012


  Loading...