Opendata, web and dolomites


Dynamic Mechanisms

Total Cost €


EC-Contrib. €






Project "DYNMECH" data sheet

The following table provides information about the project.


Organization address
address: ALLEE DE BRIENNE, Manufacture des Tabacs 21
postcode: 31000
website: n.a.

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country France [FR]
 Total cost 1˙321˙625 €
 EC max contribution 1˙321˙625 € (100%)
 Programme 1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
 Code Call ERC-2016-STG
 Funding Scheme ERC-STG
 Starting year 2017
 Duration (year-month-day) from 2017-01-01   to  2021-12-31


Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 


 Project objective

This project studies dynamic mechanisms. By “dynamic mechanisms”, we mean policies to which a principal (e.g., a seller, an employer, or a regulator) can commit to induce the agents (e.g., buyers, employees, or regulated firms) to take the desired actions over time. Several components of the project are envisaged:

- Competition in dynamic mechanisms. o I propose a competitive setting in which agents (e.g., buyers or workers) learn about the offers of different principals over time. Agents may receive more than one offer at a time, leading to direct competition between mechanisms. Received offers are agents’ private information, permitting strategic delay of acceptance (for instance, an agent may want to wait to evaluate new offers that received in the future).

- Robust predictions for a rich class of stochastic processes. o We study optimal dynamic mechanisms for agents whose preferences evolve stochastically with time. We develop an approach to partially characterizing these mechanisms which (unlike virtually all of the existing literature) does not depend on ad-hoc restrictions on the stochastic process for preferences.

- Efficient bilateral trade with budget balance: dynamic arrival of traders o I study bilateral trade with budget balance, when traders (i) arrive over time, and (ii) have preferences which evolve stochastically with time. The project aims at an impossibility result in this setting: contrary to the existing literature which does not account for dynamic arrivals, budget-balanced efficient trade is typically impossible, even for very patient traders.

- Pre-event ticket sales and complementary investments o We provide a rationale for the early allocation of capacity to customers for events such as flights and concerts based on customers’ demand for pre-event complementary investments (such as booking a hotel or a babysitter). We examine efficient and profit-maximizing mechanisms.


year authors and title journal last update
List of publications.
2018 Daniel F Garrett, Renato Gomes, Lucas Maestri
Competitive Screening Under Heterogeneous Information
published pages: 1590-1630, ISSN: 0034-6527, DOI: 10.1093/restud/rdy072
The Review of Economic Studies 86/4 2020-03-11
2018 Francesc Dilmé and Daniel F Garrett
published pages: , ISSN: 1542-4774, DOI:
Journal of the European Economic Association 2020-03-11

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "DYNMECH" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email ( and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "DYNMECH" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.1.)

Photopharm (2020)

Photopharmacology: From Academia toward the Clinic.

Read More  


The Enemy of the Good: Towards a Theory of Moral Progress

Read More  

VictPart (2019)

Righting Victim Participation in Transitional Justice

Read More