Algorithmic and Mechanism Design Research in Online MArkets

CORDIS fournit des liens vers les livrables publics et les publications des projets HORIZON.

Les liens vers les livrables et les publications des projets du 7e PC, ainsi que les liens vers certains types de résultats spécifiques tels que les jeux de données et les logiciels, sont récupérés dynamiquement sur OpenAIRE .

Publications

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness

Auteurs: Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Publié dans: Proceedings of the 14th Conference on Web and Internet Economics 2021 (WINE 2021), 2021, Page(s) 149-166, ISBN 9783030946760
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-94676-0_9

Total Completion Time Scheduling Under Scenarios

Auteurs: Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie
Publié dans: WAOA 2023: 104-118 International Workshop on Approximation and Online Algorithms, Numéro vol 14297, 2023
Éditeur: Lecture Notes in Computer Science
DOI: 10.48550/arxiv.2402.19259

Flow time scheduling with uncertain processing time

Auteurs: Yossi Azar, Stefano Leonardi, Noam Touitou
Publié dans: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2023
Éditeur: ACM
DOI: 10.1145/3406325.3451023

Single-Sample Prophet Inequalities via Greedy-Ordered Selection

Auteurs: Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser
Publié dans: 33rd SODA 2022, 2022, Page(s) 1298-1325, ISBN 978-1-61197-707-3
Éditeur: ArXiv
DOI: 10.48550/arxiv.2111.03174

Distortion-Oblivious Algorithms for Minimizing Flow Time

Auteurs: Yossi Azar, Stefano Leonardi, Noam Touitou
Publié dans: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), 2022, Page(s) 252-274
Éditeur: Society for Industrial and Applied Mathematics (SIAM)
DOI: 10.1137/1.9781611977073.13

Bandits with Replenishable Knapsacks: the Best of both Worlds

Auteurs: Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco
Publié dans: ICLR 2024, 2024
Éditeur: .
DOI: 10.48550/arxiv.2306.08470

Stochastic bandits for multi-platform budget optimization in online advertising

Auteurs: Vashist Avadhanula, Riccardo Colini Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers
Publié dans: Proceedings of the Web Conference 2021, 2023
Éditeur: ACM
DOI: 10.1145/3442381.3450074

Learning Double-Compression Video Fingerprints Left from Social-Media Platforms

Auteurs: Irene Amerini, Aris Anagnostopoulos, Luca Maiano, Lorenzo Ricciardi Celsi
Publié dans: ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2021
Éditeur: IEEE
DOI: 10.1109/icassp39728.2021.9413366

Expansion and Flooding in Dynamic Random Networks with Node Churn

Auteurs: Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Publié dans: Proceedings of the 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS 2021), 2021, Page(s) 976-986, ISBN 9781665445139
Éditeur: Institute of Electrical and Electronics Engineers (IEEE)
DOI: 10.1109/icdcs51616.2021.00097

Single Sample Prophet Inequalities via Greedy-Ordered Selection

Auteurs: Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser
Publié dans: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), 2022, Page(s) 1298-1325
Éditeur: Society for Industrial and Applied Mathematics (SIAM)
DOI: 10.1137/1.9781611977073.54

Pandora's Box Problem with Order Constraints

Auteurs: Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi
Publié dans: Proceedings of the 21st ACM Conference on Economics and Computation, 2020, Page(s) 439-458, ISBN 9781450379755
Éditeur: Association for Computing Machinery (ACM)
DOI: 10.1145/3391403.3399501

Deletion Robust Submodular Maximization over Matroids

Auteurs: Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
Publié dans: Proceedings of the 39th International Conference on Machine Learning, Numéro PMLR 162, 2022, Page(s) 5671-5693
Éditeur: Proceedings press
DOI: 10.48550/arxiv.2201.13128

A Regret Analysis of Bilateral Trade

Auteurs: Nicolò Cesa-Bianchi, Tom Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi
Publié dans: Proceedings of the 22nd ACM Conference on Economics and Computation (EC21), 2021, Page(s) 289–309, ISBN 9781450385541
Éditeur: Association for Computing Machinery (ACM)
DOI: 10.1145/3465456.3467645

