Strategic properties of heterogeneous serial cost sharing
暂无分享,去创建一个
[1] Hervé Moulin,et al. Rationing a Commodity Along Fixed Paths , 1998 .
[2] Haim Mendelson,et al. Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue , 1990, Oper. Res..
[3] H. Moulin,et al. Serial Cost Sharing , 1992 .
[4] Eric J. Friedman,et al. Three Methods to Share Joint Costs or Surplus , 1999 .
[5] S. Shenker. On the Strategy-Proof and Smooth Allocation of Private Goods in Production Economies , 1993 .
[6] Eric J. Friedman,et al. Strong monotonicity in surplus sharing , 2004 .
[7] H. Moulin,et al. Average Cost Pricing versus Serial Cost Sharing: An Axiomatic Comparison , 1994 .
[8] H. Moulin. Incremental cost sharing: Characterization by coalition strategy-proofness , 1999 .
[9] Yves Sprumont. Coherent Cost-Sharing Rules , 2000, Games Econ. Behav..
[10] Herve C. Moulin,et al. Incremental Cost Sharing: Characterization by Strategy Proofness , 1995 .
[11] Scott Shenker,et al. Making greed work in networks: a game-theoretic analysis of switch service disciplines , 1994 .
[12] Scott Shenker,et al. Making greed work in networks: a game-theoretic analysis of switch service disciplines , 1995, TNET.
[13] Yves Sprumont. Ordinal Cost Sharing , 1998 .
[14] Scott Shenker,et al. Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.
[15] Jr. Shaler Stidham. Pricing and capacity decisions for a service facility: stability and multiple local optima , 1992 .
[16] José Alcalde,et al. A Procedure For Sharing Recycling Costs , 2000 .
[17] Eric J. Friedman,et al. Learning and Implementation on the Internet , 1997 .
[18] Paul R. Milgrom,et al. Adaptive and sophisticated learning in normal form games , 1991 .
[19] Eric J. Friedman,et al. Short run dynamics of multi-class queues , 1993, Oper. Res. Lett..
[20] Scott Shenker,et al. Efficient Network Allocations with Selfish Users , 1990, Performance.