Algorithmic and Mechanism Design Research in Online MArkets

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

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

Autori: Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Pubblicato in: Proceedings of the 14th Conference on Web and Internet Economics 2021 (WINE 2021), 2021, Pagina/e 149-166, ISBN 9783030946760
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-94676-0_9

Total Completion Time Scheduling Under Scenarios

Autori: Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie
Pubblicato in: WAOA 2023: 104-118 International Workshop on Approximation and Online Algorithms, Numero vol 14297, 2023
Editore: Lecture Notes in Computer Science
DOI: 10.48550/arxiv.2402.19259

Flow time scheduling with uncertain processing time

Autori: Yossi Azar, Stefano Leonardi, Noam Touitou
Pubblicato in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2023
Editore: ACM
DOI: 10.1145/3406325.3451023

Single-Sample Prophet Inequalities via Greedy-Ordered Selection

Autori: Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser
Pubblicato in: 33rd SODA 2022, 2022, Pagina/e 1298-1325, ISBN 978-1-61197-707-3
Editore: ArXiv
DOI: 10.48550/arxiv.2111.03174

Distortion-Oblivious Algorithms for Minimizing Flow Time

Autori: Yossi Azar, Stefano Leonardi, Noam Touitou
Pubblicato in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), 2022, Pagina/e 252-274
Editore: Society for Industrial and Applied Mathematics (SIAM)
DOI: 10.1137/1.9781611977073.13

Bandits with Replenishable Knapsacks: the Best of both Worlds

Autori: Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco
Pubblicato in: ICLR 2024, 2024
Editore: .
DOI: 10.48550/arxiv.2306.08470

Stochastic bandits for multi-platform budget optimization in online advertising

Autori: Vashist Avadhanula, Riccardo Colini Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers
Pubblicato in: Proceedings of the Web Conference 2021, 2023
Editore: ACM
DOI: 10.1145/3442381.3450074

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

Autori: Irene Amerini, Aris Anagnostopoulos, Luca Maiano, Lorenzo Ricciardi Celsi
Pubblicato in: ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2021
Editore: IEEE
DOI: 10.1109/icassp39728.2021.9413366

Expansion and Flooding in Dynamic Random Networks with Node Churn

Autori: Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Pubblicato in: Proceedings of the 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS 2021), 2021, Pagina/e 976-986, ISBN 9781665445139
Editore: Institute of Electrical and Electronics Engineers (IEEE)
DOI: 10.1109/icdcs51616.2021.00097

Single Sample Prophet Inequalities via Greedy-Ordered Selection

Autori: Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser
Pubblicato in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), 2022, Pagina/e 1298-1325
Editore: Society for Industrial and Applied Mathematics (SIAM)
DOI: 10.1137/1.9781611977073.54

Pandora's Box Problem with Order Constraints

Autori: Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi
Pubblicato in: Proceedings of the 21st ACM Conference on Economics and Computation, 2020, Pagina/e 439-458, ISBN 9781450379755
Editore: Association for Computing Machinery (ACM)
DOI: 10.1145/3391403.3399501

Deletion Robust Submodular Maximization over Matroids

Autori: Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
Pubblicato in: Proceedings of the 39th International Conference on Machine Learning, Numero PMLR 162, 2022, Pagina/e 5671-5693
Editore: Proceedings press
DOI: 10.48550/arxiv.2201.13128

A Regret Analysis of Bilateral Trade

Autori: Nicolò Cesa-Bianchi, Tom Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi
Pubblicato in: Proceedings of the 22nd ACM Conference on Economics and Computation (EC21), 2021, Pagina/e 289–309, ISBN 9781450385541
Editore: 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

Autori: Federico Siciliano, Maria Sofia Bucarelli, Gabriele Tolomei, Fabrizio Silvestri
Pubblicato in: 2022 International Joint Conference on Neural Networks (IJCNN), 2022
Editore: IEEE
DOI: 10.1109/ijcnn55064.2022.9892367

Online Revenue Maximization for Server Pricing

Autori: Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta
Pubblicato in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Pagina/e 4106-4112, ISBN 978-0-9992411-6-5
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/568

