The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game

Author:

Vazirani Vijay V.1

Affiliation:

1. Georgia Institute of Technology, Atlanta, GA

Abstract

We introduce the notion of a rational convex program (RCP) and we classify the known RCPs into two classes: quadratic and logarithmic. The importance of rationality is that it opens up the possibility of computing an optimal solution to the program via an algorithm that is either combinatorial or uses an LP-oracle. Next, we define a new Nash bargaining game, called ADNB, which is derived from the linear case of the Arrow-Debreu market model. We show that the convex program for ADNB is a logarithmic RCP, but unlike other known members of this class, it is nontotal. Our main result is a combinatorial, polynomial-time algorithm for ADNB. It turns out that the reason for infeasibility of logarithmic RCPs is quite different from that for LPs and quadratic RCPs. We believe that our ideas for surmounting the new difficulties will be useful for dealing with other nontotal RCPs as well. We give an application of our combinatorial algorithm for ADNB to an important “fair” throughput allocation problem on a wireless channel. Finally, we present a number of interesting questions that the new notion of RCP raises.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference41 articles.

1. On Polyhedral Approximations of the Second-Order Cone

2. Birnbaum B. Devanur N. and Xiao L. 2010. New convex programs and distributed algorithms for Fisher markets with linear and spending constraint utilities. Unpublished manuscript. CSA Illumina ProQuest-CSA www.questia.com. Birnbaum B. Devanur N. and Xiao L. 2010. New convex programs and distributed algorithms for Fisher markets with linear and spending constraint utilities. Unpublished manuscript. CSA Illumina ProQuest-CSA www.questia.com.

3. Boyd S. and Vandenberghe L. 2004. Convex Optimization. Cambridge University Press Cambridge UK. Boyd S. and Vandenberghe L. 2004. Convex Optimization. Cambridge University Press Cambridge UK.

4. Brainard W. C. and Scarf H. E. 2000. How to compute equilibrium prices in 1891. Cowles Foundation Discussion Paper 1270. Brainard W. C. and Scarf H. E. 2000. How to compute equilibrium prices in 1891. Cowles Foundation Discussion Paper 1270.

Cited by 44 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3