6 citations · 32 across the 37 of their papers we have counts for
8 papers · 1 filter
Solving Inverse Problems for Spectral Energy Distributions with Deep Generative Networks
Agapi Rissaki, Orestis Pavlou, Dimitris Fotakis +2
We propose an end-to-end approach for solving inverse problems for a class of complex astronomical signals, namely Spectral Energy Distributions (SEDs). Our goal is to reconstruct…
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent
Dimitris Fotakis, Thanasis Lianeas, Georgios Piliouras +1
We consider a natural model of online preference aggregation, where sets of preferred items along with a demand for items in each , appear online…
Aggregating Incomplete and Noisy Rankings
Dimitris Fotakis, Alkis Kalavasis, Konstantinos Stavropoulos
We consider the problem of learning the true ordering of a set of alternatives from largely incomplete and noisy rankings. We introduce a natural generalization of both the classic…
Memoryless Algorithms for the Generalized -server Problem on Uniform Metrics
Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos
We consider the generalized -server problem on uniform metrics. We study the power of memoryless algorithms and show tight bounds of on their competitive ratio. In parti…
Mechanism Design for Perturbation Stable Combinatorial Auctions
Giannis Fikioris, Dimitris Fotakis
Motivated by recent research on combinatorial markets with endowed valuations by (Babaioff et al., EC 2018) and (Ezra et al., EC 2020), we introduce a notion of perturbation stabil…
Efficient Parameter Estimation of Truncated Boolean Product Distributions
Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos
We study the problem of estimating the parameters of a Boolean product distribution in dimensions, when the samples are truncated by a set accessible thr…
The Online Min-Sum Set Cover Problem
Dimitris Fotakis, Loukas Kavouras, Grigorios Koumoutsos +2
We consider the online Min-Sum Set Cover (MSSC), a natural and intriguing generalization of the classical list update problem. In Online MSSC, the algorithm maintains a permutation…
Local Aggregation in Preference Games
Angelo Fanelli, Dimitris Fotakis
In this work we introduce a new model of decision-making by agents in a social network. Agents have innate preferences over the strategies but, because of the social interactions,…