NEWRON: A New Generalization of the Artificial Neuron to Enhance the Interpretability of Neural Networks

Auteurs: Federico Siciliano, Maria Sofia Bucarelli, Gabriele Tolomei, Fabrizio Silvestri
Publié dans: 2022 International Joint Conference on Neural Networks (IJCNN), 2022
Éditeur: IEEE
DOI: 10.1109/ijcnn55064.2022.9892367

Online Revenue Maximization for Server Pricing

Auteurs: Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta
Publié dans: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Page(s) 4106-4112, ISBN 978-0-9992411-6-5
Éditeur: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/568

Biased Opinion Dynamics: When the Devil is in the Details

Auteurs: Aris Anagnostopoulos, Luca Becchetti, Emilio Cruciani, Francesco Pasquale, Sara Rizzo
Publié dans: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Page(s) 53-59, ISBN 978-0-9992411-6-5
Éditeur: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/8

Collaborative Procrastination

Auteurs: Aris Anagnostopoulos, Aristides Gionis, Nikos Parotsidis
Publié dans: 10th International Conference on Fun with Algorithms (FUN 2021), Numéro 157, 2020, Page(s) 2:1--2:20, ISBN 978-3-95977-145-0
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.fun.2021.2

An α-regret Analysis of Adversarial Bilateral Trade

Auteurs: Yossi Azar, Amos Fiat, Federico Fusco
Publié dans: NeurIPS Proceedings 2022, 2022
Éditeur: NeurIPS
DOI: 10.48550/arxiv.2210.06846

Pandora's Problem with Combinatorial Cost

Auteurs: Ben Berger, Tomer Ezra, Michal Feldman, Federico Fusco
Publié dans: EC '23: Proceedings of the 24th ACM Conference on Economics and Computation, 2023, Page(s) 273–292
Éditeur: ACMDL
DOI: 10.1145/3580507.3597699

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations

Auteurs: Nicolo Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi
Publié dans: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Éditeur: ACM
DOI: 10.1145/3618260.3649658

RPPLNS: Pay-per-Last-N-Shares with a Randomised Twist

Auteurs: Philip Lazos, Francisco J. Marmolejo-Cossío, Xinyu Zhou, Jonathan Katz
Publié dans: Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'2021, Virtual Event, United Kingdom), 2021, Page(s) 1569-1571, ISBN 9781450383073
Éditeur: International Foundation for Autonomous Agents and Multiagent Systems

General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching

Auteurs: Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
Publié dans: EC '22: Proceedings of the 23rd ACM Conference on Economics and Computation, 2022, Page(s) 1148–1177
Éditeur: dl.acm
DOI: 10.1145/3490486.3538290

Truthful Matching with Online Items and Offline Agents

Auteurs: Michal Feldman, Federico Fusco, Stefano Leonardi, Simon Mauras, Rebecca Reiffenhäuser
Publié dans: 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), 2023
Éditeur: Drops
DOI: 10.4230/lipics.icalp.2023.58

Skyline in Crowdsourcing with Imprecise Comparisons

Auteurs: Aris Anagnostopoulos, Adriano Fazzone, Giacomo Vettraino
Publié dans: Proceedings of the 30th ACM International Conference on Information & Knowledge Management (CIKM2021), 2021, Page(s) 37–46, ISBN 9781450384469
Éditeur: Association for Computing Machinery (ACM)
DOI: 10.1145/3459637.3482479

RePBubLik: Reducing Polarized Bubble Radius with Link Insertions

Auteurs: Shahrzad Haddadan, Cristina Menghini, Matteo Riondato, Eli Upfal
Publié dans: Proceedings of the 14th ACM International Conference on Web Search and Data Mining, 2023
Éditeur: ACM
DOI: 10.1145/3437963.3441825

Repeated Bilateral Trade Against a Smoothed Adversary

Auteurs: Nicolò Cesa-Bianchi, Tommaso R. Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi
Publié dans: Proceedings of Thirty Sixth Conference on Learning Theory, Numéro PMLR 195, 2023, Page(s) 1095-1130
Éditeur: MLResearch press
DOI: 10.48550/arxiv.2302.10805

