English
Related papers

Related papers: Single-Event Multinomial Full Kelly via Implicit S…

200 papers

The computational study of election problems generally focuses on questions related to the winner or set of winners of an election. But social preference functions such as Kemeny rule output a full ranking of the candidates (a consensus).…

Computer Science and Game Theory · Computer Science 2021-05-19 Zack Fitzsimmons , Edith Hemaspaandra

We show that the Revenue-Optimal Deterministic Mechanism Design problem for a single additive buyer is #P-hard, even when the distributions have support size 2 for each item and, more importantly, even when the optimal solution is…

Computer Science and Game Theory · Computer Science 2017-07-17 Xi Chen , George Matikas , Dimitris Paparas , Mihalis Yannakakis

There is a persistent lack of funding, especially for SMEs, that cyclically worsens. The factoring and invoice discounting market appears to address delays in paying commercial invoices: sellers bring still-to-be-paid invoices to financial…

General Finance · Quantitative Finance 2023-02-20 Peplluis R. Esteva , Alberto Ballesteros Rodríguez

We study hidden-action principal-agent problems with multiple agents. These are problems in which a principal commits to an outcome-dependent payment scheme in order to incentivize some agents to take costly, unobservable actions that lead…

Computer Science and Game Theory · Computer Science 2023-02-01 Matteo Castiglioni , Alberto Marchesi , Nicola Gatti

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ö

This paper reports on empirical work aimed at comparing evidential reasoning techniques. While there is prima facie evidence for some conclusions, this i6 work in progress; the present focus is methodology, with the goal that subsequent…

Artificial Intelligence · Computer Science 2013-04-10 Ronald P. Loui

We study a mathematical model motivated by the support/resistance line method in technical analysis where the underlying stock price transitions between three states of nature in a path-dependent manner. For optimal stopping problems with…

Trading and Market Microstructure · Quantitative Finance 2025-04-15 Vicky Henderson , Saul Jacka , Ruiqi Liu , Jun Maeda

In the classical selection problem, the input consists of a collection of elements and the goal is to pick a subset of elements from the collection such that some objective function $f$ is maximized. This problem has been studied…

Data Structures and Algorithms · Computer Science 2021-09-06 Sofia Maria Nikolakaki , Alina Ene , Evimaria Terzi

We introduce the study of sequential information elicitation in strategic multi-agent systems. In an information elicitation setup a center attempts to compute the value of a function based on private information (a-k-a secrets) accessible…

Computer Science and Game Theory · Computer Science 2012-07-19 Rann Smorodinsky , Moshe Tennenholtz

We study a public event scheduling problem, where multiple public events are scheduled to coordinate the availability of multiple agents. The availability of each agent is determined by solving a separate flexible interval job scheduling…

Data Structures and Algorithms · Computer Science 2024-04-19 Bo Li , Lijun Li , Minming Li , Ruilong Zhang

We study an optimal execution problem in the infinite horizon setup. Our financial market is given by the Black-Scholes model with a linear price impact. The main novelty of the current note is that we study the constrained case where the…

Mathematical Finance · Quantitative Finance 2024-11-20 Yan Dolinsky

We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack, while the follower chooses a feasible packing maximizing his own profit. The leader's aim is to optimize a linear objective function…

Data Structures and Algorithms · Computer Science 2022-07-19 Christoph Buchheim , Dorothee Henke , Jannik Irmai

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 study a stochastic variant of monotone submodular maximization problem as follows. We are given a monotone submodular function as an objective function and a feasible domain defined on a finite set, and our goal is to find a feasible…

Data Structures and Algorithms · Computer Science 2020-06-29 Takanori Maehara , Yutaro Yamaguchi

State-of-the-art posted-price mechanisms for submodular bidders with $m$ items achieve approximation guarantees of $O((\log \log m)^3)$ [Assadi and Singla, 2019]. Their truthfulness, however, requires bidders to compute an NP-hard…

Computer Science and Game Theory · Computer Science 2020-08-05 Linda Cai , Clayton Thomas , S. Matthew Weinberg

In this work we are concerned with the design of efficient mechanisms while eliciting limited information from the agents. First, we study the performance of sampling approximations in facility location games. Our key result is to show that…

Computer Science and Game Theory · Computer Science 2022-08-26 Ioannis Anagnostides , Dimitris Fotakis , Panagiotis Patsilinakos

We study pricing and (super)hedging for American options in an imperfect market model with default, where the imperfections are taken into account via the nonlinearity of the wealth dynamics. The payoff is given by an RCLL adapted process…

Pricing of Securities · Quantitative Finance 2017-08-30 Roxana Dumitrescu , Marie-Claire Quenez , Agnès Sulem

We propose a versatile Monte-Carlo method for pricing and hedging options when the market is incomplete, for an arbitrary risk criterion (chosen here to be the expected shortfall), for a large class of stochastic processes, and in the…

Condensed Matter · Physics 2007-05-23 Benoît Pochart , Jean-Philippe Bouchaud

In this paper, we study the constrained stochastic submodular maximization problem with state-dependent costs. The input of our problem is a set of items whose states (i.e., the marginal contribution and the cost of an item) are drawn from…

Machine Learning · Computer Science 2021-11-12 Shaojie Tang

A lattice-theoretic framework is introduced that permits the study of the conditional independence (CI) implication problem relative to the class of discrete probability measures. Semi-lattices are associated with CI statements and a…

Artificial Intelligence · Computer Science 2014-08-12 Mathias Niepert , Dirk Van Gucht , Marc Gyssens