Biased Opinion Dynamics: When the Devil is in the Details

Autori: Aris Anagnostopoulos, Luca Becchetti, Emilio Cruciani, Francesco Pasquale, Sara Rizzo
Pubblicato in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Pagina/e 53-59, ISBN 978-0-9992411-6-5
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/8

Collaborative Procrastination

Autori: Aris Anagnostopoulos, Aristides Gionis, Nikos Parotsidis
Pubblicato in: 10th International Conference on Fun with Algorithms (FUN 2021), Numero 157, 2020, Pagina/e 2:1--2:20, ISBN 978-3-95977-145-0
Editore: Schloss Dagstuhl--Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.fun.2021.2

An α-regret Analysis of Adversarial Bilateral Trade

Autori: Yossi Azar, Amos Fiat, Federico Fusco
Pubblicato in: NeurIPS Proceedings 2022, 2022
Editore: NeurIPS
DOI: 10.48550/arxiv.2210.06846

Pandora's Problem with Combinatorial Cost

Autori: Ben Berger, Tomer Ezra, Michal Feldman, Federico Fusco
Pubblicato in: EC '23: Proceedings of the 24th ACM Conference on Economics and Computation, 2023, Pagina/e 273–292
Editore: ACMDL
DOI: 10.1145/3580507.3597699

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

Autori: Nicolo Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi
Pubblicato in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Editore: ACM
DOI: 10.1145/3618260.3649658

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

Autori: Philip Lazos, Francisco J. Marmolejo-Cossío, Xinyu Zhou, Jonathan Katz
Pubblicato in: Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'2021, Virtual Event, United Kingdom), 2021, Pagina/e 1569-1571, ISBN 9781450383073
Editore: International Foundation for Autonomous Agents and Multiagent Systems

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

Autori: Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
Pubblicato in: EC '22: Proceedings of the 23rd ACM Conference on Economics and Computation, 2022, Pagina/e 1148–1177
Editore: dl.acm
DOI: 10.1145/3490486.3538290

Truthful Matching with Online Items and Offline Agents

Autori: Michal Feldman, Federico Fusco, Stefano Leonardi, Simon Mauras, Rebecca Reiffenhäuser
Pubblicato in: 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), 2023
Editore: Drops
DOI: 10.4230/lipics.icalp.2023.58

Skyline in Crowdsourcing with Imprecise Comparisons

Autori: Aris Anagnostopoulos, Adriano Fazzone, Giacomo Vettraino
Pubblicato in: Proceedings of the 30th ACM International Conference on Information & Knowledge Management (CIKM2021), 2021, Pagina/e 37–46, ISBN 9781450384469
Editore: Association for Computing Machinery (ACM)
DOI: 10.1145/3459637.3482479

RePBubLik: Reducing Polarized Bubble Radius with Link Insertions

Autori: Shahrzad Haddadan, Cristina Menghini, Matteo Riondato, Eli Upfal
Pubblicato in: Proceedings of the 14th ACM International Conference on Web Search and Data Mining, 2023
Editore: ACM
DOI: 10.1145/3437963.3441825

Repeated Bilateral Trade Against a Smoothed Adversary

Autori: Nicolò Cesa-Bianchi, Tommaso R. Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi
Pubblicato in: Proceedings of Thirty Sixth Conference on Learning Theory, Numero PMLR 195, 2023, Pagina/e 1095-1130
Editore: MLResearch press
DOI: 10.48550/arxiv.2302.10805

No-Regret Learning in Bilateral Trade via Global Budget Balance

Autori: Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco
Pubblicato in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Editore: ACM
DOI: 10.1145/3618260.3649653

Repeated Bilateral Trade Against a Smoothed Adversary

Autori: Nicolò Cesa-Bianchi, Tommaso R. Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi
Pubblicato in: Proceedings of Thirty Sixth Conference on Learning Theory, PMLR, Numero 195, 2023, Pagina/e 1095-1130
Editore: MLResearchPress

Fair Division of Indivisible Goods: A Survey

