Competition Between Cooperative Projects

Conference Paper (2018)
Author(s)

G. Polevoy (Vrije Universiteit Amsterdam)

MM Weerdt (TU Delft - Algorithmics)

Research Group
Algorithmics
Copyright
© 2018 G. Polevoy, M.M. de Weerdt
DOI related publication
https://doi.org/10.1007/978-3-319-76892-2_2
More Info
expand_more
Publication Year
2018
Language
English
Copyright
© 2018 G. Polevoy, M.M. de Weerdt
Research Group
Algorithmics
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public. @en
Pages (from-to)
16-31
ISBN (print)
978-3-319-76891-5
ISBN (electronic)
978-3-319-76892-2
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

A paper needs to be good enough to be published; a grant proposal needs to be sufficiently convincing compared to the other proposals, in order to get funded. Papers and proposals are examples of cooperative projects that compete with each other and require effort from the involved agents, while often these agents need to divide their efforts across several such projects. We aim to provide advice how an agent can act optimally and how the designer of such a competition (e.g., the program chairs) can create the conditions under which a socially optimal outcome can be obtained. We therefore extend a model for dividing effort across projects with two types of competition: a quota or a success threshold. In the quota competition type, only a given number of the best projects survive, while in the second competition type, only the projects that are better than a predefined success threshold survive. For these two types of games we prove conditions for equilibrium existence and efficiency. Additionally we find that competitions using a success threshold can more often have an efficient equilibrium than those using a quota. We also show that often a socially optimal Nash equilibrium exists, but there exist inefficient equilibria as well, requiring regulation.

Files

Polevoy_Weerdt2018_Chapter_Com... (pdf)
(pdf | 0.642 Mb)
- Embargo expired in 25-08-2018
License info not available