Skip to main content

Algorithmic and Mechanism Design Research in Online MArkets

Publications

Flow Time Scheduling with Uncertain Processing Time

Author(s): Yossi Azar, Stefano Leonardi, Noam Touitou
Published 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

Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising

Author(s): Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers
Published in: Accepted at the The Web Conference 2021 (WWW'21), Ljubljana (virtual), Slovenia, 2021

Pandora's Box Problem with Order Constraints

Author(s): Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi
Published in: Proceedings of the 21st ACM Conference on Economics and Computation, 2020, Page(s) 439-458
DOI: 10.1145/3391403.3399501

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

Author(s): Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhauser
Published in: Advances in Neural Information Processing Systems 33 Annual Conference on Neural Information Processing Systems 2020 (NeurIPS 2020), 2020

Online Revenue Maximization for Server Pricing

Author(s): Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta
Published in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Page(s) 4106-4112
DOI: 10.24963/ijcai.2020/568

Biased Opinion Dynamics: When the Devil is in the Details

Author(s): Aris Anagnostopoulos, Luca Becchetti, Emilio Cruciani, Francesco Pasquale, Sara Rizzo
Published in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Page(s) 53-59
DOI: 10.24963/ijcai.2020/8

Collaborative Procrastination

Author(s): Aris Anagnostopoulos, Aristides Gionis, Nikos Parotsidis
Published in: 10th International Conference on Fun with Algorithms (FUN 2021), Issue 157, 2020, Page(s) 2:1--2:20
DOI: 10.4230/lipics.fun.2021.2

RePBubLik: Reducing the Polarized Bubble Radius with Link Insertions

Author(s): Shahrzad Haddadan, Cristina Menghini, Matteo Riondato, Eli Upfal
Published in: Accepted at the 14th International Conference on Web Search and Data Mining (WSDM'21), Jerusalem (virtual), Israel, 2021

Optimally Deceiving a Learning Leader in Stackelberg Games

Author(s): Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo-Cossío, Ninad Rajgopal, Alexandros A. Voudouris
Published in: Advances in Neural Information Processing Systems 33 Annual Conference on Neural Information Processing Systems 2020 (NeurIPS 2020), 2020

Algorithms for Hiring and Outsourcing in the Online Labor Market

Author(s): Aris Anagnostopoulos, Carlos Castillo, Adriano Fazzone, Stefano Leonardi, Evimaria Terzi
Published in: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining - KDD '18, 2018, Page(s) 1109-1118
DOI: 10.1145/3219819.3220056

Compiling Questions into Balanced Quizzes about Documents

Author(s): Cristina Menghini, Jessica Dehler Zufferey, Robert West
Published in: Proceedings of the 27th ACM International Conference on Information and Knowledge Management - CIKM '18, 2018, Page(s) 1519-1522
DOI: 10.1145/3269206.3269298

On Coresets for Logistic Regression

Author(s): Alexander Munteanu, Chris Schwiegelshohn, Christian Sohler, David Woodruff
Published in: Proceedings of the 32nd International Conference on Neural Information Processing Systems (NeurIPS 2018) 2018, Montréal, CANADA, 2018, Page(s) 6561--6570

An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem

Author(s): Rebecca Reiffenhauser
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Page(s) 1982-1993
DOI: 10.1137/1.9781611975482.120

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

Author(s): Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn,, Shay Solomon
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Page(s) 1886-1898
DOI: 10.1137/1.9781611975482.114

Algorithms for Fair Team Formation in Online Labour Marketplaces✱

Author(s): Giorgio Barnabò, Adriano Fazzone, Stefano Leonardi, Chris Schwiegelshohn
Published in: Companion Proceedings of The 2019 World Wide Web Conference on - WWW '19, 2019, Page(s) 484-490
DOI: 10.1145/3308560.3317587

Blockchain Mining Games with Pay Forward

Author(s): Elias Koutsoupias, Philip Lazos, Foluso Ogunlana, Paolo Serafino
Published in: The World Wide Web Conference on - WWW '19, 2019, Page(s) 917-927
DOI: 10.1145/3308558.3313740

Reallocating Multiple Facilities on the Line

Author(s): Dimitris Fotakis, Loukas Kavouras, Panagiotis Kostopanagiotis, Philip Lazos, Stratis Skoulakis, Nikos Zarifis
Published in: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019, Page(s) 273-279
DOI: 10.24963/ijcai.2019/39

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

Author(s): Luca Becchetti, Marc Bury, Vincent Cohen-Addad, Fabrizio Grandoni, Chris Schwiegelshohn
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Page(s) 1039-1050
DOI: 10.1145/3313276.3316318

Stochastic Graph Exploration

Author(s): Aris Anagnostopoulos, Ilan R. Cohen, Stefano Leonardi, Jakub Lacki
Published in: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 2019, Patras, Greece, 2019
DOI: 10.4230/lipics.icalp.2019.136

Envy, Regret, and Social Welfare Loss

Author(s): Riccardo Colini-Baldeschi, Stefano Leonardi, Okke Schrijvers, Eric Sodomka
Published in: Proceedings of The Web Conference 2020, 2020, Page(s) 2913-2919
DOI: 10.1145/3366423.3380057

Fully Dynamic Consistent Facility Location

Author(s): Vincent Cohen-Addad, Niklas Hjuler, Nikos Parotsidis, David Saulpic, Chris Schwiegelshohn
Published in: Advances in Neural Information Processing Systems 32 (NIPS 2019), 2019,Vancouver, Canada., 2019

Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries

Author(s): Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Voudouris
Published in: 34 AAAI Conference on Artificial Intelligence (AAAI-20) 2020, New York, New York, USA., 2020

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

Author(s): Georgios Amanatidis, Evangelos Markakis, Apostolos Ntokos
Published in: Proceedings of the AAAI Conference on Artificial Intelligence, Issue 34/02, 2020, Page(s) 1790-1797, ISSN 2374-3468
DOI: 10.1609/aaai.v34i02.5545

The Pareto Frontier of Inefficiency in Mechanism Design

Author(s): Aris Filos-Ratsikas, Yiannis Giannakopoulos, Philip Lazos
Published in: Web and Internet Economics - 15th International Conference, WINE 2019, New York, NY, USA, December 10–12, 2019, Proceedings, Issue 11920, 2019, Page(s) 186-199
DOI: 10.1007/978-3-030-35389-6_14

Firms Default Prediction with Machine Learning

Author(s): Tesi Aliaj, Aris Anagnostopoulos, Stefano Piersanti
Published in: Mining Data for Financial Applications - 4th ECML PKDD Workshop, MIDAS 2019, Würzburg, Germany, September 16, 2019, Revised Selected Papers, Issue 11985, 2020, Page(s) 47-59
DOI: 10.1007/978-3-030-37720-5_4

Finding a Bounded-Degree Expander Inside a Dense One

Author(s): Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Page(s) 1320-1336
DOI: 10.1137/1.9781611975994.80

Biological Random Walks: Integrating heterogeneous data in disease gene prioritization

Author(s): Michele Gentili, Leonardo Martini, Manuela Petti, Lorenzo Farina, Luca Becchetti
Published in: 2019 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), 2019, Page(s) 1-8
DOI: 10.1109/cibcb.2019.8791472

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

Author(s): Luca Becchetti, Emilio Cruciani, Francesco Pasquale, Sara Rizzo
Published in: 30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019, Shanghai, China, 2019
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

Author(s): Michael Mathioudakis, Carlos Castillo, Giorgio Barnabo, Sergio Celis
Published in: Proceedings of the 35th Annual ACM Symposium on Applied Computing, 2020, Page(s) 440-449
DOI: 10.1145/3341105.3373878

Maximum Nash Welfare and Other Stories About EFX

Author(s): Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris
Published in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Page(s) 24-30
DOI: 10.24963/ijcai.2020/4

Efficient Two-Sided Markets with Limited Information

Author(s): Paul Dutting, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenhauser
Published 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

On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems

Author(s): Alberto Marchetti-Spaccamela, Nicole Megow, Jens Schloter, Martin Skutella, Leen Stougie
Published in: 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020, Page(s) 1061-1070
DOI: 10.1109/ipdps47924.2020.00112

Spectral Relaxations and Fair Densest Subgraphs

Author(s): Aris Anagnostopoulos, Luca Becchetti, Adriano Fazzone, Cristina Menghini, Chris Schwiegelshohn
Published in: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, 2020, Page(s) 35-44
DOI: 10.1145/3340531.3412036

Approximately Efficient Two-Sided Combinatorial Auctions

Author(s): Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta
Published in: ACM Transactions on Economics and Computation, Issue 8/1, 2020, Page(s) 1-29, ISSN 2167-8375
DOI: 10.1145/3381523

Designing Cost-Sharing Methods for Bayesian Games

Author(s): George Christodoulou, Stefano Leonardi, Alkmini Sgouritsa
Published in: Theory of Computing Systems, Issue 63/1, 2019, Page(s) 4-25, ISSN 1432-4350
DOI: 10.1007/s00224-017-9832-3

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

Author(s): Georgios Amanatidis, Evangelos Markakis, Apostolos Ntokos
Published in: Theoretical Computer Science, Issue 841, 2020, Page(s) 94-109, ISSN 0304-3975
DOI: 10.1016/j.tcs.2020.07.006

Budget Feasible Mechanisms on Matroids

Author(s): Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
Published in: Algorithmica, 2020, ISSN 0178-4617
DOI: 10.1007/s00453-020-00781-9

Similarity Search for Dynamic Data Streams

Author(s): Marc Bury, Chris Schwiegelshohn, Mara Sorella
Published in: IEEE Transactions on Knowledge and Data Engineering, Issue 32/11, 2020, Page(s) 2241-2253, ISSN 1041-4347
DOI: 10.1109/tkde.2019.2916858

Find Your Place: Simple Distributed Algorithms for Community Detection

Author(s): Luca Becchetti, Andrea E. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Published in: SIAM Journal on Computing, Issue 49/4, 2020, Page(s) 821-864, ISSN 0097-5397
DOI: 10.1137/19m1243026

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

Author(s): Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, Rebecca Reiffenhauser
Published in: Submitted, 2021

RPPLNS: Pay-per-last-N-shares with a Randomised Twist

Author(s): Philip Lazos, Francisco J. Marmolejo-Cossío, Xinyu Zhou, Jonathan Katz
Published in: CoRR, 2021

Intersectional Affirmative Action Policies for Top-k Candidates Selection

Author(s): Giorgio Barnabo, Carlos Castillo, Michael Mathioudakis, Sergio Celis
Published in: CoRR, 2020

Expansion and Flooding in Dynamic Random Networks with Node Churn

Author(s): Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Published in: CoRR, 2020

Maximizing Online Utilization with Commitment

Author(s): Chris Schwiegelshohn, Uwe Schwiegelshohn
Published in: CoRR, 2019

Principal Fairness: Removing Bias via Projections

Author(s): Aris Anagnostopoulos, Luca Becchetti, Matteo Böhm, Adriano Fazzone, Stefano Leonardi, Cristina Menghini and Chris Schwiegelshohn
Published in: CoRR, 2019

Online Revenue Maximization for Server Pricing

Author(s): Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta
Published in: CoRR, 2019

Pandora's Box Problem with Order Constraints

Author(s): Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi
Published in: CoRR, 2020

Fair Clustering with Multiple Colors

Author(s): Matteo Bohm, Adriano Fazzone, Stefano Leonardi, Chris Schwiegelshohn
Published in: CoRR, 2020

A Regret Analysis of Bilateral Trade

Author(s): Nicolò Cesa-Bianchi, Tom Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi
Published in: Submitted, 2021

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

Author(s): Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris
Published in: CoRR, 2020

Fair Coresets and Streaming Algorithms for Fair k-means

Author(s): Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler
Published in: Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers, Issue 11926, 2020, Page(s) 232-251
DOI: 10.1007/978-3-030-39479-0_16

Fairness and Efficiency in DAG-Based Cryptocurrencies

Author(s): Georgios Birmpas, Elias Koutsoupias, Philip Lazos, Francisco J. Marmolejo-Cossío
Published in: Financial Cryptography and Data Security - 24th International Conference, FC 2020 , Kota Kinabalu, Malaysia, February 10–14, 2020 Revised Selected Papers, Issue 12059, 2020, Page(s) 79-96
DOI: 10.1007/978-3-030-51280-4_6