25,096 research outputs found

    Coalitional Games with Overlapping Coalitions for Interference Management in Small Cell Networks

    Full text link
    In this paper, we study the problem of cooperative interference management in an OFDMA two-tier small cell network. In particular, we propose a novel approach for allowing the small cells to cooperate, so as to optimize their sum-rate, while cooperatively satisfying their maximum transmit power constraints. Unlike existing work which assumes that only disjoint groups of cooperative small cells can emerge, we formulate the small cells' cooperation problem as a coalition formation game with overlapping coalitions. In this game, each small cell base station can choose to participate in one or more cooperative groups (or coalitions) simultaneously, so as to optimize the tradeoff between the benefits and costs associated with cooperation. We study the properties of the proposed overlapping coalition formation game and we show that it exhibits negative externalities due to interference. Then, we propose a novel decentralized algorithm that allows the small cell base stations to interact and self-organize into a stable overlapping coalitional structure. Simulation results show that the proposed algorithm results in a notable performance advantage in terms of the total system sum-rate, relative to the noncooperative case and the classical algorithms for coalitional games with non-overlapping coalitions

    Cooperative game theory and its application to natural, environmental, and water resource issues : 3. application to water resources

    Get PDF
    This paper reviews various applications of cooperative game theory (CGT) to issues of water resources. With an increase in the competition over various water resources, the incidents of disputes have been in the center of allocation agreements. The paper reviews the cases of various water uses, such as multi-objective water projects, irrigation, groundwater, hydropower, urban water supply, wastewater, and transboundary water disputes. In addition to providing examples of cooperative solutions to allocation problems, the conclusion from this review suggests that cooperation over scarce water resources is possible under a variety of physical conditions and institutional arrangements. In particular, the various approaches for cost sharing and for allocation of physical water infrastructure and flow can serve as a basis for stable and efficient agreement, such that long-term investments in water projects are profitable and sustainable. The latter point is especially important, given recent developments in water policy in various countries and regional institutions such as the European Union (Water Framework Directive), calling for full cost recovery of investments and operation and maintenance in water projects. The CGT approaches discussed and demonstrated in this paper can provide a solid basis for finding possible and stable cost-sharing arrangements.Town Water Supply and Sanitation,Environmental Economics&Policies,Water Supply and Sanitation Governance and Institutions,Water Supply and Systems,Water and Industry

    Understanding Game Theory via Wireless Power Control

    Full text link
    In this lecture note, we introduce the basic concepts of game theory (GT), a branch of mathematics traditionally studied and applied in the areas of economics, political science, and biology, which has emerged in the last fifteen years as an effective framework for communications, networking, and signal processing (SP). The real catalyzer has been the blooming of all issues related to distributed networks, in which the nodes can be modeled as players in a game competing for system resources. Some relevant notions of GT are introduced by elaborating on a simple application in the context of wireless communications, notably the power control in an interference channel (IC) with two transmitters and two receivers.Comment: Accepted for publication as lecture note in IEEE Signal Processing Magazine, 13 pages, 4 figures. The results can be reproduced using the following Matlab code: https://github.com/lucasanguinetti/ ln-game-theor

    Coalitional Games for Transmitter Cooperation in MIMO Multiple Access Channels

    Full text link
    Cooperation between nodes sharing a wireless channel is becoming increasingly necessary to achieve performance goals in a wireless network. The problem of determining the feasibility and stability of cooperation between rational nodes in a wireless network is of great importance in understanding cooperative behavior. This paper addresses the stability of the grand coalition of transmitters signaling over a multiple access channel using the framework of cooperative game theory. The external interference experienced by each TX is represented accurately by modeling the cooperation game between the TXs in \emph{partition form}. Single user decoding and successive interference cancelling strategies are examined at the receiver. In the absence of coordination costs, the grand coalition is shown to be \emph{sum-rate optimal} for both strategies. Transmitter cooperation is \emph{stable}, if and only if the core of the game (the set of all divisions of grand coalition utility such that no coalition deviates) is nonempty. Determining the stability of cooperation is a co-NP-complete problem in general. For a single user decoding receiver, transmitter cooperation is shown to be \emph{stable} at both high and low SNRs, while for an interference cancelling receiver with a fixed decoding order, cooperation is stable only at low SNRs and unstable at high SNR. When time sharing is allowed between decoding orders, it is shown using an approximate lower bound to the utility function that TX cooperation is also stable at high SNRs. Thus, this paper demonstrates that ideal zero cost TX cooperation over a MAC is stable and improves achievable rates for each individual user.Comment: in review for publication in IEEE Transactions on Signal Processin

    A Game Theoretic Analysis of Incentives in Content Production and Sharing over Peer-to-Peer Networks

    Full text link
    User-generated content can be distributed at a low cost using peer-to-peer (P2P) networks, but the free-rider problem hinders the utilization of P2P networks. In order to achieve an efficient use of P2P networks, we investigate fundamental issues on incentives in content production and sharing using game theory. We build a basic model to analyze non-cooperative outcomes without an incentive scheme and then use different game formulations derived from the basic model to examine five incentive schemes: cooperative, payment, repeated interaction, intervention, and enforced full sharing. The results of this paper show that 1) cooperative peers share all produced content while non-cooperative peers do not share at all without an incentive scheme; 2) a cooperative scheme allows peers to consume more content than non-cooperative outcomes do; 3) a cooperative outcome can be achieved among non-cooperative peers by introducing an incentive scheme based on payment, repeated interaction, or intervention; and 4) enforced full sharing has ambiguous welfare effects on peers. In addition to describing the solutions of different formulations, we discuss enforcement and informational requirements to implement each solution, aiming to offer a guideline for protocol designers when designing incentive schemes for P2P networks.Comment: 31 pages, 3 figures, 1 tabl

    The incentives to participate in and the stability of international climate coalitions: a game theoretic approach using the WITCH Model

    Get PDF
    This paper uses WITCH, an integrated assessment model with a game-theoretic structure, to explore the prospects for, and the stability of broad coalitions to achieve ambitious climate change mitigation action. Only coalitions including all large emitting regions are found to be technically able to meet a concentration stabilisation target below 550 ppm CO2eq by 2100. Once the free-riding incentives of non-participants are taken into account, only a “grand coalition” including virtually all regions can be successful. This grand coalition is profitable as a whole, implying that all countries can gain from participation provided appropriate transfers are made across them. However, neither the grand coalition nor smaller but still environmentally significant coalitions appear to be stable. This is because the collective welfare surplus from cooperation is not found to be large enough for transfers to offset the free-riding incentives of all countries simultaneously. Some factors omitted from the analysis, which might improve coalition stability, include the co-benefits from mitigation action, the costless removal of fossil fuel subsidies, as well as alternative assumptions regarding countries’ bargaining behaviour.Climate policy; Climate coalition; Game theory; Free riding.

    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
    corecore