Autori: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Pubblicato in: Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI 2022), 2022
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.48550/arxiv.2202.07551

Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria

Autori: Georgios Birmpas, Lyudmila Kovalchuk, Philip Lazos, Roman Oliynykov
Pubblicato in: AFT 22, 2022
Editore: ArXiv
DOI: 10.48550/arxiv.2202.04064

FbMultiLingMisinfo: Challenging Large-Scale Multilingual Benchmark for Misinformation Detection

Autori: Giorgio Barnabò, Federico Siciliano, Carlos Castillo, Stefano Leonardi, Preslav Nakov, Giovanni Da San Martino, Fabrizio Silvestri
Pubblicato in: International Joint Conference on Neural Networks (IJCNN), 2022
Editore: IEEE
DOI: 10.1109/ijcnn55064.2022.9892739

Learning on the Edge: Online Learning with Stochastic Feedback Graphs

Autori: Emmanuel Esposito, Federico Fusco, Dirk van der Hoeven, Nicolò Cesa-Bianchi
Pubblicato in: NeurIPS Proceedings 2022, 2022
Editore: NeurIPS
DOI: 10.48550/arxiv.2210.04229

Distortion-Oblivious Algorithms for Minimizing Flow Time

Autori: Yossi Azar, Stefano Leonardi, Noam Touitou
Pubblicato in: 33rd SODA 2022, 2022, Pagina/e 252-274, ISBN 978-1-61197-707-3
Editore: ArXiv
DOI: 10.48550/arxiv.2109.08424

Fairness in Streaming Submodular Maximization over a Matroid Constraint

Autori: Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos, Jakub Tarnawski
Pubblicato in: Proceedings of the 40th International Conference on Machine Learning, Numero 202, 2023, Pagina/e 9150-9171
Editore: MLResearchPress

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

Autori: Ziheng Chen, Fabrizio Silvestri, Jia Wang, He Zhu, Hongshik Ahn, Gabriele Tolomei
Pubblicato in: Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2023
Editore: ACM
DOI: 10.1145/3511808.3557429

Fair Equilibria in Sponsored Search Auctions: The Advertisers’ Perspective

Autori: Georgios Birmpas, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi
Pubblicato in: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022, Pagina/e 95-101
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2022/14

Algorithms for Hiring and Outsourcing in the Online Labor Market

Autori: Aris Anagnostopoulos, Carlos Castillo, Adriano Fazzone, Stefano Leonardi, Evimaria Terzi
Pubblicato in: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining - KDD '18, 2018, Pagina/e 1109-1118, ISBN 9781-450355520
Editore: Association for Computing Machinery
DOI: 10.1145/3219819.3220056

Compiling Questions into Balanced Quizzes about Documents

Autori: Cristina Menghini, Jessica Dehler Zufferey, Robert West
Pubblicato in: Proceedings of the 27th ACM International Conference on Information and Knowledge Management - CIKM '18, 2018, Pagina/e 1519-1522, ISBN 9781-450360142
Editore: Association for Computing Machinery
DOI: 10.1145/3269206.3269298

On Coresets for Logistic Regression

Autori: Alexander Munteanu, Chris Schwiegelshohn, Christian Sohler, David Woodruff
Pubblicato in: Proceedings of the 32nd International Conference on Neural Information Processing Systems (NeurIPS 2018) 2018, Montréal, CANADA, 2018, Pagina/e 6561--6570
Editore: Curran Associates Inc.

An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem

Autori: Rebecca Reiffenhauser
Pubblicato in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Pagina/e 1982-1993, ISBN 978-1-61197-548-2
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.120

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

Autori: Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn,, Shay Solomon
Pubblicato in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Pagina/e 1886-1898, ISBN 978-1-61197-548-2
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.114

Algorithms for Fair Team Formation in Online Labour Marketplaces✱

Autori: Giorgio Barnabò, Adriano Fazzone, Stefano Leonardi, Chris Schwiegelshohn
Pubblicato in: Companion Proceedings of The 2019 World Wide Web Conference on - WWW '19, 2019, Pagina/e 484-490, ISBN 9781-450366755
Editore: Association for Computing Machinery
DOI: 10.1145/3308560.3317587

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

Autori: Luca Becchetti, Marc Bury, Vincent Cohen-Addad, Fabrizio Grandoni, Chris Schwiegelshohn
Pubblicato in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Pagina/e 1039-1050, ISBN 9781-450367059
Editore: Association for Computing Machinery
DOI: 10.1145/3313276.3316318

Stochastic Graph Exploration

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

Envy, Regret, and Social Welfare Loss

Autori: Riccardo Colini-Baldeschi, Stefano Leonardi, Okke Schrijvers, Eric Sodomka
Pubblicato in: Proceedings of The Web Conference 2020, 2020, Pagina/e 2913-2919, ISBN 9781450370233
Editore: ACM
DOI: 10.1145/3366423.3380057

Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries

Autori: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Voudouris
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 34/02, 2020, Pagina/e 1782-1789, ISSN 2374-3468
Editore: 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

Autori: Georgios Amanatidis, Evangelos Markakis, Apostolos Ntokos
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 34/02, 2020, Pagina/e 1790-1797, ISSN 2374-3468
Editore: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/aaai.v34i02.5545

Firms Default Prediction with Machine Learning

Autori: Tesi Aliaj, Aris Anagnostopoulos, Stefano Piersanti
Pubblicato in: Mining Data for Financial Applications - 4th ECML PKDD Workshop, MIDAS 2019, Würzburg, Germany, September 16, 2019, Revised Selected Papers, Numero 11985, 2020, Pagina/e 47-59, ISBN 978-3-030-37719-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-37720-5_4

Finding a Bounded-Degree Expander Inside a Dense One

Autori: Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Pubblicato in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Pagina/e 1320-1336, ISBN 978-1-61197-599-4
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.80

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

Autori: Luca Becchetti, Emilio Cruciani, Francesco Pasquale, Sara Rizzo
Pubblicato in: 30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019, Shanghai, China, 2019, ISBN 978-3-95977-130-6
Editore: 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

Autori: Michael Mathioudakis, Carlos Castillo, Giorgio Barnabo, Sergio Celis
Pubblicato in: Proceedings of the 35th Annual ACM Symposium on Applied Computing, 2020, Pagina/e 440-449, ISBN 9781450368667
Editore: ACM
DOI: 10.1145/3341105.3373878

Maximum Nash Welfare and Other Stories About EFX

Autori: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris
Pubblicato in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Pagina/e 24-30, ISBN 978-0-9992411-6-5
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/4

Efficient Two-Sided Markets with Limited Information

Autori: Paul Dutting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhauser
Pubblicato in: Accepted at the Accepted at the 53rd Annual ACM Symposium on Theory of Computing June 21–25, 2021, (STOC 2021), Rome (virtually), Italy, 2021
Editore: Association for Computing Machinery (ACM)

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

Autori: Cristina Menghini, Aris Anagnostopoulos, Eli Upfal
Pubblicato in: Proceedings of the 2021 IEEE International Conference on Big Data (IEEE BigData 2021), 2021, Pagina/e 1300-1307, ISBN 9781665445993
Editore: 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

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

On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems

Autori: Alberto Marchetti-Spaccamela, Nicole Megow, Jens Schloter, Martin Skutella, Leen Stougie
Pubblicato in: 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020, Pagina/e 1061-1070, ISBN 978-1-7281-6876-0
Editore: Institute of Electrical and Electronics Engineers (IEEE)
DOI: 10.1109/ipdps47924.2020.00112

On a Voter Model with Context-Dependent Opinion Adoption

Autori: Luca Becchetti, Vincenzo Bonifaci, Emilio Cruciani, Francesco Pasquale
Pubblicato in: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023, Pagina/e 38-45
Editore: 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

Autori: Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti Spaccamela, Rebecca Reiffenhäuser
Pubblicato in: Proceedings of the 38th International Conference on Machine Learning (ICML 2021), Numero 139, 2021, Pagina/e 231-242, ISSN 1938-7228
Editore: Proceedings of Machine Learning Research (PMLR)

