English
Related papers

Related papers: Optimal, Truthful, and Private Securities Lending

200 papers

In this paper, we discuss a stochastic decision problem of optimally selecting the order in which to try $n$ opportunities that may yield an uncertain reward in the future. The motivation came out from pure curiosity, after an informal…

Computer Science and Game Theory · Computer Science 2016-09-27 Giuseppe C. Calafiore

In this work, we consider the optimal portfolio selection problem under hard constraints on trading amounts, transaction costs and different rates for borrowing and lending when the risky asset returns are serially correlated. No…

Portfolio Management · Quantitative Finance 2014-10-30 Vladimir Dombrovskii , Tatyana Obedko

Stochastic optimization is a widely used approach for optimization under uncertainty, where uncertain input parameters are modeled by random variables. Exact or approximation algorithms have been obtained for several fundamental problems in…

Machine Learning · Computer Science 2025-08-14 Arpit Agarwal , Rohan Ghuge , Viswanath Nagarajan , Zhengjia Zhuo

Motivated by applications to word-of-mouth advertising, we consider a game-theoretic scenario in which competing advertisers want to target initial adopters in a social network. Each advertiser wishes to maximize the resulting cascade of…

Computer Science and Game Theory · Computer Science 2014-03-26 Allan Borodin , Mark Braverman , Brendan Lucier , Joel Oren

We study a screening problem in which an agent privately observes a set of feasible technologies and can strategically disclose only a subset to the principal. The principal then takes an action whose payoff consequences for both players…

Theoretical Economics · Economics 2026-01-23 Tan Gan , Yingkai Li

We consider a monopoly information holder selling information to a budget-constrained decision maker, who may benefit from the seller's information. The decision maker has a utility function that depends on his action and an uncertain state…

Computer Science and Game Theory · Computer Science 2020-02-18 Yiling Chen , Haifeng Xu , Shuran Zheng

We consider the bilateral trade problem, in which two agents trade a single indivisible item. It is known that the only dominant-strategy truthful mechanism is the fixed-price mechanism: given commonly known distributions of the buyer's…

Computer Science and Game Theory · Computer Science 2021-12-21 Zi Yang Kang , Francisco Pernice , Jan Vondrák

We investigate the algorithmic problem of selling information to agents who face a decision-making problem under uncertainty. We adopt the model recently proposed by Bergemann et al. [BBS18], in which information is revealed through…

Computer Science and Game Theory · Computer Science 2020-12-24 Yang Cai , Grigoris Velegkas

Addressing uncertainty is critical for autonomous systems to robustly adapt to the real world. We formulate the problem of model uncertainty as a continuous Bayes-Adaptive Markov Decision Process (BAMDP), where an agent maintains a…

Machine learning models are increasingly used in high-stakes decision-making systems. In such applications, a major concern is that these models sometimes discriminate against certain demographic groups such as individuals with certain…

Machine Learning · Computer Science 2023-06-06 Andrew Lowy , Devansh Gupta , Meisam Razaviyayn

We consider the scheduling problem on $n$ strategic unrelated machines when no payments are allowed, under the objective of minimizing the makespan. We adopt the model introduced in [Koutsoupias, Theory Comput. Syst. (2014)] where a machine…

Computer Science and Game Theory · Computer Science 2018-12-05 Yiannis Giannakopoulos , Elias Koutsoupias , Maria Kyropoulou

In this paper, we develop a new method for finding an optimal biddingstrategy in sequential auctions, using a dynamic programming technique. Theexisting method assumes that the utility of a user is represented in anadditive form. Thus, the…

Computer Science and Game Theory · Computer Science 2013-01-14 Hiromitsu Hattori , Makoto Yokoo , Yuko Sakurai , Toramatsu Shintani

Online Resource Allocation addresses the problem of efficiently allocating limited resources to buyers with incomplete knowledge of future requests. In our setting, buyers arrive sequentially requesting a set of items, each with a value…

Computer Science and Game Theory · Computer Science 2026-02-11 Dimitris Fotakis , Charalampos Platanos , Thanos Tolias

We study the design of truthful auctions for selling identical items in unlimited supply (e.g., digital goods) to n unit demand buyers. This classic problem stands out from profit-maximizing auction design literature as it requires no…

Computer Science and Game Theory · Computer Science 2014-01-07 Ning Chen , Nick Gravin , Pinyan Lu

This paper studies the utility maximization on the terminal wealth with random endowments and proportional transaction costs. To deal with unbounded random payoffs from some illiquid claims, we propose to work with the acceptable portfolios…

Mathematical Finance · Quantitative Finance 2018-08-27 Erhan Bayraktar , Xiang Yu

Network slicing is emerging as a promising method to provide sought-after versatility and flexibility to cope with ever-increasing demands. To realize such potential advantages and to meet the challenging requirements of various network…

Computer Science and Game Theory · Computer Science 2021-02-23 Jalal Khamse-Ashari , Gamini Senarath , Irem Bor-Yaliniz , Halim Yanikomeroglu

We consider the fundamental scenario where a single item is to be sold to one of two agents. Both agents draw their valuation for the item from the same probability distribution. However, only one of them submits a bid to the mechanism. The…

Computer Science and Game Theory · Computer Science 2025-08-26 Ioannis Caragiannis , Georgios Kalantzis

Trailing stop is a popular stop-loss trading strategy by which the investor will sell the asset once its price experiences a pre-specified percentage drawdown. In this paper, we study the problem of timing buy and then sell an asset subject…

Mathematical Finance · Quantitative Finance 2019-03-26 Tim Leung , Hongzhong Zhang

Bidding in simultaneous auctions is challenging because an agent's value for a good in one auction may depend on the uncertain outcome of other auctions: the so-called exposure problem. Given the gap in understanding of general simultaneous…

Computer Science and Game Theory · Computer Science 2012-10-19 Michael P. Wellman , Eric Sodomka , Amy Greenwald

We consider the problem of optimally allocating a limited number of resources across time to maximize revenue under stochastic demands. This formulation is relevant in various areas of control, such as supply chain, ticket revenue…

Optimization and Control · Mathematics 2025-10-01 Alexandros E. Tzikas , Nazim Kemal Ure , Mansur Arief , Mykel J. Kochenderfer , Stephen P. Boyd