English
Related papers

Related papers: Parimutuel Betting on Permutations

200 papers

We introduce a new model of combinatorial contracts in which a principal delegates the execution of a costly task to an agent. To complete the task, the agent can take any subset of a given set of unobservable actions, each of which has an…

Computer Science and Game Theory · Computer Science 2025-09-03 Paul Duetting , Tomer Ezra , Michal Feldman , Thomas Kesselheim

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

This paper initiates a study into the century-old issue of market predictability from the perspective of computational complexity. We develop a simple agent-based model for a stock market where the agents are traders equipped with simple…

Computational Engineering, Finance, and Science · Computer Science 2007-05-23 James Aspnes , David F. Fischer , Michael J. Fischer , Ming-Yang Kao , Alok Kumar

We develop a novel deep learning approach for pricing European basket options written on assets that follow jump-diffusion dynamics. The option pricing problem is formulated as a partial integro-differential equation, which is approximated…

Computational Finance · Quantitative Finance 2026-02-10 Emmanuil H. Georgoulis , Antonis Papapantoleon , Costas Smaragdakis

In an all-pay auction, only one bidder wins but all bidders must pay the auctioneer. All-pay bidding games arise from attaching a similar bidding structure to traditional combinatorial games to determine which player moves next. In contrast…

Computer Science and Game Theory · Computer Science 2015-05-15 Michael Menz , Justin Wang , Jiyang Xie

We study the problem of learning a linear model to set the reserve price in an auction, given contextual information, in order to maximize expected revenue from the seller side. First, we show that it is not possible to solve this problem…

Optimization and Control · Mathematics 2020-11-17 Joey Huchette , Haihao Lu , Hossein Esfandiari , Vahab Mirrokni

We introduce a dynamic mechanism design problem in which the designer wants to offer for sale an item to an agent, and another item to the same agent at some point in the future. The agent's joint distribution of valuations for the two…

Computer Science and Game Theory · Computer Science 2023-05-22 Christos Papadimitriou , George Pierrakos , Christos-Alexandros Psomas , Aviad Rubinstein

On ad exchange platforms the place for advertisement is sold through different kinds of auctions. However, it is not uncommon the situation where the seller repeatedly encounters only one buyer, thus the posted price auction degenerates…

Computer Science and Game Theory · Computer Science 2019-02-05 Nikita Kalinin

We study optimal risk sharing among $n$ agents endowed with distortion risk measures. Our model includes market frictions that can either represent linear transaction costs or risk premia charged by a clearing house for the agents. Risk…

Optimization and Control · Mathematics 2012-05-07 M. Ludkovski , V. R. Young

We study a classical Bayesian mechanism design problem where a seller is selling multiple items to multiple buyers. We consider the case where the seller has costs to produce the items, and these costs are private information to the seller.…

Computer Science and Game Theory · Computer Science 2020-04-20 Yang Cai , Mingfei Zhao

We consider a model of bilateral trade with private values. The value of the buyer and the cost of the seller are jointly distributed. The true joint distribution is unknown to the designer, however, the marginal distributions of the value…

Theoretical Economics · Economics 2023-01-02 Komal Malik

In this paper, we combine modern portfolio theory and option pricing theory so that a trader who takes a position in a European option contract and the underlying assets can construct an optimal portfolio such that at the moment of the…

Mathematical Finance · Quantitative Finance 2020-01-06 Abootaleb Shirvani , Frank J. Fabozzi , Stoyan V. Stoyanov

We consider an incomplete multi-asset binomial market model. We prove that for a wide class of contingent claims the extremal multi-step martingale measure is a power of the corresponding single-step extremal martingale measure. This allows…

Mathematical Finance · Quantitative Finance 2023-03-01 Jarek Kędra , Assaf Libman , Victoria Steblovskaya

We present a number of models for the adword auctions used for pricing advertising slots on search engines such as Google, Yahoo! etc. We begin with a general problem formulation which allows the privately known valuation per click to be a…

Computer Science and Game Theory · Computer Science 2007-05-23 Garud Iyengar , Anuj Kumar

A solution to a portfolio optimization problem is always conditioned by constraints on the initial capital and the price of the available market assets. If a risk neutral measure is known, then the price of each asset is the discounted…

Optimization and Control · Mathematics 2025-07-10 Argimiro Arratia , Henryk Gzyl

The paper proposes a parsimonious and flexible semiparametric quantile regression specification for asymmetric bidders within the independent private value framework. Asymmetry is parameterized using powers of a parent private value…

Econometrics · Economics 2020-09-21 Jayeeta Bhattacharya , Nathalie Gimenes , Emmanuel Guerre

Although the specific structures of electricity markets are diverse around the world, they were all conceived on the premise of predictable, controllable generation with nonnegligible marginal costs. Recent changes, specifically, the…

Computer Science and Game Theory · Computer Science 2020-12-10 Orcun Karaca

We study the problem of designing a two-sided market (double auction) to maximize the gains from trade (social welfare) under the constraints of (dominant-strategy) incentive compatibility and budget-balance. Our goal is to do so for an…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Amitai Frey , Noam Nisan

We introduce a `concrete complexity' model for studying algorithms for matching in bipartite graphs. The model is based on the "demand query" model used for combinatorial auctions. Most (but not all) known algorithms for bipartite matching…

Computational Complexity · Computer Science 2019-06-12 Noam Nisan

Lotteries are a prevalent form of gambling between a seller and buyers. Designing a lottery requires a model of how buyers make decisions when confronted with uncertain outcomes. Cumulative prospect theory (CPT) is a descriptive model that…

Computer Science and Game Theory · Computer Science 2026-05-20 Shunta Akiyama , Mitsuaki Obara , Yasushi Kawase