Výsledky vyhledávání - "Rottembourg, Benoît"

Report

Fairness Auditing with Multi-Agent Collaboration

Autor: de Vos, Martijn, Dhasade, Akash, Bourrée, Jade Garcia, Kermarrec, Anne-Marie, Merrer, Erwan Le, Rottembourg, Benoit, Tredan, Gilles

Existing work in fairness auditing assumes that each audit is performed independently. In this paper, we consider multiple agents working together, each auditing the same platform for different tasks. Agents have two levers: their collaboration strat

Externí odkaz: http://arxiv.org/abs/2402.08522

Zobrazit plný text záznamu

Report

On the relevance of APIs facing fairwashed audits

Autor: Bourrée, Jade Garcia, Merrer, Erwan Le, Tredan, Gilles, Rottembourg, Benoît

Recent legislation required AI platforms to provide APIs for regulators to assess their compliance with the law. Research has nevertheless shown that platforms can manipulate their API answers through fairwashing. Facing this threat for reliable audi

Externí odkaz: http://arxiv.org/abs/2305.13883

Zobrazit plný text záznamu

Akademický článek

When bid price is not enough: Taking better allotment decisions for Camping Revenue Management.

Autor: Rottembourg, Benoît¹ benoit.rottembourg@eurodecision.com, Masson, Jacques²

Publikováno v: Journal of Revenue & Pricing Management. Apr2017, Vol. 16 Issue 2, p115-124. 10p.

Zobrazit plný text záznamu

Relaxation lagrangienne et filtrage par coûts réduits appliqués à la production d'éléctricité

Autor: Benoist, Thierry, Diamantini, Maurice, Rottembourg, Benoît

Publikováno v: [Rapport de recherche] ENSTA ParisTech. 2005

Le problème UCP (Unit Commitment Problem) consiste à planifier la productiond'un parc de centrales électriques de manière à satisfaire un besoinprévisionnel donné sur une échelle de temps discrétisée (besoin horaire sur 24heures). L'obj

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a6c31050d6131d3ba8c40f1eecb48ca8

Zobrazit plný text záznamu

Semi-definite positive programming relaxations for graph K-n-coloring in frequency assignment

Autor: Meurdesoif, Philippe, Rottembourg, Benoît

Publikováno v: RAIRO-Operations Research
RAIRO-Operations Research, 2001, 35, pp.211-228

note; In this paper we will describe a new class of coloring problems, arising from military frequency assignment, where we want to minimize the number of distinct n-uples of colors used to color a given set of n-complete-subgraphs of a graph. We wil

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d82b7c15f75f69489eabc033f81e9f16
https://hal.archives-ouvertes.fr/hal-01124751

Zobrazit plný text záznamu

Dual-based Heuristics for the Fiber-to-Object Assignment Problem

Autor: Rottembourg, Benoît, Sourd, Francis

Publikováno v: International Symposium on Combinatorial Optimization CO'98
International Symposium on Combinatorial Optimization CO'98, Apr 1998, Brussels, Belgium

International audience

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3b410ebee63b608ea50b6cc73c79d2b4
https://hal.archives-ouvertes.fr/hal-02530824

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Vyhledávací nástroje:

Upřesnit hledání