COMRADE project

Welcome to the webpage of COMRADE Project

The project is funded by the Hellenic Foundation for Research and Innovation, under the "1st Call for H.F.R.I. Research Projects to Support Faculty Members & Researchers and Procure High-Value Research Equipment". The duration of the project is from December 2019 till September 2023.

Research

The goal of this project is to study from an algorithmic and game-theoretic perspective, assignment problems that occur mainly in reverse (procurement) auctions. Whilst the most common form of a reverse auction is a public tender, in various complex applications reverse auctions have a combinatorial nature. In such cases, there exist a set of conflicting criteria that must be considered. The compomises that can be achieved regarding them is the main focus of our work. see extended abstract

People

Faculty Members

Evangelos Markakis Georgios D. Stamoulis

Collaborating Partners

Georgios Amanatidis (University of Essex)

Post-Doctoral Researchers & PhD Students

Michail Fasoulakis Thanasis Papaioannou

Georgios Papasotiropoulos Panagiotis Tsamopoulos

Publications/Technical Reports

During the project (2020-2023.)

E. Markakis, A. Tsikiridis. On Core-Selecting and Core-Competitive Mechanisms for Binary Single-Parameter Auctions. Submitted to Mathematics of Operations Research, 2023.
G. Amanatidis, S. Klumper, E. Markakis, G. Schaefer, A. Tsikiridis. Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents. In Proceedings of the 19th International Conference on Web and Internet Economics (WINE 2023), ARCoSS Lecture Notes in Computer Science, Shanghai, China, December 4-7, 2023.
E. Markakis, G. Papasotiropoulos, A. Tsikiridis. On Improved Interval Cover Mechanisms for Crowdsourcing Markets. In Proceedings of the 15th International Symposium on Algorithmic Game Theory (SAGT 2022), ARCoSS Lecture Notes in Computer Science, volume 13584, pp. 94-112, Colchester, UK, September 12- 15, 2022.
E. Markakis, A. Sgouritsa, A. Tsikiridis. Towards a Characterization of Worst Case Equilibria in the Discriminatory Price Auction. In Proceedings of the 17th International Conference on Web and Internet Economics (WINE 2021), ARCoSS Lecture Notes in Computer Science, volume 13112, pp. 186-204, held virtually, December 14-17, 2021.
E. Markakis, G. Papasotiropoulos, “Winner Determination and Strategic Control in Conditional Approval Voting”. In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021), pp. 342-348, held virtually, August 19-25, 2021.
G. Amanatidis, G. Birmpas, E. Markakis, “A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint”, Information Processing Letters (IPL), 16:3, 2020.

Before the beginning of the project (__-2019)

Amanatidis, G., Birmpas, G., & Markakis, E. (2017). On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives. In Proceedings of the 13th International Conference on Web and Internet Economics (pp. 1-15). Springer LNCS.
Amanatidis, G., Birmpas, G., & Markakis, E. (2016). Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design. In Proceedings of the 12th International Conference on Web and Internet Economics (pp. 414-428). Springer LNCS.
Riahi, M., Papaioannou, T. G., Trummer, I., & Aberer, K. (2013). Utility-Driven Data Acquisition in Participatory Sensing. In Proceedings of the 16th International Conference on Extending Database Technology (pp. 251-262).

Experimental Evaluation of Proposed Mechanisms

Details on the experimental evaluation carried out during the project can be found here.

Dissemination Activities

Invited participation to deliver a tutorial at the 16th International Symposium on Algorithmic Game Theory (SAGT '23), Royal Holloway University of London, Egham, UK, September 4-7, 2023.
Participation with oral and poster presentation at the 9th International Workshop on Computational Social Choice (COMSOC '23), Ben-Gurion University of the Negev, Beersheba, Israel, July 3-5, 2023.
Participation with oral presentation at the workshop on “Algorithms, Learning and Games” (ALGA '23), June 4-9, 2023.
Presentation at the Distributed AI seminar, King’s College, Department of Informatics, London, UK, May 16, 2023.
Invited participation for oral presentation at the “Dagstuhl seminar on Computational Social Dynamics”, Schloss Dagstuhl, Germany, November 6-11, 2022.
Participation and oral presentation at the 15th International Symposium on Algorithmic Game Theory (SAGT '22), University of Essex, Colchester, UK, September 12-15, 2022.
Invited participation for oral presentation at the “Workshop on Algorithms for Learning and Economics” (WALE '22), Naxos, Greece, June 13-17, 2022.
Organization of the workshop on “New Trends and Beyond Worst-case Analysis on Mechanism Design and Approximation Algorithms”. (jointly organized with another relevant HFRI project (project BALSAM)). Held virtually, February 24-25, 2022.
Participation with oral and poster presentation (virtually) at the 30th International Joint Conference on Artificial Intelligence (IJCAI ‘21), Held virtually, August 21-26, 2021.
Participation with oral presentation in the 14th International Symposium on Algorithmic Game Theory (SAGT '21), Aarhus, Denmark, September 21-24, 2021.
Participation with oral presentation in the 8th International Workshop on Computational Social Choice (COMSOC), Held virtually, June 7-10, 2021.
Organization of the 15th Athens Colloquium on Algorithms and Complexity, August 27-28, 2020.
Organization of a Weakly Theory Seminar on topics related to Algorithms, Game Theory and Mechanism Design (jointly organized with the Theoretical Computer Science group of the National Technical University of Athens), September 2020 - June 2021.

Deliverables

We list below the main non-confidential deliverables of the project: