| Ref.No: | 61213800 |
| Start date: | 15.10.2025 |
| End date: | 30.09.2027 |
| Approval date: | 15.10.2025 |
| Department: | ELECTRICAL & COMPUTER ENGINEERING |
| Sector: | COMPUTER SCIENCE |
| Financier: | IDRYMA KRATIKWN YPOTROFIWN APOKENTRWTIKH DHM YPHRES |
| Budget: | 10.000,00 € |
| Public key: | Ρ7ΓΙ46ΨΖΣ4-5ΥΔ |
| Scientific Responsible: | Prof. ARISTEIDIS PAGOURTZIS |
| Email: | pagour@cs.ntua.gr |
| Description: | THE PURPOSE OF THIS RESEARCH PROJECT IS TO CONTRIBUTE TO STRENGTHENING THE COLLABORATION BETWEEN THE RESEARCH TEAMS OF THE COMPUTATION AND REASONING LABORATORY OF NTUA AND THE LAMSADE LABORATORY OF PARIS DAUPHINE UNIVERSITY. THE OBJECTIVE OF THE COLLABORATION IS TO UNDERSTAND AND PROPOSE SOLUTIONS TO MODERN COMBINATORIAL OPTIMIZATION PROBLEMS, WHICH ARISE IN A DYNAMIC AND SOCIAL CONTEXT. IN MANY REAL-WORLD SITUATIONS, A GROUP OF AGENTS INTERACT TO SELECT AND ALLOCATE INDIVISIBLE RESOURCES (E.G., PATHS ON A NETWORK, PROCESSORS ON A COMPUTER, TIME SLOTS, ETC.). THE AIM IS TO CALCULATE OPTIMAL OR APPROXIMATELY OPTIMAL SOLUTIONS BOTH UNDER CENTRAL CONTROL AND IN THE DECENTRALIZED SCENARIO. THE MAIN OBJECTIVE OF THE PROJECT IS TO STUDY THE COMPUTATIONAL PROPERTIES AND COMPLEXITY OF EXACT OR APPROXIMATE SOLUTIONS TO SUCH COMBINATORIAL PROBLEMS THAT ARISE IN DYNAMIC AND MULTI-AGENT ENVIRONMENTS. |
