English
Related papers

Related papers: Stochastic Choice and Optimal Sequential Sampling

200 papers

We consider a stochastic transportation problem between two prescribed probability distributions (a source and a target) over processes with general drift dependence and with free end times. First, and in order to establish a dual…

Optimization and Control · Mathematics 2019-09-12 Samer Dweik , Nassif Ghoussoub , Young-Heon Kim , Aaron Zeff Palmer

Linear diffusion processes serve as canonical continuous-time models for dynamic decision-making under uncertainty. These systems evolve according to drift matrices that specify the instantaneous rates of change in the expected system…

Machine Learning · Computer Science 2025-06-10 Mohamad Kazem Shirani Faradonbeh , Sadegh Shirani , Mohsen Bayati

This paper studies delegation in a model of discrete choice. In the delegation problem, an uninformed principal must consult an informed agent to make a decision. Both the agent and principal have preferences over the decided-upon action…

Computer Science and Game Theory · Computer Science 2024-06-25 Ali Khodabakhsh , Emmanouil Pountourakis , Samuel Taggart

We consider a controlled diffusion process $(X_t)_{t\ge 0}$ where the controller is allowed to choose the drift $\mu_t$ and the volatility $\sigma_t$ from a set $\K(x) \subset \R\times (0,\infty)$ when $X_t=x$. By choosing the largest…

Probability · Mathematics 2013-07-16 Nicole Bauerle , Erhan Bayraktar

We study the policy evaluation problem in multi-agent reinforcement learning where a group of agents, with jointly observed states and private local actions and rewards, collaborate to learn the value function of a given policy via local…

Optimization and Control · Mathematics 2021-11-08 Dongsheng Ding , Xiaohan Wei , Zhuoran Yang , Zhaoran Wang , Mihailo R. Jovanović

We consider a simulation optimization problem for a context-dependent decision-making. A Gaussian mixture model is proposed to capture the performance clustering phenomena of context-dependent designs. Under a Bayesian framework, we develop…

Methodology · Statistics 2020-12-15 Haidong Li , Henry Lam , Yijie Peng

While many multiagent algorithms are designed for homogeneous systems (i.e. all agents are identical), there are important applications which require an agent to coordinate its actions without knowing a priori how the other agents behave.…

Artificial Intelligence · Computer Science 2019-07-17 Stefano V. Albrecht , Subramanian Ramamoorthy

In this paper I present several algorithmic techniques for improving the decision process of multiple types of agents behaving in environments where their interests are in conflict. The interactions between the agents are modelled by using…

Computer Science and Game Theory · Computer Science 2009-08-04 Mugurel Ionut Andreica

Models of human behavior for prediction and collaboration tend to fall into two categories: ones that learn from large amounts of data via imitation learning, and ones that assume human behavior to be noisily-optimal for some reward…

Artificial Intelligence · Computer Science 2022-04-25 Cassidy Laidlaw , Anca Dragan

To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision variables (which we can set) and stochastic variables…

Artificial Intelligence · Computer Science 2009-03-09 Toby Walsh

Complex behaviour in many systems arises from the stochastic interactions of spatially distributed particles or agents. Stochastic reaction-diffusion processes are widely used to model such behaviour in disciplines ranging from biology to…

Statistical Mechanics · Physics 2016-08-23 David Schnoerr , Ramon Grima , Guido Sanguinetti

We consider the problem of creating assistants that can help agents solve new sequential decision problems, assuming the agent is not able to specify the reward function explicitly to the assistant. Instead of acting in place of the agent…

Machine Learning · Computer Science 2022-12-01 Sebastiaan De Peuter , Samuel Kaski

We study a model of consensus decision making, in which a finite group of Bayesian agents has to choose between one of two courses of action. Each member of the group has a private and independent signal at his or her disposal, giving some…

Statistics Theory · Mathematics 2018-04-24 Elchanan Mossel , Omer Tamuz

In a fixed budget ranking and Selection (R&S) problem, one aims to identify the best design among a finite number of candidates by efficiently allocating the given computing budget to evaluate design performance. Classical methods for R&S…

Optimization and Control · Mathematics 2024-07-11 Yuhao Wang , Enlu Zhou

In the best choice problem with random arrivals, an unknown number $n$ of rankable items arrive at times sampled from the uniform distribution. As is well known, a real-time player can ensure stopping at the overall best item with…

Probability · Mathematics 2021-03-09 Alexander Gnedin

As a schematic model of the complexity economic agents are confronted with, we introduce the ``SK-game'', a discrete time binary choice model inspired from mean-field spin-glasses. We show that even in a completely static environment,…

Statistical Mechanics · Physics 2024-08-27 Jerome Garnier-Brun , Michael Benzaquen , Jean-Philippe Bouchaud

We consider how local and global decision policies interact in stopping time problems such as quickest time change detection. Individual agents make myopic local decisions via social learning, that is, each agent records a private…

Computer Science and Game Theory · Computer Science 2012-03-05 Vikram Krishnamurthy

Quantifying uncertainties in collective human behavior and decision making is crucial for ensuring public health and safety, enabling effective disaster response, informing the design of transportation and communication networks, and…

Physics and Society · Physics 2016-12-02 Kimberly J. Schlesinger , Chantal Nguyen , Imtiaz Ali , Jean M. Carlson

We study a generalization of the secretary problem, where decisions do not have to be made immediately upon candidates' arrivals. After arriving, each candidate stays in the system for some (random) amount of time and then leaves, whereupon…

Computer Science and Game Theory · Computer Science 2019-09-20 Thomas Kesselheim , Alexandros Psomas , Shai Vardi

We study sequences, parametrized by the number of agents, of many agent exit time stochastic control problems with risk-sensitive cost structure. We identify a fully characterizing assumption, under which each of such control problem…

Optimization and Control · Mathematics 2018-08-23 Paul Dupuis , Vaios Laschos , Kavita Ramanan