Making greed work in networks: a game-theoretic analysis of switch service disciplines
暂无分享,去创建一个
[1] Aurel A. Lazar,et al. On the existence of equilibria in noncooperative optimal flow control , 1995, JACM.
[2] H. Moulin,et al. Average Cost Pricing versus Serial Cost Sharing: An Axiomatic Comparison , 1994 .
[3] Scott Shenker,et al. Learning by Distributed Automata , 1993 .
[4] Scott J. Shenker,et al. Some Technical Results on Continuity, Strategy-proofness, and Related Strategic Concepts , 1993 .
[5] S. Shenker. On the Strategy-Proof and Smooth Allocation of Private Goods in Production Economies , 1993 .
[6] H. Moulin,et al. Serial Cost Sharing , 1992 .
[7] Christos Douligeris,et al. A game theoretic perspective to flow control in telecommunication networks , 1992 .
[8] E. L. Hahne,et al. Round-Robin Scheduling for Max-Min Fairness in Data Networks , 1991, IEEE J. Sel. Areas Commun..
[9] H. Moulin. Uniform externalities: Two axioms for fair allocation , 1990 .
[10] Scott Shenker,et al. Efficient Network Allocations with Selfish Users , 1990, Performance.
[11] Scott Shenker,et al. A theoretical analysis of feedback flow control , 1990, SIGCOMM '90.
[12] H. Moulin. Joint Ownership of a Convex Technology: Comparison of Three Solutions , 1990 .
[13] K. Ramakrishnan,et al. A binary feedback scheme for congestion avoidance in computer networks , 1990, TOCS.
[14] Raj Jain,et al. A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks , 1989, CCRV.
[15] Scott Shenker,et al. Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.
[16] Donald F. Ferguson,et al. An economy for flow control in computer networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.
[17] Beverly A. Sanders,et al. An Incentive Compatible Flow Control Algorithm for Rate Allocation in Computer Networks , 1988, IEEE Trans. Computers.
[18] Beverly A. Sanders,et al. An Asynchronous, Distributed Flow Control Algorithm for Rate Allocation in Computer Networks , 1988, IEEE Trans. Computers.
[19] K. Eric Drexler,et al. Markets and computation: agoric open systems , 1988 .
[20] V. Jacobson,et al. Congestion avoidance and control , 1988, SIGCOMM '88.
[21] Aurel A. Lazar,et al. A Game Theoretic Approach to Decentralized Flow Control of Markovian Queueing Networks , 1987, Performance.
[22] Manolis Katevenis,et al. Fast switching and fair control of congested flow in broadband networks , 1987, IEEE J. Sel. Areas Commun..
[23] John B. Nagle,et al. On Packet Switches with Infinite Storage , 1987, IEEE Trans. Commun..
[24] Jean Michel Régnier. Priority assignment in integrated services networks , 1986 .
[25] H. Varian,et al. Theories of Justice Based on Symmetry , 1984 .
[26] E. Maskin. The Theory of Implementation in Nash Equilibrium: A Survey , 1983 .
[27] R. Rob. A Condition Guaranteeing the Optimality of Public Choice , 1981 .
[28] M. Satterthwaite,et al. Strategy-Proof Allocation Mechanisms at Differentiable Points , 1981 .
[29] Jeffrey M. Jaffe,et al. Bottleneck Flow Control , 1981, IEEE Trans. Commun..
[30] Edward G. Coffman,et al. A Characterization of Waiting Time Performance Realizable by Single-Server Queues , 1980, Oper. Res..