On the design and synthesis of voting games: Exact solutions for the inverse problems

In many real-world decision making settings, situations arise in which the parties (or: players) involved must collectively make decisions while not every player is supposed to have an equal amount of influence in the outcome of such a decision. The "weighted voting game" is a model that is often used to make such decisions. The amount of...

Solving the Plan Coordination Problem

In this thesis we focus on implicit coordination for multi-agent planning problems. In such problems, agents are not able or willing to cooperate with each other and hence we need to perform pre-planning coordination in order to ensure that merging all their plans always results in a feasible joint plan. More specifically, we are interested in...

CHAINels: Journal

A group of three students worked a couple of months at CHAINels for their computer science bachelor project. In these months a recommendation algorithm was designed and implemented in CHAINels. The recommendation algorithm recommends posts to a company and those posts are shown in the Journal which was also made during this project. In this...

Maximal Flexibility and Optimal Decoupling in Task Scheduling Problems

This thesis focuses on the properties of (multi-agent) task scheduling instances represented as Simple Temporal Problems (STP). By defining a subclass STP$_{\prec}$ of STPs that contain these task scheduling instances, existing algorithms for arbitrary STPs can be improved if applied to task scheduling STPs, allowing arbitrary schedules and...

Project Scheduling: The Impact of Instance Structure on Heuristic Performance

Many meta-heuristic approaches have been suggested for or applied to the Resource Constrained Project Scheduling Problem (RCPSP). The existence of a number of highly accessible standard benchmark sets has promoted a research focus on finding anything that improves average solution quality, without investigating what effect is responsible for the...

Projectcampus grading and review

This report describes, analyzes and evaluates the process around the design of the grading and review module and its development for the online learning environment Projectcampus. The module was developed as a bachelor’s project. This project is the last part of the bachelor phase of the computer science study of the Delft University of...

Robust Solutions for the Resource-Constrained Project Scheduling Problem: Understanding and Improving Robustness in Partial Order Schedules produced by the Chaining algorithm

Robustness is essential for schedules if they are being executed under uncertain conditions. In this thesis we research robustness in Partial Order Schedules, which represent sets of solutions for instances of the Resource-Constrained Project Scheduling Problem. They can be generated using a greedy procedure called Chaining, which can be easily...