This paper studies a dynamic assortment problem on a two-sided service platform with incomplete information and heterogeneous customers, and develops a data-driven algorithm to learn parameters and op…

This paper proposes an approximation algorithm for the submodular joint replenishment problem with decomposable submodular ordering cost functions, achieving an O(k)-approximation.

This paper presents a polynomial-time algorithm for recovering item values in the fractional knapsack problem using comparison queries, and provides a lower bound.

A simple online algorithm is presented for the stacking problem to avoid shifts with a sufficient condition involving stacking area dimension, load/unload points, and maximum items.

This paper extends the privacy subsidy concept from the single-period Kyle model to continuous time, deriving a closed-form expression for the cumulative expected transfer (privacy subsidy) in a conti…

The paper analyzes the potential market impact of a large, unknown Bitcoin holder (the Satoshi overhang) and concludes that the mechanical downside risk is bounded, suggesting the terminal states are…

The paper develops a formal theory to analyze how throughput changes in AI-enhanced cybersecurity pipelines when stage capacities are perturbed by multipliers.

The paper presents an adaptive scaling algorithm with a competitive ratio of 1.373 for incremental submodular maximization under increasing cardinality constraint, improving upon the previous best res…

The paper extends results for interval scheduling to the more general throughput problem in the real-time model with constant competitive ratios for specific weight functions and advance notice.

This paper measures the lower bound for the shortest program generating a sequence, proving a conservation law and providing a deterministic engine to recover generating programs for certain sequences…

The Sleator-Tarjan model used in competitive analysis of paging is incorrect, and this error undermines the performance predictions for online paging algorithms.

The paper refutes Steurer's conjecture regarding the existence of large constant-separated sets within families of unit-norm vectors with low average correlation, using high-dimensional expanders to s…

This paper characterizes stabilizability of stochastic dynamic matching on hypergraphs using the arrival rates and incidence matrix, and proposes a stabilizing policy.

This paper provides a theoretical analysis of Cumulative Prospect Theory (CPT) for multi-objective and multi-criteria decision-making under risk, focusing on Neilson's definitions of aversion and prop…

The paper proposes and prototypes an NFC-based inventory control system for electronic stores, leveraging NFC's superior security and reliability compared to traditional barcodes.

The paper proves that for resources with structural parallelizability (like divisibility and transferability), it is impossible to enforce a linear cost for concentrating influence, demonstrating that…

This paper identifies a tractability island inside the contextual-fraction problem by collapsing it to a fixed-point calculation for a specific class of permutation-transport models.

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.