Lazar A A and Semret N. Design and analysis of the progressive second price auction for network bandwidth sharing. Submitted to Telecommunications Systems, Special Issue on Internet Economics, to appear in 1999 (Technical report 487-98-21 contains this plus topology extensions at http://comet.columbia.edu/~nemo/work.html). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A General Auction-based Architecture - For Resource Allocation (Correct)
....two multiunit auction schemes. One is a revised English auction (First Price auction) Another is Progressive Second Price This list may be expressed compactly as a begin and end time for usage for CPU scheduling and Time Division Multiple Access (TDMA) bandwidth allocation. PSP) auction [12]. When we describe these two mechanisms, we use the following assumptions. Given a quantity Q of a resource and a set of bidders I = f1; Ig, bidder i s bid is s i = q i ; p i ) 2 S = 0; Q] 0; 1) meaning she would like a quantity q i at a unit price p i . A bid profile is s = s 1 ; ....
A. A. Lazar and N. Semret, "Design and Analysis of the Progressive Second Price Auction for Network Bandwidth Sharing ", Telecommunications Systems, Special Issue on Network Economics, to appear.
Coalitional Games on Graphs: Core Structure, Substitutes .. - Garg, Kumar, Rudra.. (2002) (Correct)
....and compete. Game theory has emerged as an important tool to understand the complex interplay of the interests of these autonomous agents, and thus model and analyze the architecture and the functioning of the Internet [26, 18, 27, 29, 12] Ideas from game theory have been used to design protocols [18, 20, 11, 29] and to gain insights into basic computer science problems [23, 1, 3, 21] Some of the application areas that have received extensive interest include problems relating to routing protocols for networks [27] such as congestion control[29, 12] bandwidth pricing [20] multicasting [11] and design ....
.... to design protocols [18, 20, 11, 29] and to gain insights into basic computer science problems [23, 1, 3, 21] Some of the application areas that have received extensive interest include problems relating to routing protocols for networks [27] such as congestion control[29, 12] bandwidth pricing [20], multicasting [11] and design of auction mechanisms for various settings [5, 17, 23] When the interaction of autonomous agents and con icting interests is modelled as a game, the possible outcomes depend on the preferences of the agents as well as the structure of the game. The eld of ....
Lazar and Semret, \ Design and Analysis of the Progressive Second Price Auction for Network Bandwidth Sharing", in Telecommunications Systems, Special Issue on Network Economics, to appear.
A SLA Framework for QoS Provisioning and Dynamic Capacity.. - Garg, Randhawa, Huzur (2002) (1 citation) (Correct)
.... in defining Quality of Service (QoS) of a resource serving multiple users [9] 2] and designing mechanisms to provide the QoS [23] 2] 31] 10] 30] 28] 1] Similarly, there is a significant body of research literature designing pricing policies for the usage of these resources [20] [22], 21] 6] 24] 25] Much of this research remains unused in practice because of lack of QoS demands from users, lack of willingness of service providers to adapt complex pricing mechanisms, and the missing link between the QoS, service level agreements (SLAs) and This work was done when ....
A. Lazar and N. Semret. Design and analysis of the progressive second price auction for network bandwidth sharing. Telecommunication Systems: Special issue on Network Economics, 1999.
Spot and Derivative Markets in Admission Control - Semret, Lazar (1999) (3 citations) Self-citation (Lazar Semret) (Correct)
No context found.
A. A. Lazar and N. Semret. Design and analysis of the progressive second price auction for network bandwidth sharing. Telecommunication Systems # Special issue on Network Economics, 1999. Available as Tech. Rep. CU#CTR#TR 497-98-21.
Market Mechanisms for Network Resource Sharing - Semret (1999) (3 citations) Self-citation (Semret) (Correct)
.... approach extends the classic work of Vickrey [93] and is related to Clarke Groves mechanisms [15, 28] The design is then analyzed as a strategic game 13 of complete information, where the solution concept is that of the Nash equilibrium [70] Most of our results of Chapters 2 and 3 appeared in [58, 59, 85, 86]. In Chapter 4, the key building blocks are a heavy traffic approximation to derive a diffusion model of the queueing system inspired by [37, 9] and the classic stochastic differential equation approach to option pricing pioneered by MertonBlack Scholes [8, 65] Results from Chapter 4 appear in ....
A. A. Lazar and N. Semret. Design and analysis of the progressive second price auction for network bandwidth sharing. Telecommunication Systems -- Special issue on Network Economics, 1999.
Peering and Provisioning of Differentiated Internet Services - Semret, Liao, Campbell.. (2000) (11 citations) Self-citation (Lazar Semret) (Correct)
....nature of the applications, services, and population, the case is compelling. With suitably designed rules, auctions can achieve efficient (value maximizing) allocations with minimal a priori information. In [3] we showed that when the Progressive Second Price (PSP) auction introduced in [4] is used as the diff serv bandwidth market mechanism, it achieves economic objectives (incentive compatibility, and efficiency) while being realistic in the engi 0 7803 5883 X 00 0.00 (c) 2000 IEEE neering sense (small signalling and computation load) As such, it provides a useful baseline ....
....be large subscribers (web sites, intra extranets, virtual private networks) rather than individual end users. B. Provisioning and Peering Constraints Let the set of all players, including buyers, sellers and brokers (brokers are both buyers and sellers) be denoted 25. Following the notation in [4], a player s identity i E 25 as a subscript indicates that the player is a buyer, and as a superscript indicate.s the seller. For seller j, its allocation to the player i is denoted a i . Suppose i E 25 is an SBB. It offers a capacity for sale to its users. In order to honor its contracts, the ....
[Article contains additional citation context not shown here]
A. A. Lazar and N. Semret, "Design and analysis of the progressive second price auction for network bandwxdth sharing," Telecommunication Systems' - Specml issue on Network Economics, 1999, http:l/comet.columbia. eduFnemo/pub.html.
Pricing, Provisioning and Peering: Dynamic Markets for .. - Semret, Liao.. (2000) (8 citations) Self-citation (Lazar Semret) (Correct)
....In general, all parties pay for basic connectivity to the system. pricing, provisioning, and differentiation of the services, and introduce the demand model. Following this, in Section III, we show through game theoretic analysis and simulation that the progressive second price (PSP) auction of [18] can provide stable and efficient pricing in a DiffServ bandwidth market. The results of this section extend those of the single sharable resource auction of [18] to the case of multiple networked resources, in an edge capacity allocation framework. The PSP mechanism achieves the economic ....
....this, in Section III, we show through game theoretic analysis and simulation that the progressive second price (PSP) auction of [18] can provide stable and efficient pricing in a DiffServ bandwidth market. The results of this section extend those of the single sharable resource auction of [18] to the case of multiple networked resources, in an edge capacity allocation framework. The PSP mechanism achieves the economic objectives of incentive compatibility and efficiency, while being realistic in the engineering sense (small signaling load and computationally simple allocation rule) As ....
[Article contains additional citation context not shown here]
A. A. Lazar and N. Semret, "Design and analysis of the progressive second price auction for network bandwidth sharing," Telecommunication Systems, Special Issue on Network Economics, 2000. http://comet.columbia.edu/~nemo/pub.html.
Intelligent Flow Control Under Game Theoretic Framework - Huimin Chen Yanda (Correct)
No context found.
Lazar A A and Semret N. Design and analysis of the progressive second price auction for network bandwidth sharing. Submitted to Telecommunications Systems, Special Issue on Internet Economics, to appear in 1999 (Technical report 487-98-21 contains this plus topology extensions at http://comet.columbia.edu/~nemo/work.html).
Market-driven Bandwidth Allocation in Selfish Overlay Networks - Wang, Li (Correct)
No context found.
A. Lazar and N. Semret, "Design and Analysis of the Progressive Second Price Auction for Network Bandwidth Sharing," Telecommunications Systems: Special Issue on Network Economics, 1999.
Multi-Bid Auctions for Bandwidth Allocation in Communication.. - Maille, Tuffin (2004) (Correct)
No context found.
A. A. Lazar and N. Semret, "Design and analysis of the progressive second price auction for network bandwidth sharing," Telecommunication Systems - Special issue on Network Economics, 1999.
Efficiency Loss in Market Mechanisms for Resource Allocation - Johari (2004) (Correct)
No context found.
A. A. Lazar and N. Semret. Design and analysis of the Progressive Second Price auction for network bandwidth sharing. Technical report 487-98-21, Columbia University Center for Telecommunications Research, 1999. (Cited on pages 34 and 235.)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC