83,586 research outputs found

    On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games

    Full text link
    In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists of various demands on different resources. The player's utility is at most the sum of these demands, provided they are fully satisfied. Every resource has a limited capacity and if it is exceeded by the total demand, it has to be split between the players. Since these games generally do not have pure Nash equilibria, we consider approximate pure Nash equilibria, in which no player can improve her utility by more than some fixed factor α\alpha through unilateral strategy changes. There is a threshold αδ\alpha_\delta (where δ\delta is a parameter that limits the demand of each player on a specific resource) such that α\alpha-approximate pure Nash equilibria always exist for α≥αδ\alpha \geq \alpha_\delta, but not for α<αδ\alpha < \alpha_\delta. We give both upper and lower bounds on this threshold αδ\alpha_\delta and show that the corresponding decision problem is NP{\sf NP}-hard. We also show that the α\alpha-approximate price of anarchy for BAGs is α+1\alpha+1. For a restricted version of the game, where demands of players only differ slightly from each other (e.g. symmetric games), we show that approximate Nash equilibria can be reached (and thus also be computed) in polynomial time using the best-response dynamic. Finally, we show that a broader class of utility-maximization games (which includes BAGs) converges quickly towards states whose social welfare is close to the optimum

    CSMA Local Area Networking under Dynamic Altruism

    Full text link
    In this paper, we consider medium access control of local area networks (LANs) under limited-information conditions as befits a distributed system. Rather than assuming "by rule" conformance to a protocol designed to regulate packet-flow rates (e.g., CSMA windowing), we begin with a non-cooperative game framework and build a dynamic altruism term into the net utility. The effects of altruism are analyzed at Nash equilibrium for both the ALOHA and CSMA frameworks in the quasistationary (fictitious play) regime. We consider either power or throughput based costs of networking, and the cases of identical or heterogeneous (independent) users/players. In a numerical study we consider diverse players, and we see that the effects of altruism for similar players can be beneficial in the presence of significant congestion, but excessive altruism may lead to underuse of the channel when demand is low

    Sharing Rules and Stability in Coalition Games with Externalities

    Get PDF
    This paper examines cooperative sharing rules in fisheries coalition games and develops a new sharing rule that takes into account the stability of cooperation when externalities are present. We contribute to existing knowledge by introducing a connection between cooperative games (sharing rules) and non-cooperative games (stability). As an illustrative example, we describe a discrete-time, deterministic, coalition game model of the major agents who exploit the cod stock in the Baltic Sea.Baltic Sea cod, characteristic function, coalition game, cooperation, fisheries, nucleolus, Shapley value, sharing rules, stability of cooperation, Environmental Economics and Policy, C62, C70, Q22, Q28,

    Uber Effort: The Production of Worker Consent in Online Ride Sharing Platforms

    Get PDF
    The rise of the online gig economy alters ways of working. Mediated by algorithmically programmed mobile apps, platforms such as Uber and Lyft allow workers to work by driving and completing rides at any time or in any place that the drivers choose. This hybrid form of labor in an online gig economy which combines independent contract work with computer-mediated work differs from traditional manufacturing jobs in both its production activity and production relations. Through nine interviews with Lyft/Uber drivers, I found that workers’ consent, which was first articulated by Michael Burawoy in the context of the manufacturing economy, is still present in the work of the online gig economy in post-industrial capitalism. Workers willingly engage in the on-demand work not only to earn money but also to play a learning game motivated by the ambiguity of the management system, in which process they earn a sense of self-satisfaction and an illusion of autonomous control. This research points to the important role of technology in shaping contemporary labor process and suggests the potential mechanism which produces workers’ consent in technology-driven workplaces

    Applications of Repeated Games in Wireless Networks: A Survey

    Full text link
    A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

    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
    • …
    corecore