2022
Yamashita, Takuro
and Smolin, Alex
(2022)
Information design in concave games.
In: EC'22: Proceedings of the 23rd ACM Conference on Economics and Computation.
Pennock, David M. (ed.)
Association for Computing Machinery.
Series “ACM Conferences.”
New-York. p. 870.
ISBN 978-1-4503-9150-4
Yamashita, Takuro
and Smolin, Alex
(2022)
Information Design in Concave Games.
TSE Working Paper, n. 22-1313, Toulouse, France
Bergemann, Dirk
, Bonatti, Alessandro, Haupt, Andreas
and Smolin, Alex
(2022)
The Optimality of Upgrade Pricing.
In: Web and Internet economics: 17th International Conference, WINE 2021, December 14–17, 2021
Feldman, Michal
, Hu, Fu
and Talgam-Cohen, Inbal
(eds.)
Springer International Publishing.
Series “Lecture Notes in Computer Science : vol.13112”
Cham pp. 41-58.
ISBN 9783030946753
2023
Smolin, Alex
(2023)
Disclosure and Pricing of Attributes.
RAND Journal of Economics, vol. 54 (n° 4).
pp. 570-597.
Garrett, Daniel F.
, Georgiadis, George, Smolin, Alex
and Szentes, Balazs
(2023)
Optimal technology design.
Journal of Economic Theory, Vol. 209.
2024
Doval, Laura and Smolin, Alex
(2024)
Persuasion and Welfare.
Journal of Political Economy, Vol. 132 (N° 7).
pp. 2451-2487.
2025
Ichihashi, Shota and Smolin, Alex
(2025)
Buyer-Optimal Algorithmic Recommendations.
TSE Working Paper, n. 25-1672, Toulouse
Ichihashi, Shota and Smolin, Alex
(2025)
Data Provision to an Informed Seller.
Games and Economic Behavior, vol. 153.
pp. 131-144.
Bergemann, Dirk
, Bonatti, Alessandro and Smolin, Alex
(2025)
The Economics of Large Language Models: Token Allocation, Fine-Tuning, and Optimal Pricing.
TSE Working Paper, n. 25-1670, Toulouse
Smolin, Alex
and Yamashita, Takuro
ORCID: https://orcid.org/0000-0002-2008-8375
(2025)
Information Design in Smooth Games.
TSE Working Paper, n. 25-1671, Toulouse
Doval, Laura and Smolin, Alex
(2025)
The welfare impact of recommendation algorithms.
ACM SIGecom Exchanges, vol. 22 (n°2).
pp. 56-65.
2026
Dworczak, Piotr and Smolin, Alex
(2026)
Robust Trust.
TSE Working Paper, n. 26-1709, Toulouse

Up a level