Competition between Cooperative Projects

Conference Paper (2017)
Author(s)

G. Polevoy (Universiteit van Amsterdam)

MM Weerdt (TU Delft - Algorithmics)

Research Group
Algorithmics
Copyright
© 2017 G. Polevoy, M.M. de Weerdt
More Info
expand_more
Publication Year
2017
Language
English
Copyright
© 2017 G. Polevoy, M.M. de Weerdt
Research Group
Algorithmics
Pages (from-to)
17-31
ISBN (electronic)
978-94-034-0299-4
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 suciently 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 eort from the involved agents, while often these agents need to divide their eorts 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 eort across projects with two types of competition: a quota or a suc-cess 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 predened success threshold survive. For these two types of games we prove conditions for equilibrium existence and eciency. Additionally we nd that competitions using a success threshold can more often have an ecient equilibrium than those using a quota. We also show that often a socially optimal Nash equilibrium exists, but there exist inecient equilibria as well, requiring regulation

Files

Seg_proj_comp.pdf
(pdf | 0.439 Mb)
License info not available