New algorithm SELECT minimizes satisficing regret in bandits.
problem Minimizing regret in bandit optimization with satisficing arms.
method SELECT algorithm for satisficing regret minimization.
result SELECT achieves constant expected satisficing regret.
Satisficing is a relaxation of maximizing and allows for less risky decision making in the face of uncertainty. We propose two sets of satisficing objectives for the multi-armed bandit problem, where the objective is to achieve reward-based decision-making performance above a given threshold. We show that these new pro…
New algorithm learns satisficing behaviors more efficiently in complex environments.
problem Intractability of optimal exploration in complex environments.
method Extends a deep reinforcement learning agent to learn satisficing policies without model-based planning.
result Demonstrates efficient learning of satisficing behaviors and optimal behaviors when feasible.
Study shows nonstationary bandits require T-dependent regret even with minimal nonstationarity.
problem Understanding satisficing regret in nonstationary multi-armed bandits.
method Developed a novel Fano-based framework for nonstationary bandits with a post-interaction reference construction.
result Optimal regret scales with T even with minimal nonstationarity, contrasting with stationary case.
New algorithm optimizes beam and rate allocation in mmWave systems for multiple users.
problem Optimizing beam and rate allocation in mmWave systems for multiple users with limited feedback.
method Introducing SAT-CTS, a combinatorial semi-bandit policy with satisficing objective.
result SAT-CTS achieves finite-time regret bounds and reduces satisficing regret in mmWave systems.
This paper analyzes statistical properties of the Robust Satisficing model.
problem Lack of statistical theory for the Robust Satisficing model.
method Comprehensive analysis of statistical properties, including confidence intervals and generalization error bounds.
result Established two-sided confidence intervals and finite-sample generalization error bounds for the RS optimizer.
Paper formalizes Simon's satisficing through FFSD, proving its equivalence to expected utility theory.
problem Formalizing Herbert Simon's bounded rationality concept in economic decision-making.
method Developed FFSD framework using Lean 4 theorem prover, proving equivalence to expected utility theory.
result Equivalence theorem linking FFSD to expected utility maximization for approximate indicator functions.
We propose an computational framework for real-time risk assessment and prioritizing for random outcomes without prior information on probability distributions. The basic model is built based on satisficing measure (SM) which yields a single index for risk comparison. Since SM is a dual representation for a family of r…
Semi-analytical approach for optimal wealth management contributions.
problem Optimizing contributions to achieve a financial goal with uncertain returns.
method Controlled backward Kolmogorov equation and Schrodinger equation solution.
result Semi-analytical solutions for efficient frontiers in control space.
New algorithms optimize decision-making under uncertainty with graph information.
problem Optimizing decisions in large, uncertain environments with graph-based similarities.
method Graph-based UcB and ζ-UcB algorithms for maximizing and satisficing.
result Proves algorithms are near-optimal and benefits from graph side information.
Formula derived for blow-up of quaternionic maps on Hyperkähler manifolds.
problem Analyzing the behavior of quaternionic maps near singularities.
method Deriving a blow-up formula for the limit of weakly converging quaternionic maps.
result A blow-up formula for the limit of quaternionic maps is derived.
We consider a multiobjective multiarmed bandit problem with lexicographically ordered objectives. In this problem, the goal of the learner is to select arms that are lexicographic optimal as much as possible without knowing the arm reward distributions beforehand. We capture this goal by defining a multidimensional for…
New insights into optimal portfolios and ecological equilibria reveal surprising complexity.
problem Optimal portfolio construction with ecological constraints.
method Computational analysis of multispecies Lotka-Volterra equations with unit rank interaction matrices.
result Logarithm of the average number of solutions grows as \(N^{2/3}\), with most likely solutions being much smaller.
The paper addresses human-like decision-making in multi-agent systems using bounded risk-sensitive Markov Games.
problem Modeling human-like decision-making in multi-agent systems with risk-seeking and loss-aversion behaviors.
method Forward policy design and inverse reward learning with iterative reasoning and cumulative prospect theory.
result The proposed algorithms demonstrate both risk-averse and risk-seeking behaviors in multi-agent systems.
Paper argues the bear case for Bitcoin is bounded and terminal states are neutral to positive.
problem The identity of Bitcoin's creator and the associated overhang risk.
method Quantitative analysis of Satoshi's 1.148 million BTC position, considering various preference sets.
result The terminal states most consistent with observed behavior are neutral to slightly positive for Bitcoin's effective supply.