Spectral Relaxations and Fair Densest Subgraphs

Autori: Aris Anagnostopoulos, Luca Becchetti, Adriano Fazzone, Cristina Menghini, Chris Schwiegelshohn
Pubblicato in: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, 2020, Pagina/e 35-44, ISBN 9781450368599
Editore: Association for Computing Machinery (ACM)
DOI: 10.1145/3340531.3412036

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

Autori: Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Pubblicato in: Proceedings of the 24th ACM Conference on Economics and Computation, 2023
Editore: ACM
DOI: 10.1145/3580507.3597796

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

Autori: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Pubblicato in: 36th Conference on Neural Information Processing Systems NeurlPS, 2022
Editore: ArXiv
DOI: 10.48550/arxiv.2203.01872

Multi-agent Contracts

Autori: Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim
Pubblicato in: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Editore: ACM
DOI: 10.1145/3564246.3585193

Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries

Autori: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Pubblicato in: Artificial Intelligence, Numero 296, 2021, Pagina/e 103488, ISSN 0004-3702
Editore: Elsevier BV
DOI: 10.1016/j.artint.2021.103488

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

Autori: Alessandro Scirè, Fabrizio Tropeano, Aris Anagnostopoulos, Ioannis Chatzigiannakis
Pubblicato in: Algorithms, Numero 12(2), 32, 2019, ISSN 1999-4893
Editore: MDPI Open Access Publishing
DOI: 10.3390/a12020032

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

Autori: Luca Becchetti, Emilio Cruciani, Francesco Pasquale, Sara Rizzo
Pubblicato in: Theoretical Computer Science, Numero 847, 2020, Pagina/e 49-67, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2020.09.036

Approximately Efficient Two-Sided Combinatorial Auctions

Autori: Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta
Pubblicato in: ACM Transactions on Economics and Computation, Numero 8/1, 2020, Pagina/e 1-29, ISSN 2167-8375
Editore: 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

Autori: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Pubblicato in: SIAM Journal on Discrete Mathematics, Numero 38, 2024, Pagina/e 1007-1029, ISSN 0895-4801
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/23m1545677

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

Autori: Michele Gentili, Leonardo Martini, Marialuisa Sponziello, Luca Becchetti
Pubblicato in: Bioinformatics, Numero 38.17, 2022, Pagina/e 4145-4152, ISSN 1367-4811
Editore: Oxford University Press
DOI: 10.1093/bioinformatics/btac446

Designing Cost-Sharing Methods for Bayesian Games

Autori: George Christodoulou, Stefano Leonardi, Alkmini Sgouritsa
Pubblicato in: Theory of Computing Systems, Numero 63/1, 2019, Pagina/e 4-25, ISSN 1432-4350
Editore: Springer Verlag
DOI: 10.1007/s00224-017-9832-3

Low-Distortion Clustering with Ordinal and Limited Cardinal Information

Autori: Jakob Burkhardt, Ioannis Caragiannis, Karl Fehrs, Matteo Russo, Chris Schwiegelshohn, Sudarshan Shyam
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 38, 2024, Pagina/e 9555-9563, ISSN 2374-3468
Editore: AAAI
DOI: 10.1609/aaai.v38i9.28811

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

Autori: Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Pubblicato in: Journal of Artificial Intelligence Research, Numero 74, 2022, Pagina/e 661-690, ISSN 1076-9757
Editore: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.13472

Algorithms for fair k-clustering with multiple protected attributes

Autori: Matteo Böhm, Adriano Fazzone, Stefano Leonardi, Cristina Menghini, Chris Schwiegelshohn
Pubblicato in: Operations Research Letters, Numero 5, 2021, Pagina/e 787-789, ISSN 0167-6377
Editore: Elsevier BV
DOI: 10.1016/j.orl.2021.08.011

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

Autori: Paola Stolfi, Andrea Mastropietro, Giuseppe Pasculli, Paolo Tieri, Davide Vergni
Pubblicato in: Bioinformatics, Numero Volume 39, Numero 2, 2023, ISSN 1367-4811
Editore: Oxford University Press
DOI: 10.1093/bioinformatics/btac848

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

