Personne
Aris Filos Ratsikas
Cette personne n’est plus à l’EPFL
Publications associées (12)
AI-driven Prices for Externalities and Sustainability in Production Markets
Boi Faltings, Aris Filos Ratsikas, Panayiotis Danassis
Traditional competitive markets do not account for negative externalities; indirect costs that some participants impose on others, such as the cost of over-appropriating a common-pool resource (which diminishes future stock, and thus harvest, for everyone) ...
Cornell University2023Peer-Prediction in the Presence of Outcome Dependent Lying Incentives
Boi Faltings, Naman Goel, Aris Filos Ratsikas
We derive conditions under which a peer-consistency mechanism can be used to elicit truthful data from non-trusted rational agents when an aggregate statistic of the collected data affects the amount of their incentives to lie. Furthermore, we discuss the ...
2022Infochain: A Decentralized, Trustless and Transparent Oracle on Blockchain
Boi Faltings, Naman Goel, Aris Filos Ratsikas
Blockchain based systems allow various kinds of financial transactions to be executed in a decentralized manner. However, these systems often rely on a trusted third party (oracle) to get correct information about the real-world events, which trigger the f ...
2022Budget-Bounded Incentives for Federated Learning
Boi Faltings, Aris Filos Ratsikas, Adam Julian Richardson
We consider federated learning settings with independent, self-interested participants. As all contributions are made privately, participants may be tempted to free-ride and provide redundant or low-quality data while still enjoying the benefits of the FL ...
Springer Nature Switzerland AG 20202022Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior
Boi Faltings, Aris Filos Ratsikas, Panayiotis Danassis
We present a novel anytime heuristic (ALMA), inspired by the human principle of altruism, for solving the assignment problem. ALMA is decentralized, completely uncoupled, and requires no communication between the participants. We prove an upper bound on th ...
2019On the Computational Complexity of Blind Detection of Binary Linear Codes
Alexios Konstantinos Balatsoukas Stimming, Aris Filos Ratsikas
In this work, we study the computational complexity of the Minimum Distance Code Detection problem. In this problem, we are given a set of noisy codeword observations and we wish to find a code in a set of linear codes C of a given dimension k, for which t ...
IEEE2019Stable Fractional Matchings
We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral). After observing that, in this cardinal setting, stable fractional matchings c ...
2019The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches
We resolve the computational complexity of two problems known as NECKLACE-SPLITTING and DISCRETE HAM SANDWICH, showing that they are PPA-complete. For NECKLACE SPLITTING, this result is specific to the important special case in which two thieves share the ...
ACM2019Walrasian Dynamics in Multi-unit Markets
In a multi-unit market, a seller brings multiple units of a good and tries to sell them to a set of buyers that have monetary endowments. While a Walrasian equilibrium does not always exist in this model, natural relaxations of the concept that retain its ...
AAAI Press Palo Alto2019Stable Fractional Matchings
We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral). After observing that, in this cardinal setting, stable fractional matchings c ...
ASSOC COMPUTING MACHINERY2019