No-Regret Learning in Bilateral Trade via Global Budget Balance

Auteurs: Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco
Publié dans: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Éditeur: ACM
DOI: 10.1145/3618260.3649653

Repeated Bilateral Trade Against a Smoothed Adversary

Auteurs: Nicolò Cesa-Bianchi, Tommaso R. Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi
Publié dans: Proceedings of Thirty Sixth Conference on Learning Theory, PMLR, Numéro 195, 2023, Page(s) 1095-1130
Éditeur: MLResearchPress

Fair Division of Indivisible Goods: A Survey

Auteurs: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Publié dans: Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI 2022), 2022
Éditeur: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.48550/arxiv.2202.07551

Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria

Auteurs: Georgios Birmpas, Lyudmila Kovalchuk, Philip Lazos, Roman Oliynykov
Publié dans: AFT 22, 2022
Éditeur: ArXiv
DOI: 10.48550/arxiv.2202.04064

FbMultiLingMisinfo: Challenging Large-Scale Multilingual Benchmark for Misinformation Detection

Auteurs: Giorgio Barnabò, Federico Siciliano, Carlos Castillo, Stefano Leonardi, Preslav Nakov, Giovanni Da San Martino, Fabrizio Silvestri
Publié dans: International Joint Conference on Neural Networks (IJCNN), 2022
Éditeur: IEEE
DOI: 10.1109/ijcnn55064.2022.9892739

Learning on the Edge: Online Learning with Stochastic Feedback Graphs

Auteurs: Emmanuel Esposito, Federico Fusco, Dirk van der Hoeven, Nicolò Cesa-Bianchi
Publié dans: NeurIPS Proceedings 2022, 2022
Éditeur: NeurIPS
DOI: 10.48550/arxiv.2210.04229

Distortion-Oblivious Algorithms for Minimizing Flow Time

Auteurs: Yossi Azar, Stefano Leonardi, Noam Touitou
Publié dans: 33rd SODA 2022, 2022, Page(s) 252-274, ISBN 978-1-61197-707-3
Éditeur: ArXiv
DOI: 10.48550/arxiv.2109.08424

Fairness in Streaming Submodular Maximization over a Matroid Constraint

Auteurs: Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski
Publié dans: Proceedings of the 40th International Conference on Machine Learning, Numéro 202, 2023, Page(s) 9150-9171
Éditeur: MLResearchPress

R <scp>e</scp> LAX: Reinforcement Learning Agent Explainer for Arbitrary Predictive Models

Auteurs: Ziheng Chen, Fabrizio Silvestri, Jia Wang, He Zhu, Hongshik Ahn, Gabriele Tolomei
Publié dans: Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2023
Éditeur: ACM
DOI: 10.1145/3511808.3557429

Fair Equilibria in Sponsored Search Auctions: The Advertisers’ Perspective

Auteurs: Georgios Birmpas, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi
Publié dans: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022, Page(s) 95-101
Éditeur: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2022/14

Algorithms for Hiring and Outsourcing in the Online Labor Market

Auteurs: Aris Anagnostopoulos, Carlos Castillo, Adriano Fazzone, Stefano Leonardi, Evimaria Terzi
Publié dans: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining - KDD '18, 2018, Page(s) 1109-1118, ISBN 9781-450355520
Éditeur: Association for Computing Machinery
DOI: 10.1145/3219819.3220056

Compiling Questions into Balanced Quizzes about Documents

Auteurs: Cristina Menghini, Jessica Dehler Zufferey, Robert West
Publié dans: Proceedings of the 27th ACM International Conference on Information and Knowledge Management - CIKM '18, 2018, Page(s) 1519-1522, ISBN 9781-450360142
Éditeur: Association for Computing Machinery
DOI: 10.1145/3269206.3269298

On Coresets for Logistic Regression

Auteurs: Alexander Munteanu, Chris Schwiegelshohn, Christian Sohler, David Woodruff
Publié dans: Proceedings of the 32nd International Conference on Neural Information Processing Systems (NeurIPS 2018) 2018, Montréal, CANADA, 2018, Page(s) 6561--6570
Éditeur: Curran Associates Inc.

An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem

