English
Related papers

Related papers: When is multidimensional screening a convex progra…

200 papers

We study a new class of contract design problems where a principal delegates the execution of multiple projects to a set of agents. The principal's expected reward from each project is a combinatorial function of the agents working on it.…

Computer Science and Game Theory · Computer Science 2025-06-09 Tal Alon , Matteo Castiglioni , Junjie Chen , Tomer Ezra , Yingkai Li , Inbal Talgam-Cohen

Persuasion studies how a principal can influence agents' decisions via strategic information revelation --- often described as a signaling scheme --- in order to yield the most desirable equilibrium outcome. Recently, there has been a large…

Computer Science and Game Theory · Computer Science 2019-10-22 Haifeng Xu

We study a setting where a set of agents engage in pairwise exchanges of freely replicable goods (e.g., digital goods such as data), where two agents grant each other a copy of a good they possess in exchange for a good they lack. Such…

Computer Science and Game Theory · Computer Science 2026-03-16 Shangyuan Yang , Kirthevasan Kandasamy

A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…

Optimization and Control · Mathematics 2019-04-08 Valentin R. Koch , Hung M. Phan

We study a natural application of contract design in the context of sequential exploration problems. In our principal-agent setting, a search task is delegated to an agent. The agent performs a sequential exploration of $n$ boxes, suffers…

Computer Science and Game Theory · Computer Science 2025-01-27 Martin Hoefer , Conrad Schecker , Kevin Schewior

This paper studies convex duality in optimal investment and contingent claim valuation in markets where traded assets may be subject to nonlinear trading costs and portfolio constraints. Under fairly general conditions, the dual expressions…

Mathematical Finance · Quantitative Finance 2016-03-10 Teemu Pennanen , Ari-Pekka Perkkiö

Direct Multisearch is a well-established class of algorithms, suited for multiobjective derivative-free optimization. In this work, we analyze the worst-case complexity of this class of methods in its most general formulation for…

Optimization and Control · Mathematics 2020-11-04 A. L. Custódio , Y. Diouane , R. Garmanjani , E. Riccietti

This work is concerned with optimal control of partial differential equations where the control enters the state equation as a coefficient and should take on values only from a given discrete set of values corresponding to available…

Optimization and Control · Mathematics 2017-02-27 Christian Clason , Karl Kunisch

We study linear contracts for combinatorial problems in multi-agent settings. In this problem, a principal designs a linear contract with several agents, each of whom can decide to take a costly action or not. The principal observes only…

Computer Science and Game Theory · Computer Science 2024-12-19 Kanstantsin Pashkovich , Jacob Skitsko

We study multi-agent contracts, in which a principal delegates a task to multiple agents and incentivizes them to exert effort. Prior research has mostly focused on maximizing the principal's utility, often resulting in highly disparate…

Computer Science and Game Theory · Computer Science 2026-01-26 Ke Ding , Bo Li , Ankang Sun

A widely applied diversification paradigm is the naive diversification choice heuristic. It stipulates that an economic agent allocates equal decision weights to given choice alternatives independent of their individual characteristics.…

Economics · Quantitative Finance 2016-11-10 Enrico G. De Giorgi , Ola Mahmoud

A recent literature considers causal inference using noisy proxies for unobserved confounding factors. The proxies are divided into two sets that are independent conditional on the confounders. One set of proxies are `negative control…

Econometrics · Economics 2021-10-11 Ben Deaner

Consider the object allocation (one-sided matching) model of Shapley and Scarf (1974). When final allocations are observed but agents' preferences are unknown, when might the allocation be in the core? This is a one-sided analogue of the…

Theoretical Economics · Economics 2023-08-08 Andrew Tai

We consider the classical mathematical economics problem of {\em Bayesian optimal mechanism design} where a principal aims to optimize expected revenue when allocating resources to self-interested agents with preferences drawn from a known…

Computer Science and Game Theory · Computer Science 2010-01-15 Shuchi Chawla , Jason Hartline , David Malec , Balasubramanian Sivan

We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such a scenario happens, for instance, when a committee selects…

Computer Science and Game Theory · Computer Science 2019-07-23 Yakov Babichenko , Oren Dean , Moshe Tennenholtz

In principal-agent models, a principal offers a contract to an agent to perform a certain task. The agent exerts a level of effort that maximizes her utility. The principal is oblivious to the agent's chosen level of effort, and conditions…

Computer Science and Game Theory · Computer Science 2022-07-14 Alon Cohen , Moran Koren , Argyrios Deligkas

We study a continuous time contracting model in which a principal hires a risk averse agent to manage a project over a finite horizon and provides sequential payments whose timing is endogenously determined. The resulting nonzero-sum…

Theoretical Economics · Economics 2025-12-01 Guillermo Alonso Alvarez , Ibrahim Ekren , Liwei Huang

We consider joint optimization and learning problems arising in real-time decision systems. While most existing work focuses primarily on convex, revenue-based objectives, we extend this line of research to multi-objective formulations. In…

Optimization and Control · Mathematics 2026-04-14 Zijun Li , Aswin Kannan

We study a classic Bayesian mechanism design setting of monopoly problem for an additive buyer in the presence of budgets. In this setting a monopolist seller with $m$ heterogeneous items faces a single buyer and seeks to maximize her…

Computer Science and Game Theory · Computer Science 2018-10-09 Yu Cheng , Nick Gravin , Kamesh Munagala , Kangning Wang

We consider a deterministic continuous time model of monopolistic firm, which chooses production and pricing strategies of a single good. Firm's goal is to maximize the discounted profit over infinite time horizon. The no-backlogging…

Optimization and Control · Mathematics 2016-01-19 Dmitry B. Rokhlin , Georgii Mironenko