-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.html
149 lines (116 loc) · 6.08 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
<html><head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
<title>
Hedyeh Beyhaghi
</title>
<style>
a {
color: #660099;
}
</style>
</head>
<body bgcolor="#ffefdd">
<div style="margin:0px 14%; padding:0px 4%; border-left-color:#BFA7A6; border-left-style: solid; border-right-color:#BFA7A6; border-right-style: solid;">
<h1> Hedyeh Beyhaghi </h1>
<div style="margin:-7% 0px 11% 0px">
<img src="IMG_2857.jpeg" style="width:180px" align="right">
</div>
College of Information and Computer Sciences <br>
University of Massachusetts Amherst<br>
Office: 250 CS Building<br>
<i>hbeyhaghi at umass.edu</i>
<P>
<br>
<br>
<br>
<br>
I am an Assistant Professor of Computer Science at the <A HREF=https://www.cics.umass.edu/>Manning College of Information and Computer Sciences</A>, UMass Amherst. My research focuses on algorithmic game theory and mechanism design, machine learning theory, and algorithms under uncertainty.
<br>
<br>
I received my PhD in Computer Science from <A HREF=https://www.cs.cornell.edu/>Cornell University</A>. Before joining UMass, I held postdoctoral research fellow positions at the <A HREF=https://www.ttic.edu/>Toyota Technological Institute at Chicago (TTIC)</A>, <A HREF=https://theory.cs.northwestern.edu/>Northwestern University</A>, and <A HREF=http://theory.cs.cmu.edu/>Carnegie Mellon University</A>.
</p>
<div style="border: 1px solid #BFA7A6; padding: 0px 10px 0px 10px; border-radius: 5px; margin: 5px 0;">
<p><b>Prospective Students:</b> Thank you for your interest in joining my group. While I may not be able to respond to individual emails about PhD admissions, students interested in my research are encouraged to apply through UMass Amherst's graduate programs and mention my name in their application.</p>
</div>
<h3><a href="https://hedyehbeyhaghi.github.io/Hedyeh_Beyhaghi_CV.pdf">Curriculum Vitae</a></h3>
<h3>Publications</h3>
<ul>
<p>
</p>New Guarantees for Learning Revenue Maximizing Menus of Lotteries and Two-Part Tariffs [<a href="https://arxiv.org/abs/2302.11700">arXiv</a>]<br>
Nina Balcan, Hedyeh Beyhaghi<br>
To appear in <i>Transactions on Machine Learning Research</i> (TMLR), 2024.
<p></p>
<p>
</p>Recent Developments in Pandora’s Box Problem: Variants and Applications [<a href="https://www.sigecom.org/exchanges/volume_21/1/BEYHAGHI.pdf">PDF</a>]<br>
Hedyeh Beyhaghi, Linda Cai<br>
SIGecom Exchanges, Vol. 21.1, 2023.
<p></p>
<p>
</p>Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAS [<a href="https://arxiv.org/abs/2212.01524">arXiv</a>]<br>
Hedyeh Beyhaghi, Linda Cai<br>
In <i>Proceedings of 55th Annual ACM Symposium on Theory of Computing</i> (STOC), 2023.
<p></p>
<p>
</p>Screening with Disadvantaged Agents [<a href="https://arxiv.org/abs/2305.18068">arXiv</a>]<br>
Hedyeh Beyhaghi, Modibo Camara, Jason Hartline, Aleck Johnsen, Sheng Long<br>
In <i>Proceedings of the 4th annual Symposium on Foundations of Responsible Computing</i> (FORC), 2023.
<p></p>
<p>
</p>Setting Fair Incentives to Maximize Improvement [<a href="https://arxiv.org/abs/2203.00134">arXiv</a>]<br>
Saba Ahmadi, Hedyeh Beyhaghi, Avrim Blum, Keziah Naggita <br>
In <i>Proceedings of the 4th annual Symposium on Foundations of Responsible Computing</i> (FORC), 2023.
<p></p>
<p>
</p>On classification of strategic agents who can both game and improve [<a href="https://arxiv.org/abs/2203.00124">arXiv</a>]<br>
Saba Ahmadi, Hedyeh Beyhaghi, Avrim Blum, Keziah Naggita<br>
In <i>Proceedings of the 3rd annual Symposium on Foundations of Responsible Computing</i> (FORC), 2022.
<p></p>
<p>
</p>Formal Barriers to Simple Algorithms for the Matroid Secretary Problem [<a href="https://arxiv.org/abs/2111.04114">arXiv</a>]<br>
Maryam Bahrani, Hedyeh Beyhaghi, Sahil Singla, Matt Weinberg<br>
In <i>Proceedings of the 17th Conference on Web and Internet Economics</i> (WINE), 2021.
<p></p>
<p>
</p>The Strategic Perceptron [<a href="https://arxiv.org/abs/2008.01710">arXiv</a>]<br>
Saba Ahmadi, Hedyeh Beyhaghi, Avrim Blum, Keziah Naggita<br>
In <i>Proceedings of the 22nd ACM Conference on Economics and Computation</i> (EC), 2021.
<p></p>
<p>
</p>Randomness and Fairness in Two-Sided Matching with Limited Interviews [<a href="https://hedyehbeyhaghi.github.io/limited_interviews.pdf">PDF</a>]<br>
Hedyeh Beyhaghi, Eva Tardos<br>
In <i>Proceedings of the 12th Innovations in Theoretical Computer Science</i> (ITCS), 2021.
<p></p>
<p>
</p>Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms [<a href="https://arxiv.org/abs/1807.03435">arXiv</a>]<br>
Hedyeh Beyhaghi, Negin Golrezaei, Renato Paes Leme, Martin Pal, Balu Sivan<br>
Operations Research, Volume 69, Issue 1, pp, 297 - 314, 2021.
<p></p>
<p>
</p>Optimal (and Benchmark-Optimal) Competition Complexity for Additive Buyers over Independent Items [<a href="https://arxiv.org/abs/1812.01794">arXiv</a>]<br>
Hedyeh Beyhaghi, Matt Weinberg<br>
In <i>Proceedings of the 51st ACM Symposium on Theory of Computing</i> (STOC) 2019.
<p></p>
<p>
</p>Pandora's Problem with Nonobligatory Inspection [<a href="https://arxiv.org/abs/1905.01428">arXiv</a>]<br>
Hedyeh Beyhaghi, Robert Kleinberg<br>
In <i>Proceedings of the 20th ACM conference on Economics and Computation</i> (EC), 2019.
<p></p>
<p>
</p>Effect of Selfish Choices in Deferred Acceptance with Short Lists [<a href="http://arxiv.org/abs/1701.00849">arXiv</a>]<br>
Hedyeh Beyhaghi, Eva Tardos, Daniela Saban<br>
In <i>the 4th International Workshop on Matching Under Preferences</i> (MATCH-UP), 2017.
<p></p>
<p>
</p>Effect of Strategic Grading and Early Offers in Matching Markets [<a href="http://arxiv.org/abs/1507.02718">arXiv</a>]<br>
Hedyeh Beyhaghi, Nishanth Dikkala, Eva Tardos <br>
In <i>Proceedings of the 8th International Symposium on Algorithmic Game Theory</i> (SAGT), 2015.
<p></p>
<p>
</p>
Naturality of Network Creation Games, Measurement and Analysis<br>
Hedyeh Beyhaghi, Zahra Fahmi, Mohammad Amin Fazli, Jafar Habibi, Pooya Jalaly, Mohammad Ali Safari<br>
In <i>Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining</i> (ASONAM), 2012.
<p></p>
</ul>
</div>
</body></html>