Auteurs: Rebecca Reiffenhauser
Publié dans: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Page(s) 1982-1993, ISBN 978-1-61197-548-2
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.120

(1 + ∊ )-Approximate Incremental Matching in Constant Deterministic Amortized Time

Auteurs: Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn,, Shay Solomon
Publié dans: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Page(s) 1886-1898, ISBN 978-1-61197-548-2
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.114

Algorithms for Fair Team Formation in Online Labour Marketplaces✱

Auteurs: Giorgio Barnabò, Adriano Fazzone, Stefano Leonardi, Chris Schwiegelshohn
Publié dans: Companion Proceedings of The 2019 World Wide Web Conference on - WWW '19, 2019, Page(s) 484-490, ISBN 9781-450366755
Éditeur: Association for Computing Machinery
DOI: 10.1145/3308560.3317587

Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma

Auteurs: Luca Becchetti, Marc Bury, Vincent Cohen-Addad, Fabrizio Grandoni, Chris Schwiegelshohn
Publié dans: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Page(s) 1039-1050, ISBN 9781-450367059
Éditeur: Association for Computing Machinery
DOI: 10.1145/3313276.3316318

Stochastic Graph Exploration

Auteurs: Aris Anagnostopoulos, Ilan R. Cohen, Stefano Leonardi, Jakub Lacki
Publié dans: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 2019, Patras, Greece, 2019, ISBN 978-3-95977-109-2
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2019.136

Envy, Regret, and Social Welfare Loss

Auteurs: Riccardo Colini-Baldeschi, Stefano Leonardi, Okke Schrijvers, Eric Sodomka
Publié dans: Proceedings of The Web Conference 2020, 2020, Page(s) 2913-2919, ISBN 9781450370233
Éditeur: ACM
DOI: 10.1145/3366423.3380057

Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries

Auteurs: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Voudouris
Publié dans: Proceedings of the AAAI Conference on Artificial Intelligence, Numéro 34/02, 2020, Page(s) 1782-1789, ISSN 2374-3468
Éditeur: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/aaai.v34i02.5544

Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination

Auteurs: Georgios Amanatidis, Evangelos Markakis, Apostolos Ntokos
Publié dans: Proceedings of the AAAI Conference on Artificial Intelligence, Numéro 34/02, 2020, Page(s) 1790-1797, ISSN 2374-3468
Éditeur: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/aaai.v34i02.5545

Firms Default Prediction with Machine Learning

Auteurs: Tesi Aliaj, Aris Anagnostopoulos, Stefano Piersanti
Publié dans: Mining Data for Financial Applications - 4th ECML PKDD Workshop, MIDAS 2019, Würzburg, Germany, September 16, 2019, Revised Selected Papers, Numéro 11985, 2020, Page(s) 47-59, ISBN 978-3-030-37719-9
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-37720-5_4

Finding a Bounded-Degree Expander Inside a Dense One

Auteurs: Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Publié dans: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Page(s) 1320-1336, ISBN 978-1-61197-599-4
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.80

Step-By-Step Community Detection in Volume-Regular Graphs

Auteurs: Luca Becchetti, Emilio Cruciani, Francesco Pasquale, Sara Rizzo
Publié dans: 30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019, Shanghai, China, 2019, ISBN 978-3-95977-130-6
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.isaac.2019.20

Affirmative action policies for top-k candidates selection - with an application to the design of policies for university admissions

Auteurs: Michael Mathioudakis, Carlos Castillo, Giorgio Barnabo, Sergio Celis
Publié dans: Proceedings of the 35th Annual ACM Symposium on Applied Computing, 2020, Page(s) 440-449, ISBN 9781450368667
Éditeur: ACM
DOI: 10.1145/3341105.3373878

Maximum Nash Welfare and Other Stories About EFX

Auteurs: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris
Publié dans: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Page(s) 24-30, ISBN 978-0-9992411-6-5
Éditeur: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/4

Efficient Two-Sided Markets with Limited Information

Auteurs: Paul Dutting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhauser
Publié dans: Accepted at the Accepted at the 53rd Annual ACM Symposium on Theory of Computing June 21–25, 2021, (STOC 2021), Rome (virtually), Italy, 2021
Éditeur: Association for Computing Machinery (ACM)

