Dimitris Fotakis

research

∙ 06/26/2023

Fairness Aware Counterfactuals for Subgroups

In this work, we present Fairness Aware Counterfactuals for Subgroups (F...

0 Loukas Kavouras, et al. ∙

research

∙ 11/23/2022

Perfect Sampling from Pairwise Comparisons

In this work, we study how to efficiently obtain perfect samples from a ...

0 Dimitris Fotakis, et al. ∙

research

∙ 08/24/2022

Sampling and Optimal Preference Elicitation in Simple Mechanisms

In this work we are concerned with the design of efficient mechanisms wh...

0 Ioannis Anagnostides, et al. ∙

research

∙ 08/22/2022

Graph Connectivity with Noisy Queries

Graph connectivity is a fundamental combinatorial optimization problem t...

0 Dimitris Fotakis, et al. ∙

research

∙ 02/19/2022

Differentially Private Regression with Unbounded Covariates

We provide computationally efficient, differentially private algorithms ...

0 Jason Milionis, et al. ∙

research

∙ 11/12/2021

A Constant-Factor Approximation for Generalized Malleable Scheduling under M^♮-Concave Processing Speeds

In generalized malleable scheduling, jobs can be allocated and processed...

0 Dimitris Fotakis, et al. ∙

research

∙ 11/11/2021

Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds

Malleable scheduling is a model that captures the possibility of paralle...

0 Dimitris Fotakis, et al. ∙

research

∙ 11/04/2021

Label Ranking through Nonparametric Regression

Label Ranking (LR) corresponds to the problem of learning a hypothesis t...

0 Dimitris Fotakis, et al. ∙

research

∙ 10/25/2021

Sampling Multiple Nodes in Large Networks: Beyond Random Walks

Sampling random nodes is a fundamental algorithmic primitive in the anal...

0 Omri Ben-Eliezer, et al. ∙

research

∙ 09/05/2021

Dimensionality, Coordination, and Robustness in Voting

We study the performance of voting mechanisms from a utilitarian standpo...

0 Ioannis Anagnostides, et al. ∙

research

∙ 08/22/2021

Efficient Algorithms for Learning from Coarse Labels

For many learning problems one may not have access to fine grained label...

0 Dimitris Fotakis, et al. ∙

research

∙ 07/28/2021

On the Approximability of Multistage Min-Sum Set Cover

We investigate the polynomial-time approximability of the multistage ver...

0 Dimitris Fotakis, et al. ∙

research

∙ 07/26/2021

Strategyproof Facility Location in Perturbation Stable Instances

We consider k-Facility Location games, where n strategic agents report t...

0 Dimitris Fotakis, et al. ∙

research

∙ 07/17/2021

Learning Augmented Online Facility Location

Following the research agenda initiated by Munoz Vassilvitskii [1] a...

0 Dimitris Fotakis, et al. ∙

research

∙ 07/06/2021

Metric-Distortion Bounds under Limited Information

In this work we study the metric distortion problem in voting theory und...

0 Ioannis Anagnostides, et al. ∙

research

∙ 06/08/2021

Efficient Online Learning for Dynamic k-Clustering

We study dynamic clustering problems from the perspective of online lear...

0 Dimitris Fotakis, et al. ∙

research

∙ 12/09/2020

Solving Inverse Problems for Spectral Energy Distributions with Deep Generative Networks

We propose an end-to-end approach for solving inverse problems for a cla...

0 Agapi Rissaki, et al. ∙

research

∙ 11/05/2020

Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent

We consider a natural model of online preference aggregation, where sets...

0 Dimitris Fotakis, et al. ∙

research

∙ 11/02/2020

Aggregating Incomplete and Noisy Rankings

We consider the problem of learning the true ordering of a set of altern...

0 Dimitris Fotakis, et al. ∙

research

∙ 07/16/2020

Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics

We consider the generalized k-server problem on uniform metrics. We stud...

0 Dimitris Christou, et al. ∙

research

∙ 07/05/2020

Efficient Parameter Estimation of Truncated Boolean Product Distributions

We study the problem of estimating the parameters of a Boolean product d...

0 Dimitris Fotakis, et al. ∙

research

∙ 06/17/2020

Mechanism Design for Perturbation Stable Combinatorial Auctions

Motivated by recent research on combinatorial markets with endowed valua...

0 Giannis Fikioris, et al. ∙

research

∙ 03/04/2020

The Online Min-Sum Set Cover Problem

We consider the online Min-Sum Set Cover (MSSC), a natural and intriguin...

0 Dimitris Fotakis, et al. ∙

research

∙ 02/04/2020

Local Aggregation in Preference Games

In this work we introduce a new model of decision-making by agents in a ...

0 Angelo Fanelli, et al. ∙

research

∙ 11/20/2019

Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games

Computing an equilibrium of a game is of central interest in Algorithmic...

0 Dimitris Fotakis, et al. ∙

research

∙ 06/03/2019

Optimal Learning of Mallows Block Model

The Mallows model, introduced in the seminal paper of Mallows 1957, is o...

0 Robert Busa-Fekete, et al. ∙

research

∙ 05/29/2019

Reallocating Multiple Facilities on the Line

We study the multistage K-facility reallocation problem on the real line...

0 Dimitris Fotakis, et al. ∙

research

∙ 03/26/2019

Malleable scheduling beyond identical machines

In malleable job scheduling, jobs can be executed simultaneously on mult...

0 Dimitris Fotakis, et al. ∙

research

∙ 09/06/2018

A Bridge between Liquid and Social Welfare in Combinatorial Auctions with Submodular Bidders

We study incentive compatible mechanisms for Combinatorial Auctions wher...

0 Dimitris Fotakis, et al. ∙

Dimitris Fotakis

Featured Co-authors