Concept

Théorème d'impossibilité d'Arrow

Publications associées (7)

Robust Sparse Voting

Rachid Guerraoui, Youssef Allouah, Oscar Jean Olivier Villemaud, Le Nguyen Hoang

Many applications, such as content moderation and recommendation, require reviewing and scoring a large number of alternatives. Doing so robustly is however very challenging. Indeed, voters' inputs are inevitably sparse: most alternatives are only scored b ...

2024

Beyond worst-case analysis, with or without predictions

Andreas Maggiori

In this thesis we design online combinatorial optimization algorithms for beyond worst-case analysis settings.In the first part, we discuss the online matching problem and prove that, in the edge arrival model, no online algorithm can achieve a competitive ...

EPFL2023

Collaborative Learning in the Jungle (Decentralized, Byzantine, Heterogeneous, Asynchronous and Nonconvex Learning)

Rachid Guerraoui, Sadegh Farhadkhani, El Mahdi El Mhamdi, Le Nguyen Hoang, Sébastien Louis Alexandre Rouault, Arsany Hany Abdelmessih Guirguis

We study Byzantine collaborative learning, where n nodes seek to collectively learn from each others' local data. The data distribution may vary from one node to another. No node is trusted, and f < n nodes can behave arbitrarily. We prove that collaborati ...

2021

Designing Coalition-Proof Reverse Auctions Over Continuous Goods

Maryam Kamgarpour, Orcun Karaca

This paper investigates reverse auctions that involve continuous values of different types of goods, general nonconvex constraints, and second stage costs. We seek to design the payment rules and conditions under which coalitions of participants cannot inf ...

2019

Developing Attitude Measures Based on Respondents’ Representations of Unfamiliar Objects

Stéphane Joost, Alain Clémence

A key challenge in the design of effective survey questionnaires is to write questions that respondents can understand consistently. Recommendations in the questionnaire design literature propose the use of respondents’ own terminology to facilitate compre ...

2018

From Timed Component-Based Systems to Time-Triggered Implementations: A Correct-by-Design Approach

In hard real-time embedded systems, design and specification methods and their associated tools must allow development of temporally deterministic systems to ensure their safety. To achieve this goal, we are specifically interested in methodologies based o ...

CEA LIST2017

Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be?

André Schiper, Xavier Défago

Peter Urban, Xavier Defago and Andre Schiper: Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be? Keywords: replication, atomic broadcast, consensus, measurements, robustness, high load, LAN, FLP impossibility Abstra ...

2001

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search