English
Related papers

Related papers: Optimal Dynamic Mechanism Design with Stochastic S…

200 papers

We consider assortment and inventory planning problems with dynamic stockout-based substitution effects, and without replenishment, in two different settings: (1) Customers can see all available products when they arrive, a typical scenario…

Optimization and Control · Mathematics 2025-01-09 Shuo Sun , Rajan Udwani , Zuo-Jun Max Shen

We consider a multi-stage stochastic optimization problem originally introduced by Cygan et al. (2013), studying how a single server should prioritize stochastically departing customers. In this setting, our objective is to determine an…

Data Structures and Algorithms · Computer Science 2022-09-29 Danny Segev

We study a decision-maker's problem of finding optimal monetary incentive schemes for retention when faced with agents whose participation decisions (stochastically) depend on the incentive they receive. Our focus is on policies constrained…

Computer Science and Game Theory · Computer Science 2024-07-31 Daniel Freund , Chamsi Hssaine

The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variation of the model has become a basic tool in studying problems…

Pricing of Securities · Quantitative Finance 2008-12-02 Grace Lin , Yingdong Lu , David Yao

We consider a manufacturing plant that purchases raw materials for product assembly and then sells the final products to customers. There are M types of raw materials and K types of products, and each product uses a certain subset of raw…

Optimization and Control · Mathematics 2010-04-06 Michael J. Neely , Longbo Huang

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 study Bayesian automated mechanism design in unstructured dynamic environments, where a principal repeatedly interacts with an agent, and takes actions based on the strategic agent's report of the current state of the world. Both the…

Computer Science and Game Theory · Computer Science 2021-05-14 Hanrui Zhang , Vincent Conitzer

Recently, there is growing interest and need for dynamic pricing algorithms, especially, in the field of online marketplaces by offering smart pricing options for big online stores. We present an approach to adjust prices based on the…

Optimization and Control · Mathematics 2021-01-13 David Müller , Yurii Nesterov , Vladimir Shikhman

When sales of a product are affected by randomness in demand, retailers can use dynamic pricing strategies to maximise their profits. In this article the pricing problem is formulated as a stochastic optimal control problem, where the…

Optimization and Control · Mathematics 2017-10-17 Asbjørn N. Riseth , Jeff N. Dewynne , Chris L. Farmer

A dynamic treatment regime is a sequence of medical decisions that adapts to the evolving clinical status of a patient over time. To facilitate personalized care, it is crucial to assess the probability of each available treatment option…

Methodology · Statistics 2024-11-05 Jiefeng Bi , Matteo Borrotti , Bernardo Nipoti

An indivisible object may be sold to one of $n$ agents who know their valuations of the object. The seller would like to use a revenue-maximizing mechanism but her knowledge of the valuations' distribution is scarce: she knows only the…

Theoretical Economics · Economics 2020-08-27 Alex Suzdaltsev

One of the most celebrated results in mechanism design is Myerson's characterization of the revenue optimal auction for selling a single item. However, this result relies heavily on the assumption that buyers are indifferent to risk. In…

Computer Science and Game Theory · Computer Science 2018-10-08 Evdokia Nikolova , Emmanouil Pountourakis , Ger Yang

Multi-item revenue-optimal mechanisms are known to be extremely complex, often offering buyers randomized lotteries of goods. In the standard buy-one model, it is known that optimal mechanisms can yield revenue infinitely higher than that…

Computer Science and Game Theory · Computer Science 2022-11-22 Sepehr Assadi , Vikram Kher , George Li , Ariel Schvartzman

The combination of electric vehicles (EVs) and renewable energy is taking shape as a potential driver for a future free of fossil fuels. However, the efficient management of the EV fleet is not exempt from challenges. It calls for the…

Optimization and Control · Mathematics 2013-10-28 Emil B. Iversen , Juan M. Morales , Henrik Madsen

We propose and solve a stochastic dynamic programming (DP) problem addressing the optimal provision of regulation service reserves (RSR) by controlling dynamic demand preferences in smart buildings. A major contribution over past dynamic…

Systems and Control · Computer Science 2017-07-26 Bowen Zhang , Michael C. Caramanis , John Baillieul

This paper proposes a two-step framework for techno-economic analysis of a demand-side flexibility service in distribution networks. Step one applies optimization-based modelling to propose a generic problem formulation which determines the…

Systems and Control · Electrical Eng. & Systems 2022-01-10 Timur Sayfutdinov , Charalampos Patsios , David Greenwood , Meltem Peker , Ilias Sarantakos

Proceeding from the concept of rational expectations, a new dynamic model of supply and demand in a single market with one supplier, one buyer, and one kind of commodity is developed. Unlike the cob-web dynamic theories with adaptive…

General Physics · Physics 2007-05-23 V. Granik , A. Granik

Using duality theory techniques we derive simple, closed-form formulas for bounding the optimal revenue of a monopolist selling many heterogeneous goods, in the case where the buyer's valuations for the items come i.i.d. from a uniform…

Computer Science and Game Theory · Computer Science 2015-10-14 Yiannis Giannakopoulos

The note studies the problem of selecting a good enough subset out of a finite number of alternatives under a fixed simulation budget. Our work aims to maximize the posterior probability of correctly selecting a good subset. We formulate…

Optimization and Control · Mathematics 2023-05-09 Gongbo Zhang , Bin Chen , Qing-shan Jia , Yijie Peng

We consider markets consisting of a set of indivisible items, and buyers that have {\em sharp} multi-unit demand. This means that each buyer $i$ wants a specific number $d_i$ of items; a bundle of size less than $d_i$ has no value, while a…

Computer Science and Game Theory · Computer Science 2015-03-13 Ning Chen , Xiaotie Deng , Paul. W. Goldberg , Jinshan Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›