English
Related papers

Related papers: Extractive contest design

200 papers

We consider the expressivity of Markov rewards in sequential decision making under uncertainty. We view reward functions in Markov Decision Processes (MDPs) as a means to characterize desired behaviors of agents. Assuming desired behaviors…

Artificial Intelligence · Computer Science 2023-07-25 Shuwa Miura

I study symmetric competitions in which each player chooses an arbitrary distribution over a one-dimensional performance index, subject to a convex cost. I establish existence of a symmetric equilibrium, document various properties it must…

Theoretical Economics · Economics 2026-05-07 Mark Whitmeyer

We consider a resource extraction problem which extends the classical de Finetti problem for a Wiener process to include the case when a competitor, who is equipped with the possibility to extract all the remaining resources in one piece,…

Optimization and Control · Mathematics 2022-04-15 Erik Ekström , Alessandro Milazzo , Marcus Olofsson

We consider the design of experiments to evaluate treatments that are administered by self-interested agents, each seeking to achieve the highest evaluation and win the experiment. For example, in an advertising experiment, a company wishes…

Methodology · Statistics 2015-09-18 Panos Toulis , David C. Parkes , Elery Pfeffer , James Zou

We study contests where the designer's objective is an extension of the widely studied objective of maximizing the total output: The designer gets zero marginal utility from a player's output if the output of the player is very low or very…

Computer Science and Game Theory · Computer Science 2025-12-09 Edith Elkind , Abheek Ghosh , Paul W. Goldberg

Fairness in multiwinner elections is studied in varying contexts. For instance, diversity of candidates and representation of voters are both separately termed as being fair. A common denominator to ensure fairness across all such contexts…

Computer Science and Game Theory · Computer Science 2022-11-24 Kunal Relia

In quasi-proportional auctions, the allocation is shared among bidders in proportion to their weighted bids. The auctioneer selects a bid weight function, and bidders know the weight function when they bid. In this note, we analyze how…

Computer Science and Game Theory · Computer Science 2015-09-07 Eric Bax , James Li , Zheng Wen

We study a game of resource extraction of a common good under one-dimensional diffusive dynamics with player actions corresponding to singular stochastic control up to absorption at $0$, implying a trade-off between profitable resource…

Probability · Mathematics 2025-12-22 Piotr Chlebicki , Kristoffer Lindensjö

A \emph{fair competition}, based on the concept of envy-freeness, is a non-eliminating competition where each contestant (team or individual player) may not play against all other contestants, but the total difficulty for each contestant is…

Data Structures and Algorithms · Computer Science 2021-02-09 Siddharth Gupta , Meirav Zehavi

Elicitability is a property of $\mathbb{R}^k$-valued functionals defined on a set of distribution functions. These functionals represent statistical properties of a distribution, for instance its mean, variance, or median. They are called…

Statistics Theory · Mathematics 2017-08-01 Jonas Brehmer

We study the problem of finding an envy-free allocation of indivisible goods among agents with additive valuations. We focus on the fairness notion of envy-freeness up to any good (EFX). A central open question in fair division is whether…

Computer Science and Game Theory · Computer Science 2025-05-26 Vishwa Prakash HV , Pratik Ghosal , Prajakta Nimbhorkar , Nithin Varma

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

We study the question of existence and fast computation of fair and efficient allocations of indivisible resources among agents with additive valuations. As such allocations may not exist for arbitrary instances, we ask if they exist for…

Computer Science and Game Theory · Computer Science 2025-12-22 Aprup Kale , Rucha Kulkarni , Navya Garg

We study $n$-dimensional contests between two players with heterogeneous effort costs, where each dimension (battle) is modeled as a Tullock contest. Prize-allocation rules are identity-independent, budget-balanced, and weakly increasing in…

Theoretical Economics · Economics 2026-03-31 Siyuan Fan , Zhonghong Kuang , Jingfeng Lu

We study the existence of equilibrium when agents' preferences may not beconvex. For some specific utility functions, we provide a necessary and sufficientcondition under which there exists an equilibrium. The standard approach cannot be…

Computational Finance · Quantitative Finance 2025-03-24 Cuong Le Van , Ngoc-Sang Pham

This paper explores the design of contests involving $n$ contestants, focusing on how the designer decides on the number of contestants allowed and the prize structure with a fixed budget. We characterize the unique symmetric Bayesian Nash…

Computer Science and Game Theory · Computer Science 2025-02-14 Hanbing Liu , Ningyuan Li , Weian Li , Qi Qi , Changyuan Yu

The existence of EFX allocations is a fundamental open problem in discrete fair division. Given a set of agents and indivisible goods, the goal is to determine the existence of an allocation where no agent envies another following the…

Computer Science and Game Theory · Computer Science 2022-12-26 Hannaneh Akrami , Noga Alon , Bhaskar Ray Chaudhury , Jugal Garg , Kurt Mehlhorn , Ruta Mehta

This paper is concerned with the investigation of the controllability and observability of Caputo fractional differential linear systems of any real order {\alpha} . Expressions for the expansions of the evolution operators in powers of the…

Dynamical Systems · Mathematics 2010-10-04 M. De La Sen

Let $X$ be an arbitrary real-valued random variable (r.v.), with the characteristic function (c.f.) $f$. Integral expressions for the c.f.\ of the r.v.'s $\max(0,X)$ in terms of $f$ are given, as well as other related results. Applications…

Probability · Mathematics 2017-01-17 Iosif Pinelis

The goal of an auction is to determine commodity prices such that all participants are perfectly happy. Such a solution is called a competitive equilibrium and does not exist in general. For this reason we are interested in solutions which…

Optimization and Control · Mathematics 2013-09-04 Johannes C. Müller