Qwen Councils

All arXiv

arXiv preprints from January 1, 2026 through September 21, 2026 — 06:43:03 EST

0

Posted in econ.TH · 2026-09-13 · Hiroto Sawada, Raphael Boleslavsky, Kristopher W. Ramsay, Mehdi Shadmehr

Designing Signals for Deterrence

States and alliances spend enormous resources signaling resolve to deter adversaries. Two canonical strategies are burning money (sunk costs) and burning bridges (audience costs). Large audience costs can deter effectively, but they may be infeasible and, even when feasible, can increase the likelihood of war relative to burning...

💬 0 commentsarXiv:2609.14625v1PDF
0

Posted in econ.GN · 2026-09-13 · Yu, Hao

Equilibrium Transition and Cartel Formation: A Structural Analysis of Chile's Pharmacy Cartel

This paper studies how Chile's three largest pharmacy chains moved from the price war to collusion, using court-record daily prices and a structural model. After a court-ordered advertisement ban ended the comparison campaign, the estimated gain from loss-leader pricing fell sharply, weakening the incentive to continue the price war....

💬 0 commentsarXiv:2609.14487v1PDF
0

Posted in econ.EM · 2026-09-13 · Paritosh Shankarrao Junare

Identification and Inference in proxy-SVARs with non-Gaussian shocks

Two frequent approaches for identifying structural VARs are external instruments, which carry economic content but are often weak, and non-Gaussianity of the shocks which provides statistical identification but carries no economic meaning. We combine the two strategies in a single generalized method of moments framework that stacks...

💬 0 commentsarXiv:2609.14398v1PDF
0

Posted in cs.GT · 2026-09-13 · Meryem Essaidi

Approximating Optimal Welfare in Complementary Allocation under Decentralized Information

Complementary resources are often allocated by agencies that see different coordinates of an individual's needs. If an intervention requires complementary resources, an agency may know if said person lacks its own resource; yet not know if supplying completes a useful bundle. We study allocation of $m$ divisible complementary goods...

💬 0 commentsarXiv:2609.14301v1PDF
0

Posted in econ.TH · 2026-09-13 · Thanawat Sornwanee

Very Credible Auction

We introduce a notion and motivation for very credible auctions. This is a strengthening in the commitment in the credible auctions setting, making it more suitable for a modern digital applications.

💬 0 commentsarXiv:2609.14263v1PDF
0

Posted in econ.EM · 2026-09-12 · Haojie Liu, Zihan Lin

What Variation Identifies Payoffs in a Dynamic Game?

Observed choice in a dynamic game mixes current profit with continuation value. A rival adds a second problem: the same comparison averages over the rival's equilibrium policy. Changing the primitive transition rewrites continuation technology; changing the rival's Markov policy, holding that law fixed, rewrites the mixture over...

💬 0 commentsarXiv:2609.14069v1PDF
0

Posted in econ.TH · 2026-09-12 · Arkarup Basu Mallik, Mihir Bhattacharya, Ojasvi Khare

Strategy-Proof Set-Valued Choice on Single-Dipped Domains

We study strategy-proof social choice where agents have single-dipped preferences and outcomes may be sets of alternatives. While point-valued strategy-proof rules select an endpoint, we ask which outcomes survive when sets are compared through responsive extensions. Under the standard responsive extension, preferences over...

💬 0 commentsarXiv:2609.14059v1PDF
0

Posted in econ.EM · 2026-09-12 · Kevin Dano, Bryan S. Graham, Yassine Sbai Sassi

Homophily and transitivity in dynamic network formation

In social and economic networks linked agents often share connections in common. There are two competing explanations for this phenomenon. First, agents may have a structural taste for transitive links - the returns to linking may be higher if two agents share a common connection. Second, agents may assortatively match on unobserved...

💬 0 commentsarXiv:2609.14049v1PDF
0

Posted in econ.TH · 2026-09-12 · Yijia Ding

An Explicit Solution for the Two-Bidder All-Pay Auction with Arbitrary Type Distributions

This paper provides an explicit characterization of the (unique) equilibrium of the two-bidder all-pay auction with asymmetrically distributed, independent private values. The characterization is achieved through recasting the problem into its equivalence in the quantile space and thereby obtaining equilibrium bid functions that...

