Online Mechanism Design for Scheduling Non-Preemptive Jobs under Uncertain Supply and Demand

We design new algorithms for the problem of allocating uncertain, flexible, and multi-unit demand online given uncertain supply, in order to maximise social welfare. The algorithms can be seen as extensions of the expectation and consensus algorithms from the domain of online scheduling. The problem is especially relevant to the future smart...

Mechanism Design for the Online Allocation of Items without Monetary Payments

We consider online mechanism design without money, where agents are allowed to trade items with other agents, in an attempt to improve their own allocation. In an off-line context, this problem is known as the House Allocation Problem (HAP). We extend HAP to an online problem and call it the Online House Allocation Problem (OHAP). In OHAP,...