Picture for Noureddine El Karoui

Noureddine El Karoui

Bidding Agent Design in the LinkedIn Ad Marketplace

Add code
Feb 25, 2022
Figure 1 for Bidding Agent Design in the LinkedIn Ad Marketplace
Figure 2 for Bidding Agent Design in the LinkedIn Ad Marketplace
Figure 3 for Bidding Agent Design in the LinkedIn Ad Marketplace
Viaarxiv icon

A Framework for Fairness in Two-Sided Marketplaces

Add code
Jun 23, 2020
Figure 1 for A Framework for Fairness in Two-Sided Marketplaces
Figure 2 for A Framework for Fairness in Two-Sided Marketplaces
Figure 3 for A Framework for Fairness in Two-Sided Marketplaces
Figure 4 for A Framework for Fairness in Two-Sided Marketplaces
Viaarxiv icon

Scalable Assessment and Mitigation Strategies for Fairness in Rankings

Add code
Jun 19, 2020
Figure 1 for Scalable Assessment and Mitigation Strategies for Fairness in Rankings
Figure 2 for Scalable Assessment and Mitigation Strategies for Fairness in Rankings
Figure 3 for Scalable Assessment and Mitigation Strategies for Fairness in Rankings
Figure 4 for Scalable Assessment and Mitigation Strategies for Fairness in Rankings
Viaarxiv icon

Can we trust the bootstrap in high-dimension?

Add code
Aug 02, 2016
Figure 1 for Can we trust the bootstrap in high-dimension?
Figure 2 for Can we trust the bootstrap in high-dimension?
Figure 3 for Can we trust the bootstrap in high-dimension?
Figure 4 for Can we trust the bootstrap in high-dimension?
Viaarxiv icon

Graph connection Laplacian and random matrices with random blocks

Add code
Nov 16, 2014
Figure 1 for Graph connection Laplacian and random matrices with random blocks
Figure 2 for Graph connection Laplacian and random matrices with random blocks
Figure 3 for Graph connection Laplacian and random matrices with random blocks
Figure 4 for Graph connection Laplacian and random matrices with random blocks
Viaarxiv icon

Connection graph Laplacian methods can be made robust to noise

Add code
May 23, 2014
Figure 1 for Connection graph Laplacian methods can be made robust to noise
Figure 2 for Connection graph Laplacian methods can be made robust to noise
Figure 3 for Connection graph Laplacian methods can be made robust to noise
Figure 4 for Connection graph Laplacian methods can be made robust to noise
Viaarxiv icon