How Inclusive Are Wikipedia's Hyperlinks in Articles Covering Polarizing Topics?

Auteurs: Cristina Menghini, Aris Anagnostopoulos, Eli Upfal
Publié dans: Proceedings of the 2021 IEEE International Conference on Big Data (IEEE BigData 2021), 2021, Page(s) 1300-1307, ISBN 9781665445993
Éditeur: Institute of Electrical and Electronics Engineers (IEEE)
DOI: 10.1109/bigdata52589.2021.9671943

The Safe and Effective Use of Low-AssurancePredictions in Safety-Critical Systems

Auteurs: Kunal Agrawal, Sanjoy Baruah, Michael A. Bender, Alberto Marchetti-Spaccamela
Publié dans: Proc. 35th Euromicro Conference on Real-Time Systems ECRTS, 2023
Éditeur: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.ecrts.2023.3

On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems

Auteurs: Alberto Marchetti-Spaccamela, Nicole Megow, Jens Schloter, Martin Skutella, Leen Stougie
Publié dans: 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020, Page(s) 1061-1070, ISBN 978-1-7281-6876-0
Éditeur: Institute of Electrical and Electronics Engineers (IEEE)
DOI: 10.1109/ipdps47924.2020.00112

On a Voter Model with Context-Dependent Opinion Adoption

Auteurs: Luca Becchetti, Vincenzo Bonifaci, Emilio Cruciani, Francesco Pasquale
Publié dans: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023, Page(s) 38-45
Éditeur: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2023/5

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity

Auteurs: Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti Spaccamela, Rebecca Reiffenhäuser
Publié dans: Proceedings of the 38th International Conference on Machine Learning (ICML 2021), Numéro 139, 2021, Page(s) 231-242, ISSN 1938-7228
Éditeur: Proceedings of Machine Learning Research (PMLR)

Spectral Relaxations and Fair Densest Subgraphs

Auteurs: Aris Anagnostopoulos, Luca Becchetti, Adriano Fazzone, Cristina Menghini, Chris Schwiegelshohn
Publié dans: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, 2020, Page(s) 35-44, ISBN 9781450368599
Éditeur: Association for Computing Machinery (ACM)
DOI: 10.1145/3340531.3412036

Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria

Auteurs: Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Publié dans: Proceedings of the 24th ACM Conference on Economics and Computation, 2023
Éditeur: ACM
DOI: 10.1145/3580507.3597796

Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond

Auteurs: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Publié dans: 36th Conference on Neural Information Processing Systems NeurlPS, 2022
Éditeur: ArXiv
DOI: 10.48550/arxiv.2203.01872

Multi-agent Contracts

Auteurs: Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim
Publié dans: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Éditeur: ACM
DOI: 10.1145/3564246.3585193

Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries

Auteurs: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Publié dans: Artificial Intelligence, Numéro 296, 2021, Page(s) 103488, ISSN 0004-3702
Éditeur: Elsevier BV
DOI: 10.1016/j.artint.2021.103488

Fog-Computing-Based Heartbeat Detection and Arrhythmia Classification Using Machine Learning

Auteurs: Alessandro Scirè, Fabrizio Tropeano, Aris Anagnostopoulos, Ioannis Chatzigiannakis
Publié dans: Algorithms, Numéro 12(2), 32, 2019, ISSN 1999-4893
Éditeur: MDPI Open Access Publishing
DOI: 10.3390/a12020032

Step-by-step community detection in volume-regular graphs

Auteurs: Luca Becchetti, Emilio Cruciani, Francesco Pasquale, Sara Rizzo
Publié dans: Theoretical Computer Science, Numéro 847, 2020, Page(s) 49-67, ISSN 0304-3975
Éditeur: Elsevier BV
DOI: 10.1016/j.tcs.2020.09.036

Approximately Efficient Two-Sided Combinatorial Auctions

Auteurs: Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta
Publié dans: ACM Transactions on Economics and Computation, Numéro 8/1, 2020, Page(s) 1-29, ISSN 2167-8375
Éditeur: Association for Computing Machinery (ACM)
DOI: 10.1145/3381523

Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond

Auteurs: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Publié dans: SIAM Journal on Discrete Mathematics, Numéro 38, 2024, Page(s) 1007-1029, ISSN 0895-4801
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/23m1545677

Biological Random Walks: multi-omics integration for disease gene prioritization

Auteurs: Michele Gentili, Leonardo Martini, Marialuisa Sponziello, Luca Becchetti
Publié dans: Bioinformatics, Numéro 38.17, 2022, Page(s) 4145-4152, ISSN 1367-4811
Éditeur: Oxford University Press
DOI: 10.1093/bioinformatics/btac446

Designing Cost-Sharing Methods for Bayesian Games

Auteurs: George Christodoulou, Stefano Leonardi, Alkmini Sgouritsa
Publié dans: Theory of Computing Systems, Numéro 63/1, 2019, Page(s) 4-25, ISSN 1432-4350
Éditeur: Springer Verlag
DOI: 10.1007/s00224-017-9832-3

Low-Distortion Clustering with Ordinal and Limited Cardinal Information

Auteurs: Jakob Burkhardt, Ioannis Caragiannis, Karl Fehrs, Matteo Russo, Chris Schwiegelshohn, Sudarshan Shyam
Publié dans: Proceedings of the AAAI Conference on Artificial Intelligence, Numéro 38, 2024, Page(s) 9555-9563, ISSN 2374-3468
Éditeur: AAAI
DOI: 10.1609/aaai.v38i9.28811

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint

Auteurs: Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Publié dans: Journal of Artificial Intelligence Research, Numéro 74, 2022, Page(s) 661-690, ISSN 1076-9757
Éditeur: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.13472

Algorithms for fair k-clustering with multiple protected attributes

Auteurs: Matteo Böhm, Adriano Fazzone, Stefano Leonardi, Cristina Menghini, Chris Schwiegelshohn
Publié dans: Operations Research Letters, Numéro 5, 2021, Page(s) 787-789, ISSN 0167-6377
Éditeur: Elsevier BV
DOI: 10.1016/j.orl.2021.08.011

NIAPU: network-informed adaptive positive-unlabeled learning for disease gene identification

Auteurs: Paola Stolfi, Andrea Mastropietro, Giuseppe Pasculli, Paolo Tieri, Davide Vergni
Publié dans: Bioinformatics, Numéro Volume 39, Numéro 2, 2023, ISSN 1367-4811
Éditeur: Oxford University Press
DOI: 10.1093/bioinformatics/btac848

Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination

Auteurs: Georgios Amanatidis, Evangelos Markakis, Apostolos Ntokos
Publié dans: Theoretical Computer Science, Numéro 841, 2020, Page(s) 94-109, ISSN 0304-3975
Éditeur: Elsevier BV
DOI: 10.1016/j.tcs.2020.07.006

Fully Dynamic Submodular Maximization over Matroids

Auteurs: Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
Publié dans: ACM Transactions on Algorithms, 2024, ISSN 1549-6325
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3698397

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness

Auteurs: Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Publié dans: Mathematics of Operations Research, 2023, ISSN 0364-765X
Éditeur: Institute for Operations Research and the Management Sciences
DOI: 10.1287/moor.2022.0058

Optimally Deceiving a Learning Leader in Stackelberg Games

Auteurs: Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo-Cossío, Ninad Rajgopal, Alexandros A. Voudouris
Publié dans: Journal of Artificial Intelligence Research, Numéro 72, 2021, Page(s) 507-531, ISSN 1076-9757
Éditeur: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.12542

Identification of Social-Media Platform of Videos through the Use of Shared Features

Auteurs: Luca Maiano, Irene Amerini, Lorenzo Ricciardi Celsi, Aris Anagnostopoulos
Publié dans: Journal of Imaging, Numéro 7, 2021, Page(s) 140, ISSN 2313-433X
Éditeur: MDPI AG
DOI: 10.3390/jimaging7080140

Online Revenue Maximization for Server Pricing

Auteurs: Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta
Publié dans: Autonomous Agents and Multi-Agent Systems, Numéro 1, 2022, ISSN 1387-2532
Éditeur: Kluwer Academic Publishers
DOI: 10.1007/s10458-022-09544-y

