相关论文: Contests to Incentivize a Target Group

Auctions are modeled as Bayesian games with continuous type and action spaces. Determining equilibria in auction games is computationally hard in general and no exact solution theory is known. We introduce an algorithmic framework in which…

Many applications of RCTs involve the presence of multiple treatment administrators -- from field experiments to online advertising -- that compete for the subjects' attention. In the face of competition, estimating a causal effect becomes…

In revenue maximization of selling a digital product in a social network, the utility of an agent is often considered to have two parts: a private valuation, and linearly additive influences from other agents. We study the incomplete…

We study competition among contests in a general model that allows for an arbitrary and heterogeneous space of contest design, where the goal of the contest designers is to maximize the contestants' sum of efforts. Our main result shows…

We initiate the study of how auction design affects the division of surplus among buyers. We propose a parsimonious measure for equity and apply it to the family of standard auctions for homogeneous goods. Our surplus-equitable mechanism is…

Benchmark hacking refers to tuning a machine learning model to score highly on certain evaluation criteria without improving true generalization or faithfully solving the intended problem. We study this phenomenon in a generic machine…

Correlated equilibria arise naturally when agents communicate or rely on intermediaries such as recommendation systems. We study when a given Nash equilibrium can be improved within the set of correlated equilibria for general objectives.…

We investigate the model of multiple contests held in parallel, where each contestant selects one contest to join and each contest designer decides the prize structure to compete for the participation of contestants. We first analyze the…

We study how increasing competition, by making prizes more unequal, affects effort in contests. In a finite type-space environment, we characterize the equilibrium, analyze the effect of competition under linear costs, and identify…

We describe an algorithm for computing best response strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents' types and actions, conditional on linear comparisons of…

Within the framework of Game Theory, contests study decision-making in those situations or conflicts when rewards depend on the relative rank between contenders rather than their absolute performance. By relying on the formalism of Tullock…

We consider a market setting of agents with additive valuations over heterogeneous divisible resources. Agents are assigned a budget of tokens (possibly unequal budgets) they can use to obtain resources; leftover tokens are worthless. We…

This paper provides a novel solution to a task allocation problem, by which a group of agents decides on the assignment of a discrete set of tasks in a distributed manner. In this setting, heterogeneous agents have individual preferences…

We study $k$-price auctions in a complete information environment and characterize all pure-strategy Nash equilibrium outcomes. In a setting with $n$ agents having ordered valuations, we show that any agent, except those with the lowest…

We study the optimal allocation of prizes in rank-order tournaments with loss averse agents. Prize sharing becomes increasingly optimal with loss aversion because more equitable prizes reduce the marginal psychological cost of anticipated…

Examining the behavior of multi-agent systems is vitally important to many emerging distributed applications - game theory has emerged as a powerful tool set in which to do so. The main approach of game-theoretic techniques is to model…

We study the problem of allocating indivisible goods among agents with additive valuations. When randomization is allowed, it is possible to achieve compelling notions of fairness such as envy-freeness, which states that no agent should…

We study a problem where a group of agents has to decide how a joint reward should be shared among them. We focus on settings where the share that each agent receives depends on the subjective opinions of its peers concerning that agent's…

We consider the computational complexity of computing Bayes-Nash equilibria in first-price auctions, where the bidders' values for the item are drawn from a general (possibly correlated) joint distribution. We show that when the values and…

Incentives are key to the success of crowdsourcing which heavily depends on the level of user participation. This paper designs an incentive mechanism to motivate a heterogeneous crowd of users to actively participate in crowdsourcing…