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…

The paper introduces a novel public key encryption scheme with high security by leveraging the conjectured intractability of two types of highly corrupted constraint satisfaction problems (CSPs).

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…

This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…

The paper addresses the failure of fixed-price inference in resource-constrained pricing controllers by developing a target-aware controller that tracks local densities and provides certified, shrinki…

This paper analyzes the bid-ask spread and welfare in the Glosten-Milgrom model when the market maker observes a noisy, privacy-protected trade direction signal, deriving a specific 'privacy subsidy'…

The paper introduces Global PSRO, a novel deep reinforcement learning framework that efficiently approximates Nash equilibria in large two-player zero-sum games by intelligently expanding the strategy…

The paper models latent worker preferences in gig labor markets using the Preisach hysteresis model, demonstrating that predicting acceptance rates can simultaneously reduce labor costs and increase s…

The paper introduces a method to efficiently detect 'essential' constraints in Boolean MinCSPs, significantly reducing the search space for solving these problems and providing a dichotomy theorem for…

This paper presents a quantum attack on Module-LWE based lattice schemes like ML-KEM, demonstrating a polynomial-time quantum algorithm with a high success probability.

The paper introduces and explores Truly Linear FPT (TLFPT), a complexity class defined by $O(n) + f(k)$, demonstrating that it is a strict subset of standard Linear FPT and providing new algorithms fo…

This paper settles the complexity of three sketching problems in graphs and distributions.

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 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 demonstrates that the classical discrete Laplace mechanism can be post-processed to create versatile, unbiased estimators for various subexponential functions, making it a preferred choice…

The paper provides a tight, transparent, and closed-form analysis of the trade-off function for Differentially Private SGD using random shuffling, significantly improving upon previous methods and est…

The paper derives the unique linear Kyle equilibrium and identifies a closed-form 'privacy subsidy'—the break-even fee—for cryptocurrency exchanges that use Gaussian noise to obscure order flow.

The paper models cryptographic hybridization as a Stackelberg game where the defender optimizes algorithm selection against a resource-constrained attacker who performs conditional optimization.

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…