Obserwuj
Jason Milionis
Jason Milionis
Zweryfikowany adres z cs.columbia.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Quantifying loss in automated market makers
J Milionis, CC Moallemi, T Roughgarden, AL Zhang
Proceedings of the 2022 ACM CCS Workshop on Decentralized Finance and …, 2022
104*2022
The Effect of Trading Fees on Arbitrage Profits in Automated Market Makers
J Milionis, CC Moallemi, T Roughgarden
International Conference on Financial Cryptography and Data Security, 262-265, 2023
37*2023
An impossibility theorem in game dynamics
J Milionis, C Papadimitriou, G Piliouras, K Spendlove
Proceedings of the National Academy of Sciences 120 (41), e2305349120, 2023
162023
A myersonian framework for optimal liquidity provision in automated market makers
J Milionis, CC Moallemi, T Roughgarden
arXiv preprint arXiv:2303.00208, 2023
152023
Differentially private regression with unbounded covariates
J Milionis, A Kalavasis, D Fotakis, S Ioannidis
International Conference on Artificial Intelligence and Statistics, 3242-3273, 2022
132022
Complexity-Approximation Trade-offs in Exchange Mechanisms: AMMs vs. LOBs
J Milionis, CC Moallemi, T Roughgarden
International Conference on Financial Cryptography and Data Security, 326-343, 2023
112023
Nash, Conley, and Computation: Impossibility and Incompleteness in Game Dynamics
J Milionis, C Papadimitriou, G Piliouras, K Spendlove
Algorithmic Game Theory: 15th International Symposium, SAGT 2022, Colchester …, 2022
9*2022
A framework for single-item nft auction mechanism design
J Milionis, D Hirsch, A Arditi, P Garimidi
Proceedings of the 2022 ACM CCS Workshop on Decentralized Finance and …, 2022
82022
Flair: A metric for liquidity provider competitiveness in automated market makers
J Milionis, X Wan, A Adams
arXiv preprint arXiv:2306.09421, 2023
52023
Swim till You Sink: Computing the Limit of a Game
R Hakim, J Milionis, C Papadimitriou, G Piliouras
International Symposium on Algorithmic Game Theory, 205-222, 2024
2024
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–10