Posted price profit maximization for multicast by approximating fixed points

被引:1
作者
Mehta, A [1 ]
Shenker, S
Vazirani, VV
机构
[1] Georgia Inst Technol, Coll Comp, Atlanta, GA 30332 USA
[2] ICSI, Berkeley, CA 94704 USA
来源
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 2006年 / 58卷 / 02期
基金
美国国家科学基金会;
关键词
Multicasting;
D O I
10.1016/j.jalgor.2004.08.002
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We describe an iterative fixed point approach for the following stochastic optimization problem: given a multicast tree and probability distributions of user utilities. find in optimal posted price mechanism-i.e., compute prices to offer the users in order to maximize the expected profit of the service provider. We show that any optimum pricing is a fixed point of an efficiently computable function. We can then apply the non-linear Jacobi and Gauss-Seidel methods of coordinate descent. We provide proof of convergence to the optimum prices for special Cases of utility distributions and tree edge costs. (C) 2004 Elsevier Inc. All rights reserved.
引用
收藏
页码:150 / 164
页数:15
相关论文
共 16 条
  • [1] Bierlaire M, 2001, PROC SWISS TRANSPORT
  • [2] Bottom J., 1998, TRIST 3 C SAN JUAN P
  • [3] THE SIMPLE ECONOMICS OF OPTIMAL AUCTIONS
    BULOW, J
    ROBERTS, J
    [J]. JOURNAL OF POLITICAL ECONOMY, 1989, 97 (05) : 1060 - 1090
  • [4] DEERING S, 1994, SIGCOMM 94 S
  • [5] MULTICAST ROUTING IN DATAGRAM INTERNETWORKS AND EXTENDED LANS
    DEERING, SE
    CHERITON, DR
    [J]. ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1990, 8 (02): : 85 - 110
  • [6] ELDEN L, 1990, WITTMEYER KOCH NUMER
  • [7] FIAT A, 2002, ACM S THEORY COMP
  • [8] GOLDBERG A, 2001, COMPETITIVE AUCTIONS
  • [9] JAIN K, 2001, ACM S THEOR COMP
  • [10] KLEINBERG J, 1997, ACM S THEOR COMP