Autori: Georgios Amanatidis, Evangelos Markakis, Apostolos Ntokos
Pubblicato in: Theoretical Computer Science, Numero 841, 2020, Pagina/e 94-109, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2020.07.006

Fully Dynamic Submodular Maximization over Matroids

Autori: Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
Pubblicato in: ACM Transactions on Algorithms, 2024, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3698397

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

Autori: Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Pubblicato in: Mathematics of Operations Research, 2023, ISSN 0364-765X
Editore: Institute for Operations Research and the Management Sciences
DOI: 10.1287/moor.2022.0058

Optimally Deceiving a Learning Leader in Stackelberg Games

Autori: Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo-Cossío, Ninad Rajgopal, Alexandros A. Voudouris
Pubblicato in: Journal of Artificial Intelligence Research, Numero 72, 2021, Pagina/e 507-531, ISSN 1076-9757
Editore: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.12542

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

Autori: Luca Maiano, Irene Amerini, Lorenzo Ricciardi Celsi, Aris Anagnostopoulos
Pubblicato in: Journal of Imaging, Numero 7, 2021, Pagina/e 140, ISSN 2313-433X
Editore: MDPI AG
DOI: 10.3390/jimaging7080140

Online Revenue Maximization for Server Pricing

Autori: Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta
Pubblicato in: Autonomous Agents and Multi-Agent Systems, Numero 1, 2022, ISSN 1387-2532
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10458-022-09544-y

Budget Feasible Mechanisms on Matroids

Autori: Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
Pubblicato in: Algorithmica, 2020, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-020-00781-9

Biased opinion dynamics: when the devil is in the details

Autori: Aris Anagnostopoulos, Luca Becchetti, Emilio Cruciani, Francesco Pasquale, Sara Rizzo
Pubblicato in: Information Sciences, Numero Volume 593, 2022, Pagina/e 49-63, ISSN 1872-6291
Editore: Elsevier
DOI: 10.1016/j.ins.2022.01.072

Similarity Search for Dynamic Data Streams

Autori: Marc Bury, Chris Schwiegelshohn, Mara Sorella
Pubblicato in: IEEE Transactions on Knowledge and Data Engineering, Numero 32/11, 2020, Pagina/e 2241-2253, ISSN 1041-4347
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tkde.2019.2916858

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

Autori: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 35, 2022, Pagina/e 5078-5085, ISSN 2374-3468
Editore: PKP Publishing Services Network
DOI: 10.1609/aaai.v35i6.16642

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

Autori: Marc Bury, Michele Gentili, Chris Schwiegelshohn, Mara Sorella
Pubblicato in: Algorithmica, Numero 83, 2021, Pagina/e 1371-1392, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-020-00787-3

Find Your Place: Simple Distributed Algorithms for Community Detection

Autori: Luca Becchetti, Andrea E. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Pubblicato in: SIAM Journal on Computing, Numero 49/4, 2020, Pagina/e 821-864, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1243026

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

Autori: Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Pubblicato in: Journal of Artificial Intelligence Research, Numero Vol. 74, 2022, ISSN 1076-9757
Editore: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.12690

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

Autori: 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
Pubblicato in: bioRxiv, Numero 2021.09.22.461292, 2021
Editore: Cold Spring Harbor Laboratory
DOI: 10.1101/2021.09.22.461292

Prophet Inequalities for Matching with a Single Sample

Autori: Paul Dütting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhäuser
Pubblicato in: CoRR, Numero abs/2104.02050, 2021
Editore: ArXiv
DOI: 10.48550/arxiv.2104.02050

Network and Sequence-Based Prediction of Protein-Protein Interactions

Autori: Leonardo Martini, Adriano Fazzone, Luca Becchetti
Pubblicato in: CoRR, Numero abs/2107.03694, 2021
Editore: ArXiv
DOI: 10.48550/arxiv.2107.03694

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