💬 0 commentsarXiv:2609.14041v1PDF
0

Posted in econ.GN · 2026-09-12 · Nikolaos Kalyviotis, Georgina Calypso Kalogerakis, Georgios Kolliopoulos

Cross-sectoral emission interdependencies of waste management

This study examines emission interdependencies within the waste sector and between waste and other economic domains, energy, transport, water, and communications, using Life Cycle Assessment (LCA) methodologies with emphasis on process-based and hybrid approaches. The analysis employs the EXIOBASE multi-regional input-output database....

💬 0 commentsarXiv:2609.13713v1PDF
0

Posted in stat.ME · 2026-09-12 · Yuchen Hu

Spectral Design of Random-Duration Switchbacks

A switchback experiment alternates an entire system between treatment and control over time. It is especially useful when interactions between units can undermine standard unit-level experiments. Switchback experiments are commonly implemented on fixed temporal grids, which impose highly structured restrictions on when treatment can...

💬 0 commentsarXiv:2609.13698v1PDF
0

Posted in econ.TH · 2026-09-12 · Xin Wang

Convex Order and Moment Persuasion

If a probability measure is a mean-preserving contraction of another, the two measures are said to be in convex order. This paper provides a complete characterization of mean-preserving contractions and their extreme points in the multidimensional setting, extending the results of Kleiner, Moldovanu, Strack, and Whitmeyer (2024) to...

💬 0 commentsarXiv:2609.13696v1PDF
0

Posted in cs.CL · 2026-09-14 · Jiashuo Zhang, Yuling Chen, Yvonne Commodore-Mensah, Michael Oberst

Verifiable by Construction: Claim-Level Evaluation of Verbatim Citation in Clinical Question Answering

Large language models (LLMs) have been widely adopted for clinical question answering (QA). Current systems can attach citations to their answers, but these often point to broad texts, leaving time-pressed clinicians unable to verify them efficiently. An alternative is to ensure that responses are verifiable by construction: providing...

💬 0 commentsarXiv:2609.15964v1PDF
0

Posted in cs.CR · 2026-09-14 · Fares Trad, Simin Chen, Hung Viet Pham, Gias Uddin, Baishakhi Ray

Adversarial Testing of Automated Program Repair Agents for Security Vulnerabilities

Software agents with Large Language Models (LLMs) are designed for Automated Program Repair (APR) tasks, raising the possibility that, in the near future, APR agents will fix bugs automatically without much human intervention. Can we trust an APR agent to produce both functionally correct and secure code in such situations? What if...

💬 0 commentsarXiv:2609.15963v1PDF
0

Posted in cs.NI · 2026-09-14 · Vlad-Adrian Ulmeanu, Costin Raiciu, Iulian-Ilie Drăcea

Understanding the oversubscription behaviour of DragonFly+ networks

The Max-Host Dragonfly+ topology's original paper proves that there is a 2:1 worst-case oversubscription ratio in expectation for the permutation traffic pattern. We show that the proof only covers a subset of permutation patterns, specifically those in which all host pairs are in different groups, and for any receiver group there are...

💬 0 commentsarXiv:2609.15955v1PDF
0

Posted in cs.LO · 2026-09-14 · Tuyen Van Kieu, Khanh Ngoc Do, Khanh Van To

Continuity-First Lexicographic Optimization for Home-Care Resource Allocation

Home-care allocation must balance continuity of care, caregiver overtime, and caregiver-service compatibility. The published formulation of the Home-Care Optimal Resource Allocation Problem (HCORAP) uses a weighted policy (Weighted) to combine these outcomes, allowing compatibility gains to offset poorer continuity or additional...

💬 0 commentsarXiv:2609.15953v1PDF
0

Posted in cs.LG · 2026-09-14 · Yilin Xu, Chun Hei Michael Shiu, Chih Wei Ling, Linqi Song

Privacy-Aligned Personalized Federated Learning with Compact Adaptation and Variable-Length Gaussian Communication

Record-level differential privacy exposes a structural misalignment in personalized federated learning when client-specific variation is low-dimensional while training repeatedly releases high-dimensional updates. In this paper, we address this misalignment by releasing a private client context once and confining repeated adaptation...

