# Designing truthful mecanism

Time: 11:00 -- Location: LRI, 465

summary: In this presentation, we will focus on the generalization of knapsack budgeting.
Given a set of projects and a budget, each voter selects a subset of projects; we want to maximize social welfare.
Different measures can describe this (maximizing the minimum utility of the players, maximizing the sum of their utilities, etc).

We want to design truthful mechanisms (each voter has an incentive to tell the truth).
As this notion contains many impossibility theorems, we limit our study to different ballots
(preference ranking, selection of one or more projects, etc.) and their computational properties.

The first part will deal with unitary voting (voters choose only one project).
The second part is devoted to ongoing work on binary voting (voters can approve several projects).

This work is a join work with Johanne Cohen and Valentin Dardilhac.