Nicholas Mattei

Nicholas Mattei

Auto-generated profile, based on publicly available information

Nicholas Mattei

Tulane University

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2018
Verified
Conference Paper
Open access
MBMichael Boratko
Michael Boratko
HPHarshit Padigela
Harshit Padigela
DMDivyendra Mikkilineni
Divyendra Mikkilineni
PYPritish Yuvraj
Pritish Yuvraj
RDRajarshi Das
Rajarshi Das
MWMichael Witbrock
Michael Witbrock

1 October 2019 in Artificial Intelligence
Verified
Journal Article
Closed access
HAHaris Aziz
Haris Aziz
OLOmer Lev
Omer Lev
NMNicholas Mattei
Nicholas Mattei
JRJeffrey S. Rosenschein
Jeffrey S. Rosenschein
TWToby Walsh
Toby Walsh

1 July 2019 in IBM Journal of Research and Development
Verified
Journal Article
Closed access
RNR. Noothigattu
R. Noothigattu
DBD. Bouneffouf
D. Bouneffouf
NMN. Mattei
N. Mattei
RCR. Chandra
R. Chandra
PMP. Madan
P. Madan
FRF. Rossi
F. Rossi

14 November 2019 in Algorithmica
Verified
Journal Article
Open access
PDF file
HAHaris Aziz
Haris Aziz
PBPéter Biró
Péter Biró
SGSerge Gaspers
Serge Gaspers
RHRonald de Haan
Ronald de Haan
NMNicholas Mattei
Nicholas Mattei
BRBaharak Rastegari
Baharak Rastegari
We consider the two-sided stable matching setting in which there may be uncertainty about the agents’ preferences due to limited information or communication. We consider three models of uncertainty: (1) lottery model—for each agent, there is a probability distribution over linear preferences, (2) compact indifference model—for each agent, a weak preference order is specified and each linear order compatible with the weak order is equally likely and (3) joint probability model—there is a lottery over preference profiles. For each of the models, we study the computational complexity of computing the stability probability of a given matching as well as finding a matching with the highest probability of being stable. We also examine more restricted problems such as deciding whether a certainly stable matching exists. We find a rich complexity landscape for these problems, indicating that the form uncertainty takes is significant.

13 October 2022 in European Journal of Operational Research
Verified
Journal Article
Closed access
HAHaris Aziz
Haris Aziz
XHXin Huang
Xin Huang
NMNicholas Mattei
Nicholas Mattei
ESErel Segal-Halevi
Erel Segal-Halevi

1 July 2019 in IBM Journal of Research and Development
Verified
Journal Article
Closed access
ABA. Balakrishnan
A. Balakrishnan
DBD. Bouneffouf
D. Bouneffouf
NMN. Mattei
N. Mattei
FRF. Rossi
F. Rossi