Search Results for author: Aris Filos-Ratsikas

Found 8 papers, 0 papers with code

AI-driven Prices for Sustainable Production Markets

no code implementations10 Jun 2021 Panayiotis Danassis, Aris Filos-Ratsikas, Boi Faltings

The depletion of common-pool resources like fisheries is an indicative example of a market failure.

Fairness reinforcement-learning

On the Complexity of Equilibrium Computation in First-Price Auctions

no code implementations4 Mar 2021 Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças

We consider the problem of computing a (pure) Bayes-Nash equilibrium in the first-price auction with continuous value distributions and discrete bidding space.

Computer Science and Game Theory Computational Complexity

Putting Ridesharing to the Test: Efficient and Scalable Solutions and the Power of Dynamic Vehicle Relocation

no code implementations17 Dec 2019 Panayiotis Danassis, Marija Sakota, Aris Filos-Ratsikas, Boi Faltings

We study the optimization of large-scale, real-time ridesharing systems and propose a modular design methodology, Component Algorithms for Ridesharing (CAR).

Rewarding High-Quality Data via Influence Functions

no code implementations30 Aug 2019 Adam Richardson, Aris Filos-Ratsikas, Boi Faltings

We consider a crowdsourcing data acquisition scenario, such as federated learning, where a Center collects data points from a set of rational Agents, with the aim of training a model.

Federated Learning

Infochain: A Decentralized, Trustless and Transparent Oracle on Blockchain

no code implementations27 Aug 2019 Naman Goel, Cyril van Schreven, Aris Filos-Ratsikas, Boi Faltings

For the first time, we show how to implement a trustless and transparent oracle in Ethereum.

Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior

no code implementations25 Feb 2019 Panayiotis Danassis, Aris Filos-Ratsikas, Boi Faltings

We present a novel anytime heuristic (ALMA), inspired by the human principle of altruism, for solving the assignment problem.

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

no code implementations31 May 2018 Aris Filos-Ratsikas, Paul W. Goldberg

We do this via a PPA-completeness result for an approximate version of the CONSENSUS-HALVING problem, strengthening our recent result that the problem is PPA-complete for inverse-exponential precision.

Reinforcement Mechanism Design for e-commerce

no code implementations25 Aug 2017 Qingpeng Cai, Aris Filos-Ratsikas, Pingzhong Tang, Yiwei Zhang

We study the problem of allocating impressions to sellers in e-commerce websites, such as Amazon, eBay or Taobao, aiming to maximize the total revenue generated by the platform.

Cannot find the paper you are looking for? You can Submit a new open access paper.