Ομιλίες-Διαλέξεις

 Στην παράδοση του μαθήματος Αξιολόγηση Επενδύσεων την επόμενη Πέμπτη 11 Οκτωβρίου (ώρα 11:15-13:00) στο Αμφιθέατρο Δ-Οικονομικό &th

 Η σύνθετη επεξεργασία δεδομένων μεγάλου όγκου που συχνά απαντούμε γύρω μας, απαιτεί να ξανασκεφτούμε τη σχέση ανάμε&sigm

 Mobile Robots have been used extensively for Save and Rescue purposes and there is an inherent need to devise decentralized algorithms for area coverage. Most of the algorithms assume a convex area and the ability of the robots to communicate with their spatial (Delaunay) neighbors. However in most practical situations, the domain can be concave and there are communication constraints related to the RF-transmission power. In this talk, a historical overview of the are coverage algorithms relying on Voronoi-partitioning and power diagrams will be provided.

 In his seminal paper, Myerson [1981] provides a revenue-optimal auction for a seller who is looking to sell a single item to multiple bidders. Unfortunately, Myerson's auction generalizes to a limited range of domains, called "single-parameter", where each bidder's preference over the auction’s outcomes is specified by a single parameter. Indeed, extending this auction to "multi-parameter domains", such as selling multiple heterogeneous items to bidders, has been one of the most central problems in Mathematical Economics. We solve this problem.