pith. machine review for the scientific record. sign in

arxiv: 1907.04740 · v1 · pith:ZKJRWUWKnew · submitted 2019-07-10 · 💻 cs.GT · cs.MA

Optimal mechanisms with budget for user generated contents

classification 💻 cs.GT cs.MA
keywords contentsmechanismmechanismsoptimalalgorithmarbitrarilyboundedbudget
0
0 comments X
read the original abstract

In this paper, we design gross product maximization mechanisms which incentivize users to upload high-quality contents on user-generated-content (UGC) websites. We show that, the proportional division mechanism, which is widely used in practice, can perform arbitrarily bad in the worst case. The problem can be formulated using a linear program with bounded and increasing variables. We then present an $O(n\log n)$ algorithm to find the optimal mechanism, where n is the number of players.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.