Budget Feasible Mechanisms on Matroids

Auteurs: Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
Publié dans: Algorithmica, 2020, ISSN 0178-4617
Éditeur: Springer Verlag
DOI: 10.1007/s00453-020-00781-9

Biased opinion dynamics: when the devil is in the details

Auteurs: Aris Anagnostopoulos, Luca Becchetti, Emilio Cruciani, Francesco Pasquale, Sara Rizzo
Publié dans: Information Sciences, Numéro Volume 593, 2022, Page(s) 49-63, ISSN 1872-6291
Éditeur: Elsevier
DOI: 10.1016/j.ins.2022.01.072

Similarity Search for Dynamic Data Streams

Auteurs: Marc Bury, Chris Schwiegelshohn, Mara Sorella
Publié dans: IEEE Transactions on Knowledge and Data Engineering, Numéro 32/11, 2020, Page(s) 2241-2253, ISSN 1041-4347
Éditeur: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tkde.2019.2916858

A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching

Auteurs: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Publié dans: Proceedings of the AAAI Conference on Artificial Intelligence, Numéro 35, 2022, Page(s) 5078-5085, ISSN 2374-3468
Éditeur: PKP Publishing Services Network
DOI: 10.1609/aaai.v35i6.16642

Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities

Auteurs: Marc Bury, Michele Gentili, Chris Schwiegelshohn, Mara Sorella
Publié dans: Algorithmica, Numéro 83, 2021, Page(s) 1371-1392, ISSN 0178-4617
Éditeur: Springer Verlag
DOI: 10.1007/s00453-020-00787-3

Find Your Place: Simple Distributed Algorithms for Community Detection

Auteurs: Luca Becchetti, Andrea E. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Publié dans: SIAM Journal on Computing, Numéro 49/4, 2020, Page(s) 821-864, ISSN 0097-5397
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1243026

A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching

Auteurs: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Publié dans: Journal of Artificial Intelligence Research, Numéro Vol. 74, 2022, ISSN 1076-9757
Éditeur: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.12690

Assessment of Community Efforts to Advance Computational Prediction of Protein-Protein Interactions

Auteurs: Xu-Wen Wang, Lorenzo Madeddu, Kerstin Spirohn, Leonardo Martini, Adriano Fazzone, Luca Becchetti, Thomas P. Wytock, István A. Kovács, Olivér M. Balogh, Bettina Benczik, Mátyás Pétervári, Bence Ágg, Péter Ferdinandy, Loan Vulliard, Jörg Menche, Stefania Colonnese, Manuela Petti, Gaetano Scarano, Francesca Cuomo, Tong Hao, Florent Laval, Luc Willems, Jean-Claude Twizere, Michael A. Calderw
Publié dans: bioRxiv, Numéro 2021.09.22.461292, 2021
Éditeur: Cold Spring Harbor Laboratory
DOI: 10.1101/2021.09.22.461292

Prophet Inequalities for Matching with a Single Sample

Auteurs: Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Publié dans: CoRR, Numéro abs/2104.02050, 2021
Éditeur: ArXiv
DOI: 10.48550/arxiv.2104.02050

Network and Sequence-Based Prediction of Protein-Protein Interactions

Auteurs: Leonardo Martini, Adriano Fazzone, Luca Becchetti
Publié dans: CoRR, Numéro abs/2107.03694, 2021
Éditeur: ArXiv
DOI: 10.48550/arxiv.2107.03694

Network Based Approach to Gene Prioritization at Genome-Wide Association Study Loci

Auteurs: Leonardo Martini, Adriano Fazzone, Michele Gentili, Luca Becchetti, Brian Hobbs
Publié dans: 2022
Éditeur: ArXiv
DOI: 10.48550/arxiv.2210.16292

Intersectional Affirmative Action Policies for Top-k Candidates Selection

Auteurs: Giorgio Barnabo, Carlos Castillo, Michael Mathioudakis, Sergio Celis
Publié dans: CoRR, 2020
Éditeur: CoRR

Simple and Optimal Sublinear Algorithms for Mean Estimation

