English
Related papers

Related papers: Submission Fees in Risk-Taking Contests

200 papers

The problem of optimal switching between nonlinear autonomous subsystems is investigated in this study where the objective is not only bringing the states to close to the desired point, but also adjusting the switching pattern, in the sense…

Systems and Control · Computer Science 2014-11-19 Ali Heydari

We consider the situation in which an organizer is trying to convene an event, and needs to choose a subset of agents to be invited. Agents have preferences over how many attendees should be at the event and possibly also who the attendees…

Computer Science and Game Theory · Computer Science 2014-06-02 Hooyeon Lee , Yoav Shoham

When funding public goods, resources are often allocated via mechanisms that resemble contests, especially in the case of research grants. A common critique of these contests is that they induce ``too much'' effort from participants. This…

General Economics · Economics 2024-03-13 Kyle R. Myers

We consider an exchange who wishes to set suitable make-take fees to attract liquidity on its platform. Using a principal-agent approach, we are able to describe in quasi-explicit form the optimal contract to propose to a market maker. This…

Trading and Market Microstructure · Quantitative Finance 2019-11-27 Omar El Euch , Thibaut Mastrolia , Mathieu Rosenbaum , Nizar Touzi

We study the problem of learning classifiers with a fairness constraint, with three main contributions towards the goal of quantifying the problem's inherent tradeoffs. First, we relate two existing fairness measures to cost-sensitive…

Machine Learning · Computer Science 2017-05-26 Aditya Krishna Menon , Robert C. Williamson

Institutions and investors face the constant challenge of making accurate decisions and predictions regarding how best they should distribute their endowments. The problem of achieving an optimal outcome at minimal cost has been extensively…

Multiagent Systems · Computer Science 2021-02-09 Theodor Cimpeanu , Cedric Perret , The Anh Han

We consider collaborative systems where users make contributions across multiple available projects and are rewarded for their contributions in individual projects according to a local sharing of the value produced. This serves as a model…

Computer Science and Game Theory · Computer Science 2013-08-06 Yoram Bachrach , Vasilis Syrgkanis , Milan Vojnovic

We study a contest in which $N$ players sequentially draw from a distribution as many times as they want at a fixed cost per draw, with no recall, and the highest accepted value wins a prize. In the unique symmetric equilibrium, the…

Theoretical Economics · Economics 2026-04-28 Emre Ozdenoren , Murat Erkurt

We study the design of an auction for an income-generating asset such as an intellectual property license. Each bidder has a signal about his future income from acquiring the asset. After the asset is allocated, the winner's income from the…

Theoretical Economics · Economics 2026-04-17 Ian Ball , Teemu Pekkarinen

Postselection is the process of discarding outcomes from statistical trials that are not the event one desires. Postselection can be useful in many applications where the cost of getting the wrong event is implicitly high. However, unless…

Quantum Physics · Physics 2015-09-01 Joshua Combes , Christopher Ferrie

We consider an online preemptive scheduling problem where jobs with deadlines arrive sporadically. A commitment requirement is imposed such that the scheduler has to either accept or decline a job immediately upon arrival. The scheduler's…

Data Structures and Algorithms · Computer Science 2011-10-07 Shiyao Chen , Lang Tong , Ting He

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

This paper considers a distributed stochastic optimization problem where the goal is to minimize the time average of a cost function subject to a set of constraints on the time averages of a related stochastic processes called penalties. We…

Information Theory · Computer Science 2016-10-06 B. N. Bharath , Vaishali P

We study buyer-optimal procurement mechanisms when quality is contractible. When some costs are borne by every participant of a procurement auction regardless of winning, the classic analysis should be amended. We show that an optimal…

Theoretical Economics · Economics 2024-11-20 Pasha Andreyanov , Ilia Krasikov , Alex Suzdaltsev

In this paper, we study a new stochastic submodular maximization problem with state-dependent costs and rejections. The input of our problem is a budget constraint $B$, and a set of items whose states (i.e., the marginal contribution and…

Data Structures and Algorithms · Computer Science 2021-11-12 Shaojie Tang

Scientific research funding is allocated largely through a system of soliciting and ranking competitive grant proposals. In these competitions, the proposals themselves are not the deliverables that the funder seeks, but instead are used by…

Physics and Society · Physics 2019-01-04 Kevin Gross , Carl T. Bergstrom

We consider the problem of designing risk-sensitive optimal control policies for scheduling packet transmissions in a stochastic wireless network. A single client is connected to an access point (AP) through a wireless channel. Packet…

Systems and Control · Computer Science 2017-09-11 Rahul Singh , Xueying Guo , Eytan Modiano

We study mechanisms for selling a single item when buyers have private costs for participating in the mechanism. An agent's participation cost can also be interpreted as an outside option value that she must forego to participate. This…

Computer Science and Game Theory · Computer Science 2023-11-07 Yannai A. Gonczarowski , Nicole Immorlica , Yingkai Li , Brendan Lucier

Stochastic matching is the stochastic version of the well-known matching problem, which consists in maximizing the rewards of a matching under a set of probability distributions associated with the nodes and edges. In most stochastic…

Optimization and Control · Mathematics 2024-05-01 Yuya Hikima , Yasunori Akagi , Hideaki Kim

In reinforcement learning episodes, the rewards and punishments are often non-deterministic, and there are invariably stochastic elements governing the underlying situation. Such stochastic elements are often numerous and cannot be known in…

Machine Learning · Computer Science 2019-02-13 Nikki Lijing Kuang , Clement H. C. Leung , Vienne W. K. Sung