~ similar to 2606.13980· 19 results
This paper introduces a new variant of the Traveling Salesman Problem where the goal is to find two paths connecting a set of sites while minimizing the Fréchet distance between the two paths.
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 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 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…
The paper establishes that finding approximate Hylland-Zeckhauser equilibria (a type of market allocation) is computationally hard, specifically showing it is PPAD-hard under certain complexity assump…
This paper analyzes the trade-offs between privacy, efficiency, and targeting precision in aid allocation systems by studying private variants of both individual and unit-level allocation strategies.
Willie Kouam, Stefan Rass, Zahra Seyedi, Shahzad Ahmad +1 more
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 settles the complexity of three sketching problems in graphs and distributions.
The paper develops a unified theoretical framework to systematically characterize the optimal privacy-utility trade-off (PUT) and optimal Local Differential Privacy (LDP) channels for general statisti…
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 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 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 proposes DNQ, a scalable solver-in-the-loop framework for training agents in multi-turn simultaneous bidding games by leveraging pairwise payoff estimation to approximate complex equilibrium…
The paper introduces the Markov decision contest, a new framework for reinforcement learning using pairwise preferences, and proves that stationary Markov policies are optimal and solvable efficiently…
Ting Hou, Yanhao Wang, Yiping Wang, Cen Chen +2 more
This paper addresses the challenging problem of multi-objective submodular maximization under a cardinality constraint while ensuring differential privacy, proposing novel algorithms with approximatio…
The paper simulates bargaining scenarios using LLM agents to analyze how optimizing agents for financial profit affects their honesty and trust, finding that while fine-tuning improves deal-making, it…
This paper analyzes differential privacy auditing as a bilevel game, showing that naive audit designs fail to detect true harm when developers strategically respond, and proposes an optimal, single-le…
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…
The paper systematically studies the trade-offs between the number of slopes, bends per edge, and required area for planar drawings of bounded-degree graphs, providing new constructions for high-degre…