Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Flore Sentenac
Observed name:
Sentenac, Flore
Institutions:
University of Illinois Urbana-Champaign,
HEC Paris
Observed institutions:
University of Illinois Urbana-Champaign,
Centre Inria de Saclay,
Centre de Recherche en Économie et Statistique,
Institut Polytechnique de Paris,
Criteo (France),
Centre Borelli,
FAIRPLAY: IA coopérative : équité, vie privée, incitations,
HEC Paris,
ENSAE Paris
show all 9
ORCID:
0009-0007-2588-2096
Observed ORCIDs:
0009-0007-2588-2096,
0009-0005-3847-5794
OpenAlex ID:
A5022391955
Decentralized Learning in Online Queuing Systems
2021
·
Sentenac, Flore
, Boursier, Etienne
, et al.
·
arXiv (Cornell University)
·
12
PDF
Balancing optimism and pessimism in offline-to-online learning
2025
·
Sentenac, Flore
, Lee, Ilbin
, et al.
·
arXiv (Cornell University)
·
10
PDF
Robust Estimation of Discrete Distributions under Local Differential Privacy
2022
·
Chhor, Julien
, Sentenac, Flore
·
arXiv (Cornell University)
·
8
PDF
Online Matching in Geometric Random Graphs
2025
·
Flore Sentenac
, Nathan Noiry
, et al.
·
Mathematics of Operations Research
·
4
PDF
Flexibility allocation in random bipartite matching markets: exact matching rates and dominance regimes
2026
·
Ameen, Taha
, Sentenac, Flore
, et al.
·
arXiv (Cornell University)
·
1
PDF
A uniformity principle for spatial matching
2026
·
Ameen, Taha
, Sentenac, Flore
, et al.
·
arXiv (Cornell University)
·
1
PDF
The Challenger: When Do New Data Sources Justify Switching Machine Learning Models?
2025
·
Digalakis, Vassilis, Jr
, Pérignon, Christophe
, et al.
·
arXiv (Cornell University)
·
1
PDF
The Challenger: When Do New Data Sources Justify Switching Machine Learning Models?
2025
·
Vassilis Digalakis Jr
, Christophe Pérignon
, et al.
·
SSRN Electronic Journal
·
1
Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits
2024
·
Shuai Liu
, Alex Ayoub
, et al.
·
neural information processing systems
·
1
PDF
Pure Exploration and Regret Minimization in Matching Bandits
2021
·
Sentenac, Flore
, Yi, Jialin
, et al.
·
London School of Economics and Political Science Research Online (London School of Economics and Political Science)
·
1
PDF
SHPRR: An Algorithm for Pure Exploration under Constrained Regret
2026
·
Nouli, Georgina
, Sentenac, Flore
, et al.
·
arXiv (Cornell University)
PDF
When do token systems stabilize? Compatibility constraints and community structure
2026
·
Sentenac, Flore
, Yang, Mingwei
, et al.
·
arXiv (Cornell University)
PDF
On the Average-Case Performance of Greedy for Maximum Coverage
2026
·
Balkanski, Eric
, Chatzitheodorou, Jason
, et al.
·
arXiv (Cornell University)
PDF
Static Scheduling with Predictions Learned through Efficient Exploration
2023
·
Richard, Hugo
, Sentenac, Flore
, et al.
·
HAL
PDF
Learning and Algorithms for Online Matching
2023
·
Flore Sentenac
·
theses.fr (ABES)
PDF
On Preemption and Learning in Stochastic Scheduling
2022
·
Merlis, Nadav
, Richard, Hugo
, et al.
·
arXiv (Cornell University)
PDF
Decentralized Learning in Online Queuing Systems
2021
·
Sentenac, Flore
, Boursier, Etienne
, et al.
·
HAL
Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm
2021
·
Noiry, Nathan
, Sentenac, Flore
, et al.
·
arXiv (Cornell University)
PDF
Show more works
View as search
Works count:
18
Citation count:
40
H-index:
4
I10-index:
2
Year
Topic
Type
