Opendata, web and dolomites


Complexity and Simplicity in Economic Mechanisms

Total Cost €


EC-Contrib. €






Project "COMPECON" data sheet

The following table provides information about the project.


Organization address
postcode: 91904

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 Israel [IL]
 Total cost 2˙026˙706 €
 EC max contribution 2˙026˙706 € (100%)
 Programme 1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
 Code Call ERC-2016-ADG
 Funding Scheme ERC-ADG
 Starting year 2017
 Duration (year-month-day) from 2017-05-01   to  2022-04-30


Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 


 Project objective

As more and more economic activity is moving to the Internet, familiar economic mechanisms are being deployed at unprecedented scales of size, speed, and complexity. In many cases this new complexity becomes the defining feature of the deployed economic mechanism and the quantitative difference becomes a key qualitative one. A well-studied example of such situations is how the humble single-item auction suddenly becomes a billion-times repeated online ad auction, or even becomes a combinatorial auction with exponentially many possible outcomes. Similar complexity explosions occur with various markets, with information dissemination, with pricing structures, and with many other economic mechanisms.

The aim of this proposal is to study the role and implications of such complexity and to start developing a coherent economic theory that can handle it. We aim to identify various measures of complexity that are crucial bottlenecks and study them. Examples of such complexities include the amount of access to data, the length of the description of a mechanism, its communication requirements, the cognitive complexity required from users, and, of course, the associated computational complexity. On one hand we will attempt finding ways of effectively dealing with complexity when it is needed, and on the other hand, attempt avoiding complexity, when possible, replacing it with ``simple' alternatives without incurring too large of a loss.


year authors and title journal last update
List of publications.
2017 Noga Alon, Moshe Babaioff, Yannai A. Gonczarowski, Yishay Mansour, Shay Moran, Amir Yehudayoff
Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues
published pages: , ISSN: , DOI:
NIPS 2019-12-17
2018 Moshe Babaioff, Yang Cai, Yannai A. Gonczarowski, Mingfei Zhao
The Best of Both Worlds: Asymptotically Efficient Mechanisms with a Guarantee on the Expected Gains-From-Trade
published pages: , ISSN: , DOI:
ACM EC 2019-12-17
2019 Moshe Babaioff, Yannai A. Gonczarowski, Assaf Romm
Playing on a level field: Sincere and sophisticated players in the Boston mechanism with a coarse priority structure
published pages: , ISSN: , DOI:
ACM EC 2019-12-17
2019 Yoav Kolumbus, Gali Noti
Neural Networks for Predicting Human Interactions in Repeated Games
published pages: , ISSN: , DOI:
IJCAI 2019-11-13
2018 Moshe Babaioff, Noam Nisan, Aviad Rubinstein
Optimal Deterministic Mechanisms for an Additive Buyer
published pages: , ISSN: , DOI:
ACM EC 2019-11-13
2019 Yakov Babichenko, Shahar Dobzinski, Noam Nisan
The Communication Complexity of Local Search
published pages: , ISSN: , DOI:
STOC 2019-11-13
2019 Paul Dutting, Tim Roughgarden, Inbal Talgam-Cohen
Simple versus Optimal Contracts
published pages: , ISSN: , DOI:
ACM EC 2019-11-13
2019 Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen
Competitive Equilibria with Indivisible Goods and Generic Budgets
published pages: , ISSN: , DOI:
ACM Conference on Fairness, Accountability, and Transparency 2019-11-13
2019 Simina Branzei, Aris Filos-Ratsikas
Walrasian Dynamics in Multi-unit Markets
published pages: , ISSN: , DOI:
AAAI 2019-11-13
2020 Moshe Babaioff, Kira Goldner, Yannai A. Gonczarowski
Bulow-Klemperer-Style Results for Welfare Maximization in Two-Sided Markets
published pages: , ISSN: , DOI:
SODA 2019-11-13
2019 Nisan, Noam
The Demand Query Model for Bipartite Matching
published pages: , ISSN: , DOI:
1 2019-11-13
2019 Anat Ganor, Karthik C. S., Domotor Palvolgyi
On Communication Complexity of Fixed Point Computation
published pages: , ISSN: , DOI:
2018 Y. Gonczarowski, L. Kovalio, N. Nisan and A. Romm
\"Matching for the Israeli \"\"Mechinot\"\" Gap Year: Handling Rich Diversity Requirements\"
published pages: , ISSN: , DOI:
Workshop on Mechanism Design for Social Good 2019-10-08
2018 Yannai A. Gonczarowski, S. Matthew Weinberg
The Sample Complexity of Up-to-ε Multi-Dimensional Revenue Maximization
published pages: , ISSN: , DOI:
FOCS 2019-10-08
2018 Babaioff, Moshe; Nisan, Noam; Rubinstein, Aviad
Optimal Deterministic Mechanisms for an Additive Buyer
published pages: , ISSN: , DOI:
ACM EC 2019-10-08
2017 Simina Branzei, Noam Nisan
The Query Complexity of Cake Cutting
published pages: , ISSN: , DOI:
2018 Yannai A. Gonczarowski
Bounding the Menu-Size of Approximately Optimal Auctions via Optimal-Transport Duality
published pages: , ISSN: , DOI:
STOC 2019-10-08
2018 Brânzei, Simina; Mehta, Ruta; Nisan, Noam
Universal Growth in Production Economies
published pages: , ISSN: , DOI:
NIPS 2019-10-08
2017 Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen
Competitive Equilibrium with Indivisible Goods and Generic Budgets
published pages: , ISSN: , DOI:
MATCH-UP 2019-10-08
2018 Yoav Kolumbus, Sorin Solomon
Phase Transition in the Maximal Influence Problem: When Do We Need Optimization?
published pages: , ISSN: , DOI:
2018 Ron Kupfer
The Instability of Stable Matchings: The Influence of One Strategic Agent on The Matching Market
published pages: , ISSN: , DOI:

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "COMPECON" 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 "COMPECON" are provided by the European Opendata Portal: CORDIS opendata.

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


Exploiting genome replication to design improved plant growth strategies

Read More  

AdjustNet (2020)

Self-Adjusting Networks

Read More  

IL7RsignaTHER (2020)

Antibody-based IL-7R targeted therapies

Read More