arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.11186cs.MAcs.AImath.OC
收藏

基于比较的梯度估计的顺序资源交易

Sequential Resource Trading Using Comparison-Based Gradient Estimation

The University of Texas at Austin(德克萨斯大学奥斯汀分校)

Surya Murthy, Mustafa O. Karabag, Ufuk Topcu

AI总结:

本文研究了两个贪心理性代理在有限资源类别中进行顺序多议题交易的问题,提出基于比较的算法通过接受/拒绝反馈估计对方梯度,确保交易互惠并最终收敛到帕累托前沿。

摘要:

我们研究了两个贪心理性代理在有限资源类别中进行顺序多议题交易的问题。每个代理的效用取决于其分配,但提供方不知道对方的效用函数,仅接收接受或拒绝反馈。我们提出一种基于比较的算法,将接受和拒绝反馈解释为状态比较,使提供方能够迭代估计对方的梯度。被拒绝的报价会修剪可行梯度方向的空间,从而系统性地优化可能的互利交易。该算法保证每次接受的交易都会严格提高双方的效用,并在有限次被拒绝报价后,要么识别出互利交易,要么证明当前分配是弱帕累托最优。我们进一步证明,在温和假设下,接受的交易序列最终收敛到帕累托前沿。我们评估了该方法相对于标准基线的表现,显示其在多个交易场景中以更少的报价实现更高的社会效益。我们进一步在用户研究中验证了该方法,证明其在资源冲突显著的场景中表现优异。

英文摘要:

We study sequential multi-issue trading between two greedily rational agents who exchange resources from a finite set of categories. Each agent's utility depends on its allocation, but the offering agent does not know the responding agent's utility function and receives only accept or reject feedback. We propose a comparison-based algorithm that interprets acceptance and rejection responses as pairwise state comparisons, allowing the offering agent to iteratively estimate the responding agent's gradient. Rejected offers prune the space of feasible gradient directions, enabling systematic refinement of possibly mutually beneficial trades. The algorithm guarantees that each accepted trade strictly improves both agents' utilities and, after finitely many rejected offers, either identifies a mutually beneficial trade or certifies that the current allocation is weakly Pareto optimal. We further show that the sequence of accepted trades asymptotically converges to the Pareto front under mild assumptions. We evaluate the method against standard baselines and show that it achieves higher societal benefit with fewer offers across multiple trading settings. We further validate the approach in a user study, demonstrating strong performance in scenarios with substantial resource conflict.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