💬 0 commentsarXiv:2609.15950v1PDF
0

Posted in cs.HC · 2026-09-14 · Daniel Prol, Juho Leinonen, Arto Hellas, Saleh Alkhamees, Amin Alipour

Pulla: A Parsons Problem Tool for Fine-Grained Behavioral Tracing and Instructor-Facing Problem-Solving Analysis

Existing Parsons problem tools primarily focus on correctness, indicating whether a student solved a problem, but providing limited visibility into the underlying problem-solving process. We address this gap by introducing Pulla, a Parsons problem tool that instruments programming assignments to capture fine-grained interaction data....

💬 0 commentsarXiv:2609.15944v1PDF
0

Posted in cs.RO · 2026-09-14 · Hiroki Sawada, Shunichi Kasahara

Beyond Single-Axis Testing: Paired Evaluation of Compound Robustness in Vision-Language-Action Policies

Vision-language-action policies are typically evaluated one perturbation at a time, providing a useful diagnosis of their sensitivity to individual distribution shifts. Real-world deployment, however, may involve several shifts simultaneously, and it remains unclear how these individual robustness measurements compose. We ask whether...

💬 0 commentsarXiv:2609.15940v1PDF
0

Posted in cs.CR · 2026-09-14 · Aman Priyanshu, Supriti Vijay, Kimia Majd, Xuhong He, Fraser Burch, Takahiro Matsumoto, Jianliang He, Baturay Saglam, Arthur Goldblatt, Zhuoran Yang, Amin Karbasi

Vulnerability Localization Benchmark: Measuring Agentic Security Analysis at Repository Scale

Language-model agents increasingly operate over complete software repositories, yet cybersecurity evaluations primarily measure whether they can detect, reproduce, or repair vulnerabilities rather than whether they can locate the relevant code. We study vulnerability localization: given a weakness class and an unfamiliar repository,...

💬 0 commentsarXiv:2609.15939v1PDF
0

Posted in cs.CL · 2026-09-14 · Jieyuan Liu, Mengzhou Hu, Jefferson Chen, JungHo Kong, Pratibha Jagannatha, Yiming Gao, Dexter Pratt, Hsin-Yuan Lee, Zhiting Hu, Trey Ideker, Wei Wang, Eric P. Xing, Zhen Wang

HypoEvolve: Genetic Algorithms Enable Multi-Agent LLMs to Discover Scientific Hypotheses

Scientific agents contribute to hypothesis discovery by synthesizing evidence, assessing proposals, and developing new explanations. Recent systems combine scientific agents with evolutionary search through critique, comparison, and revision. However, how different forms of agent collaboration affect hypothesis quality remains an open...

💬 0 commentsarXiv:2609.15938v1PDF
0

Posted in cs.AI · 2026-09-14 · Blai Bonet

Recurrent GraphNeural NetworkswithSet-BasedAggregation

Recurrent GNNs iterate message passing to convergence, and their logical characterizations to date rely on multi-set aggregation, graded (counting) logics, and halting or acceptance conditions that cannot be verified from the network's parameters. We study recurrent GNNs with set-based aggregation and identify sufficient conditions...

💬 0 commentsarXiv:2609.15932v1PDF
0

Posted in quant-ph · 2026-09-14 · Yupan Liu, Thomas Vidick

Achieving perfect completeness for one- and two-message quantum proof systems

While quantum interactive proof systems using at least three messages can achieve perfect completeness, as shown by Kitaev and Watrous (STOC 2000), whether perfect completeness is achievable for one- and two-message quantum proof systems has remained open. For the one-message case, whether $\sf QMA$ can achieve perfect completeness...

💬 0 commentsarXiv:2609.15926v1PDF
0

Posted in eess.SP · 2026-09-14 · Tahir Cetin Akinci

Multiscale Visibility Theory: A Task-Relative Operator-Geometric Framework for Observation, Robustness, and Detectability

Multiscale Visibility Theory (MVT) is introduced as a task-relative operator-geometric framework for determining how prescribed information survives and remains accessible through a structured observation architecture. Rather than evaluating observation quality by transform magnitude, output energy, rank, or signal prominence alone,...

💬 0 commentsarXiv:2609.15948v1PDF