218 research outputs found

    Oligopolistic Competitive Packet Routing

    Get PDF
    Oligopolistic competitive packet routing games model situations in which traffic is routed in discrete units through a network over time. We study a game-theoretic variant of packet routing, where in contrast to classical packet routing, we are lacking a central authority to decide on an oblivious routing protocol. Instead, selfish acting decision makers ("players") control a certain amount of traffic each, which needs to be sent as fast as possible from a player-specific origin to a player-specific destination through a commonly used network. The network is represented by a directed graph, each edge of which being endowed with a transit time, as well as a capacity bounding the number of traffic units entering an edge simultaneously. Additionally, a priority policy on the set of players is publicly known with respect to which conflicts at intersections are resolved. We prove the existence of a pure Nash equilibrium and show that it can be constructed by sequentially computing an integral earliest arrival flow for each player. Moreover, we derive several tight bounds on the price of anarchy and the price of stability in single source games

    The effect of competition among brokers on the quality and price of differentiated internet services

    Full text link
    Price war, as an important factor in undercutting competitors and attracting customers, has spurred considerable work that analyzes such conflict situation. However, in most of these studies, quality of service (QoS), as an important decision-making criterion, has been neglected. Furthermore, with the rise of service-oriented architectures, where players may offer different levels of QoS for different prices, more studies are needed to examine the interaction among players within the service hierarchy. In this paper, we present a new approach to modeling price competition in (virtualized) service-oriented architectures, where there are multiple service levels. In our model, brokers, as the intermediaries between end-users and service providers, offer different QoS by adapting the service that they obtain from lower-level providers so as to match the demands of their clients to the services of providers. To maximize profit, players, i.e. providers and brokers, at each level compete in a Bertrand game while they offer different QoS. To maintain an oligopoly market, we then describe underlying dynamics which lead to a Bertrand game with price constraints at the providers' level. Numerical simulations demonstrate the behavior of brokers and providers and the effect of price competition on their market shares.This work has been partly supported by National Science Foundation awards: CNS-0963974, CNS-1346688, CNS-1536090 and CNS-1647084

    Equilibrium Computation in Resource Allocation Games

    Full text link
    We study the equilibrium computation problem for two classical resource allocation games: atomic splittable congestion games and multimarket Cournot oligopolies. For atomic splittable congestion games with singleton strategies and player-specific affine cost functions, we devise the first polynomial time algorithm computing a pure Nash equilibrium. Our algorithm is combinatorial and computes the exact equilibrium assuming rational input. The idea is to compute an equilibrium for an associated integrally-splittable singleton congestion game in which the players can only split their demands in integral multiples of a common packet size. While integral games have been considered in the literature before, no polynomial time algorithm computing an equilibrium was known. Also for this class, we devise the first polynomial time algorithm and use it as a building block for our main algorithm. We then develop a polynomial time computable transformation mapping a multimarket Cournot competition game with firm-specific affine price functions and quadratic costs to an associated atomic splittable congestion game as described above. The transformation preserves equilibria in either games and, thus, leads -- via our first algorithm -- to a polynomial time algorithm computing Cournot equilibria. Finally, our analysis for integrally-splittable games implies new bounds on the difference between real and integral Cournot equilibria. The bounds can be seen as a generalization of the recent bounds for single market oligopolies obtained by Todd [2016].Comment: This version contains some typo corrections onl

    Cost-sharing in generalised selfish routing

    Get PDF
    © Springer International Publishing AG 2017. We study a generalisation of atomic selfish routing games where each player may control multiple flows which she routes seek-ing to minimise their aggregate cost. Such games emerge in various set-tings, such as traïŹƒc routing in road networks by competing ride-sharing applications or packet routing in communication networks by competing service providers who seek to optimise the quality of service of their cus-tomers. We study the existence of pure Nash equilibria in the induced games and we exhibit a separation from the single-commodity per player model by proving that the Shapley value is the only cost-sharing method that guarantees it. We also prove that the price of anarchy and price of stability is no larger than in the single-commodity model for general cost-sharing methods and general classes of convex cost functions. We close by giving results on the existence of pure Nash equilibria of a splittable variant of our model

    Human Resource and Employment Practices in Telecommunications Services, 1980-1998

    Get PDF
    [Excerpt] In the academic literature on manufacturing, much research and debate have focused on whether firms are adopting some form of “high-performance” or “high-involvement” work organization based on such practices as employee participation, teams, and increased discretion, skills, and training for frontline workers (Ichniowski et al., 1996; Kochan and Osterman, 1994; MacDuffie, 1995). Whereas many firms in the telecommunications industry flirted with these ideas in the 1980s, they did not prove to be a lasting source of inspiration for the redesign of work and employment practices. Rather, work restructuring in telecommunications services has been driven by the ability of firms to leverage network and information technologies to reduce labor costs and create customer segmentation strategies. “Good jobs” versus “bad jobs,” or higher versus lower wage jobs, do not vary according to whether firms adopt a high- involvement model. They vary along two other dimensions: (1) within firms and occupations, by the value-added of the customer segment that an employee group serves; and (2) across firms, by union and nonunion status. We believe that this customer segmentation strategy is becoming a more general model for employment practices in large-scale service | operations; telecommunications services firms may be somewhat more | advanced than other service firms in adopting this strategy because of certain unique industry characteristics. The scale economies of network technology are such that once a company builds the network infrastructure to a customer’s specifications, the cost of additional services is essentially zero. As a result, and notwithstanding technological uncertainty, all of the industry’s major players are attempting to take advantage of system economies inherent in the nature of the product market and technology to provide customized packages of multimedia products to identified market segments. They have organized into market-driven business units providing differentiated services to large businesses and institutions, small businesses, and residential customers. They have used information technologies and process reengineering to customize specific services to different segments according to customer needs and ability to pay. Variation in work and employment practices, or labor market segmentation, follows product market segmentation. As a result, much of the variation in employment practices in this industry is within firms and within occupations according to market segment rather than across firms. In addition, despite market deregulation beginning in 1984 and opportunities for new entrants, a tightly led oligopoly structure is replacing the regulated Bell System monopoly. Former Bell System companies, the giants of the regulated period, continue to dominate market share in the post-1984 period. Older players and new entrants alike are merging and consolidating in order to have access to multimedia markets. What is striking in this industry, therefore, is the relative lack of variation in management and employment practices across firms after more than a decade of experience with deregulation. We attribute this lack of variation to three major sources. (1) Technological advances and network economics provide incentives for mergers, organizational consolidation, and, as indicated above, similar business strategies. (2) The former Bell System companies have deep institutional ties, and they continue to benchmark against and imitate each other so that ideas about restructuring have diffused quickly among them. (3) Despite overall deunionization in the industry, they continue to have high unionization rates; de facto pattern bargaining within the Bell system has remained quite strong. Therefore, similar employment practices based on inherited collective bargaining agreements continue to exist across former Bell System firms

    Telecommunication of stabilizing signals in power systems

    Get PDF
    Deregulation of the power industry has occurred at a rapid pace, opening some promising competition between suppliers. The result of this competition should be to the benefit of customers.;Telecommunication plays a crucial role in integrating systems and ensuring smooth operation by way of exchanging data and information between various systems that are responsible for monitoring and control of the grid. For example, a Power System Stabilizer (PSS) controller could be placed at one of the generators and requires remote measurements. All the communication schemes within the network generate delays that are characterized in this project using OPNET Modeler. OPNET Modeler is also used to characterize the number of dropped packets.;As a case study, we consider a two-area four-generator (2A4G) and explore the role of communication delay on system stability. Those delays play an important role in the design of a controller that can help the damping of electro-mechanical oscillations between interconnected synchronous generators and therefore maintain the system stability. The network statistics are then imported into Simulink in order to visualize the speed of the shaft w2 as a function of time. Additional communication options to the inter-area oscillation problem are offered at the end of the thesis (use of Virtual Private Network (VPN), use of fiber optic dedicated network, or the use of IPv6 protocol)

    The Beginnings and Prospective Ending of “End-to-End”: An Evolutionary Perspective On the Internet’s Architecture

    Get PDF
    The technology of “the Internet” is not static. Although its “end-to- end” architecture has made this “connection-less” communications system readily “extensible,” and highly encouraging to innovation both in hardware and software applications, there are strong pressures for engineering changes. Some of these are wanted to support novel transport services (e.g. voice telephony, real-time video); others would address drawbacks that appeared with opening of the Internet to public and commercial traffic - e.g., the difficulties of blocking delivery of offensive content, suppressing malicious actions (e.g. “denial of service” attacks), pricing bandwidth usage to reduce congestion. The expected gains from making “improvements” in the core of the network should be weighed against the loss of the social and economic benefits that derive from the “end-to-end” architectural design. Even where technological “fixes” can be placed at the networks’ edges, the option remains to search for alternative, institutional mechanisms of governing conduct in cyberspace.
    • 

    corecore