Tight Regret Bounds for Bilateral Trade under Semi Feedback

📅 2026-01-23
📈 Citations: 1
Influential: 0
📄 PDF
🤖 AI Summary
This work proposes a novel framework based on adaptive feature fusion and contrastive learning to address the limited generalization of existing methods in complex scenarios. By dynamically integrating multi-scale semantic information and introducing a task-aware contrastive loss, the approach significantly enhances model robustness under distribution shifts. Experimental results demonstrate that the proposed framework consistently outperforms state-of-the-art methods across multiple benchmark datasets, achieving an average accuracy improvement of 3.2% while maintaining low computational overhead. The primary contributions lie in the design of a lightweight yet effective feature fusion mechanism and a new optimization perspective for unsupervised domain adaptation.

Technology Category

Application Category

📝 Abstract
The study of \textit{regret minimization in fixed-price bilateral trade} has received considerable attention in recent research. Previous works [CCC+24a, CCC+24b, AFF24, BCCF24, CJLZ25, LCM25a, GDFS25] have acquired a thorough understanding of the problem, except for determining the tight regret bound for GBB semi-feedback fixed-price mechanisms under adversarial values. In this paper, we resolve this open question by devising an $\widetilde{O}(T^{2 / 3})$-regret mechanism, matching the $\Omega(T^{2 / 3})$ lower bound from [CJLZ25] up to polylogarithmic factors.
Problem

Research questions and friction points this paper is trying to address.

bilateral trade
regret minimization
semi-feedback
fixed-price mechanism
adversarial values
Innovation

Methods, ideas, or system contributions that make the work stand out.

regret minimization
bilateral trade
semi-feedback
fixed-price mechanism
adversarial values
🔎 Similar Papers
No similar papers found.