TPRC54
Talk, Washington, DC, USA
Research Conference on Communications, Information and Internet Policy. Paper: Market Signals without Mission Distortion: Auction Design for Scientific Spectrum Incumbents.
Talks and posters
WU Vienna University of Economics and Business
Seminar, Vienna, Austria
Universitat Pompeu Fabra
Seminar, Barcelona, Spain
IESE Business School
Seminar
FairPlay team (Inria, CREST, Criteo)
Seminar, Paris, France
CIRRELT
Seminar
EECS seminar, group of Vijay Subramanian
Talk, University of Michigan, Ann Arbor, Michigan, USA
Paper: Sharing with Frictions: Limited Transfers and Costly Inspections.
INFORMS Annual Meeting 2025
Talk, Atlanta, Georgia, USA
INFORMS Optimization Society (OPT) session on Nonlinear Optimization.
INFORMS Annual Meeting 2025
Talk, Atlanta, Georgia, USA
Workshop on Replicability at INFORMS Journals. Paper: Capacity Planning in Stable Matching.
SpectrumX Center Meeting 2025
Talk, University of Wisconsin–Madison, Madison, Wisconsin, USA
TOC for Fairness Seminar
Talk, Simons Collaboration on the Theory of Algorithmic Fairness, Online
Paper: Sharing with Frictions: Limited Transfers and Costly Inspections.
Young Researchers Workshop 2025
Poster, School of Operations Research and Information Engineering, Cornell University, Ithaca, New York, USA
Paper: Sharing with Frictions: Limited Transfers and Costly Inspections.
Future BA Prof Workshop
Talk, University of Iowa, Iowa City, Iowa, USA
Paper: Sharing with Frictions: Limited Transfers and Costly Inspections.
Fairness in Social Choice Workshop
Talk, Northwestern University, Evanston, Illinois, USA
Theory Brown Bag
Talk, Northwestern University, Evanston, Illinois, USA
Dagstuhl Seminar 25071
Talk, Schloss Dagstuhl, Wadern, Germany
Dealing with Complexities in Auction and Matching Market Design. Paper: Sharing with Frictions: Limited Transfers and Costly Inspections.
SpectrumX Policy Meeting
Talk, Online
Quantitative Methods and Statistics Seminar
Talk, Purdue University, West Lafayette, Indiana, USA
ISMP 2024
Talk, Montréal, Québec, Canada
International Symposium on Mathematical Programming. Paper: Stable Matching with Contingent Priorities.
Devavrat Shah’s group meeting
Talk, Department of Electrical Engineering and Computer Science, MIT, Cambridge, Massachusetts, USA
On my Ph.D. thesis, Dynamic Capacities and Priorities in Stable Matching.
Algorithms, Approximation, and Learning in Market and Mechanism Design
Poster, Simons Laufer Mathematical Sciences Institute (SLMath), Berkeley, California, USA
CIREQ Microeconomics Seminar
Talk, Département de sciences économiques, Université de Montréal, Montréal, Québec, Canada
Séminaire de microéconomie of the Centre interuniversitaire de recherche en économie quantitative (CIREQ).
INFORMS Annual Meeting 2023
Talk, Phoenix, Arizona, USA
Game Theory and Discrete Optimization session.
Young Researchers Workshop 2023
Poster, School of Operations Research and Information Engineering, Cornell University, Ithaca, New York, USA
EC 2023
Talk, King's College London, London, UK
Twenty-Fourth ACM Conference on Economics and Computation; acceptance rate ~26%. Paper: Capacity Planning in Stable Matching.
MSOM 2023
Talk, McGill University, Montréal, Québec, Canada
INFORMS Manufacturing and Service Operations Management Conference. Paper: Stable Matching with Contingent Priorities.
International Symposium on Current Topics of Logical Structures in Mathematics
Invited talk, Department of Mathematics, Ege University, Izmir, Turkey
Paper: Capacity Variation in the Many-to-one Stable Matching.
EAAMO 2022
Talk, George Mason University, Arlington, Virginia, USA
ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization; acceptance rate ~27%. Paper: Capacity Planning in Stable Matching.
MATCH-UP 2022
Talk, TU Wien, Vienna, Austria
International Workshop on Matching Under Preferences; acceptance rate ~30%. Paper: Capacity Planning in Stable Matching.
MIP 2022
Poster, DIMACS, Rutgers University, New Brunswick, New Jersey, USA
Mixed Integer Programming Workshop 2022. Poster: Margaridinhas vs. MIP 2022 Competition. Report: Design and Implementation of an Heuristic-Enhanced Branch-and-Bound Solver for MILP.
GAIW 2022
Talk, The University of Auckland, Auckland, New Zealand
Games, Agents and Incentives Workshop. Talk: Capacity Expansion in the College Admission Problem, an early version of Capacity Planning in Stable Matching. Video of the talk.
Workshop on Agents’ Behaviour in Combinatorial Game Theory
Poster, Montréal, Québec, Canada
Poster: Capacity Expansion in the College Admission Problem, an early version of Capacity Planning in Stable Matching.
INFORMS Annual Meeting 2021
Talk
Talk: Capacity Expansion in the College Admission Problem, an early version of Capacity Planning in Stable Matching.
EURO 2021
Talk, Athens, Greece
31st European Conference on Operational Research. Talk: Capacity Expansion in the College Admission Problem, an early version of Capacity Planning in Stable Matching.
EUMAS 2017
Talk, Évry, France
European Conference on Multi-Agent Systems. Paper: A Plausibility Model for Regret Games.
Logic Colloquium 2017
Talk, Stockholm, Sweden
Strategic Reasoning Workshop 2017
Talk, Liverpool, UK