Hedyeh Beyhaghi
University of Massachusetts Amherst
Office: 250 CS Building
hbeyhaghi at umass.edu
I am an Assistant Professor of Computer Science at the Manning College of Information and Computer Sciences, UMass Amherst. My research focuses on algorithmic game theory and mechanism design, machine learning theory, and algorithms under uncertainty.
I received my PhD in Computer Science from Cornell University. Before joining UMass, I held postdoctoral research fellow positions at the Toyota Technological Institute at Chicago (TTIC), Northwestern University, and Carnegie Mellon University.
Curriculum Vitae
Teaching
PhD Advisees
Survey Papers
Recent Developments in Pandora’s Box Problem: Variants and Applications [PDF]
Hedyeh Beyhaghi, Linda Cai
SIGecom Exchanges, Vol. 21.1, 2023.
Journal Papers
New Guarantees for Learning Revenue Maximizing Menus of Lotteries and Two-Part Tariffs [arXiv]
Nina Balcan, Hedyeh Beyhaghi
To appear in Transactions on Machine Learning Research (TMLR), 2024.
Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms [arXiv]
Hedyeh Beyhaghi, Negin Golrezaei, Renato Paes Leme, Martin Pal, Balu Sivan
Operations Research, Volume 69, Issue 1, pp, 297 - 314, 2021.
Conference Papers
Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAS [arXiv]
Hedyeh Beyhaghi, Linda Cai
In Proceedings of 55th Annual ACM Symposium on Theory of Computing (STOC), 2023.
Screening with Disadvantaged Agents [arXiv]
Hedyeh Beyhaghi, Modibo Camara, Jason Hartline, Aleck Johnsen, Sheng Long
In Proceedings of the 4th annual Symposium on Foundations of Responsible Computing (FORC), 2023.
Setting Fair Incentives to Maximize Improvement [arXiv]
Saba Ahmadi, Hedyeh Beyhaghi, Avrim Blum, Keziah Naggita
In Proceedings of the 4th annual Symposium on Foundations of Responsible Computing (FORC), 2023.
On classification of strategic agents who can both game and improve [arXiv]
Saba Ahmadi, Hedyeh Beyhaghi, Avrim Blum, Keziah Naggita
In Proceedings of the 3rd annual Symposium on Foundations of Responsible Computing (FORC), 2022.
Formal Barriers to Simple Algorithms for the Matroid Secretary Problem [arXiv]
Maryam Bahrani, Hedyeh Beyhaghi, Sahil Singla, Matt Weinberg
In Proceedings of the 17th Conference on Web and Internet Economics (WINE), 2021.
The Strategic Perceptron [arXiv]
Saba Ahmadi, Hedyeh Beyhaghi, Avrim Blum, Keziah Naggita
In Proceedings of the 22nd ACM Conference on Economics and Computation (EC), 2021.
Randomness and Fairness in Two-Sided Matching with Limited Interviews [PDF]
Hedyeh Beyhaghi, Eva Tardos
In Proceedings of the 12th Innovations in Theoretical Computer Science (ITCS), 2021.
Optimal (and Benchmark-Optimal) Competition Complexity for Additive Buyers over Independent Items [arXiv]
Hedyeh Beyhaghi, Matt Weinberg
In Proceedings of the 51st ACM Symposium on Theory of Computing (STOC) 2019.
Pandora's Problem with Nonobligatory Inspection [arXiv]
Hedyeh Beyhaghi, Robert Kleinberg
In Proceedings of the 20th ACM conference on Economics and Computation (EC), 2019.
Effect of Selfish Choices in Deferred Acceptance with Short Lists [arXiv]
Hedyeh Beyhaghi, Eva Tardos, Daniela Saban
In the 4th International Workshop on Matching Under Preferences (MATCH-UP), 2017.
Effect of Strategic Grading and Early Offers in Matching Markets [arXiv]
Hedyeh Beyhaghi, Nishanth Dikkala, Eva Tardos
In Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015.
Naturality of Network Creation Games, Measurement and Analysis
Hedyeh Beyhaghi, Zahra Fahmi, Mohammad Amin Fazli, Jafar Habibi, Pooya Jalaly, Mohammad Ali Safari
In Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2012.