Auteurs: Beatrice Bertolotti, Matteo Russo, Chris Schwiegelshohn
Publié dans: 2024
Éditeur: arXiv
DOI: 10.48550/arxiv.2406.05254

Fair Division with Interdependent Values

Auteurs: Georgios Birmpas, Tomer Ezra, Stefano Leonardi, Matteo Russo
Publié dans: 2023
Éditeur: arXiv
DOI: 10.48550/arxiv.2305.14096

Adaptive Positive-Unlabelled Learning via Markov Diffusion

Auteurs: Paola Stolfi, Andrea Mastropietro, Giuseppe Pasculli, Paolo Tieri, Davide Vergni
Publié dans: CoRR, Numéro abs/2108.06158, 2021
Éditeur: ArXiv
DOI: 10.48550/arxiv.2108.06158

Contracts with Inspections

Auteurs: Tomer Ezra, Stefano Leonardi, Matteo Russo
Publié dans: 2024
Éditeur: arXiv
DOI: 10.48550/arxiv.2402.16553

Fair Clustering with Multiple Colors

Auteurs: Matteo Bohm, Adriano Fazzone, Stefano Leonardi, Chris Schwiegelshohn
Publié dans: CoRR, 2020
Éditeur: CoRR

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment

Auteurs: Tomer Ezra, Stefano Leonardi, Michał Pawłowski, Matteo Russo, Seeun William Umboh
Publié dans: 2024
Éditeur: arXiv
DOI: 10.48550/arxiv.2407.15809

Online Learning with Sublinear Best-Action Queries

Auteurs: Matteo Russo, Andrea Celli, Riccardo Colini Baldeschi, Federico Fusco, Daniel Haimovich, Dima Karamshuk, Stefano Leonardi, Niek Tax
Publié dans: To appear in. the Proceedings of the 2024 Conference on Neural Information Processing Systems Event, 2024
Éditeur: arXiv
DOI: 10.48550/arxiv.2407.16355

Learning Fair Equilibria in Sponsored Search Auctions

Auteurs: Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi
Publié dans: CoRR, Numéro abs/2107.08271, 2021
Éditeur: arXiv
DOI: 10.48550/arxiv.2107.08271

“Who is Next in Line?” On the Significance of Knowing the Arrival Order in Bayesian Online Settings

Auteurs: Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
Publié dans: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023, Page(s) 3759-3776
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch145

Decentralized Update Selection with Semi-strategic Experts

Auteurs: Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Francisco Marmolejo-Cossío
Publié dans: Lecture Notes in Computer Science, Algorithmic Game Theory, 2023, Page(s) 403-420
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-031-15714-1_23

Fair Coresets and Streaming Algorithms for Fair k-means

Auteurs: Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler
Publié dans: Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers, Numéro 11926, 2020, Page(s) 232-251, ISBN 978-3-030-39478-3
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-39479-0_16

Fairness and Efficiency in DAG-Based Cryptocurrencies

Auteurs: Georgios Birmpas, Elias Koutsoupias, Philip Lazos, Francisco J. Marmolejo-Cossío
Publié dans: Financial Cryptography and Data Security - 24th International Conference, FC 2020 , Kota Kinabalu, Malaysia, February 10–14, 2020 Revised Selected Papers, Numéro 12059, 2020, Page(s) 79-96, ISBN 978-3-030-51279-8
Éditeur: Springer International Publishing
DOI: 10.1007/978-3-030-51280-4_6

The Minority Dynamics and the Power of Synchronicity

Auteurs: Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, Isabella Ziccardi
Publié dans: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Page(s) 4155-4176
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.144

Prophet Inequalities via the Expected Competitive Ratio

Auteurs: Tomer Ezra, Stefano Leonardi, Rebecca Reiffenhäuser, Matteo Russo, Alexandros Tsigonias-Dimitriadis
Publié dans: Lecture Notes in Computer Science, Web and Internet Economics, 2023, Page(s) 272-289
Éditeur: Springer Nature Switzerland
DOI: 10.1007/978-3-031-48974-7_16

Recherche de données OpenAIRE...

Publications

Partager cette page Partager cette page sur les réseaux sociaux

Télécharger Télécharger le contenu de la page