Autori: Leonardo Martini, Adriano Fazzone, Michele Gentili, Luca Becchetti, Brian Hobbs
Pubblicato in: 2022
Editore: ArXiv
DOI: 10.48550/arxiv.2210.16292

Intersectional Affirmative Action Policies for Top-k Candidates Selection

Autori: Giorgio Barnabo, Carlos Castillo, Michael Mathioudakis, Sergio Celis
Pubblicato in: CoRR, 2020
Editore: CoRR

Simple and Optimal Sublinear Algorithms for Mean Estimation

Autori: Beatrice Bertolotti, Matteo Russo, Chris Schwiegelshohn
Pubblicato in: 2024
Editore: arXiv
DOI: 10.48550/arxiv.2406.05254

Fair Division with Interdependent Values

Autori: Georgios Birmpas, Tomer Ezra, Stefano Leonardi, Matteo Russo
Pubblicato in: 2023
Editore: arXiv
DOI: 10.48550/arxiv.2305.14096

Adaptive Positive-Unlabelled Learning via Markov Diffusion

Autori: Paola Stolfi, Andrea Mastropietro, Giuseppe Pasculli, Paolo Tieri, Davide Vergni
Pubblicato in: CoRR, Numero abs/2108.06158, 2021
Editore: ArXiv
DOI: 10.48550/arxiv.2108.06158

Contracts with Inspections

Autori: Tomer Ezra, Stefano Leonardi, Matteo Russo
Pubblicato in: 2024
Editore: arXiv
DOI: 10.48550/arxiv.2402.16553

Fair Clustering with Multiple Colors

Autori: Matteo Bohm, Adriano Fazzone, Stefano Leonardi, Chris Schwiegelshohn
Pubblicato in: CoRR, 2020
Editore: CoRR

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment

Autori: Tomer Ezra, Stefano Leonardi, Michał Pawłowski, Matteo Russo, Seeun William Umboh
Pubblicato in: 2024
Editore: arXiv
DOI: 10.48550/arxiv.2407.15809

Online Learning with Sublinear Best-Action Queries

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

Learning Fair Equilibria in Sponsored Search Auctions

Autori: Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi
Pubblicato in: CoRR, Numero abs/2107.08271, 2021
Editore: arXiv
DOI: 10.48550/arxiv.2107.08271

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

Autori: Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
Pubblicato in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023, Pagina/e 3759-3776
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch145

Decentralized Update Selection with Semi-strategic Experts

Autori: Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Francisco Marmolejo-Cossío
Pubblicato in: Lecture Notes in Computer Science, Algorithmic Game Theory, 2023, Pagina/e 403-420
Editore: Springer International Publishing
DOI: 10.1007/978-3-031-15714-1_23

Fair Coresets and Streaming Algorithms for Fair k-means

Autori: Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler
Pubblicato in: Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers, Numero 11926, 2020, Pagina/e 232-251, ISBN 978-3-030-39478-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-39479-0_16

Fairness and Efficiency in DAG-Based Cryptocurrencies

Autori: Georgios Birmpas, Elias Koutsoupias, Philip Lazos, Francisco J. Marmolejo-Cossío
Pubblicato in: Financial Cryptography and Data Security - 24th International Conference, FC 2020 , Kota Kinabalu, Malaysia, February 10–14, 2020 Revised Selected Papers, Numero 12059, 2020, Pagina/e 79-96, ISBN 978-3-030-51279-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-51280-4_6

The Minority Dynamics and the Power of Synchronicity

Autori: Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, Isabella Ziccardi
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 4155-4176
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.144

Prophet Inequalities via the Expected Competitive Ratio

Autori: Tomer Ezra, Stefano Leonardi, Rebecca Reiffenhäuser, Matteo Russo, Alexandros Tsigonias-Dimitriadis
Pubblicato in: Lecture Notes in Computer Science, Web and Internet Economics, 2023, Pagina/e 272-289
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-48974-7_16

È in corso la ricerca di dati su OpenAIRE...

Pubblicazioni

Condividi questa pagina Condividi questa pagina sui social network

Scarica Scarica il contenuto della pagina