18,564 research outputs found
Coalition Formation with Local Public Goods and Network Effect
Many local public goods are provided by coalitions and some of them have network effects. Namely, people prefer to consume a public good in a coalition with more members. This paper adopts the Drèze and Greenberg (1980) type utility function where players have preferences over goods as well as coalition members. In a game with anonymous and separable network effect, the core is nonempty when coalition feasible sets are monotonic and players' preferences over public goods have connected support. All core allocations consist of connected coalitions and they are Tiebout equilibria as well. We also examine the no-exodus equilibrium for games whose feasible sets are not monotonic.Coalition formation, core, network effect, local public goods
Distributed Cooperative Sensing in Cognitive Radio Networks: An Overlapping Coalition Formation Approach
Cooperative spectrum sensing has been shown to yield a significant
performance improvement in cognitive radio networks. In this paper, we consider
distributed cooperative sensing (DCS) in which secondary users (SUs) exchange
data with one another instead of reporting to a common fusion center. In most
existing DCS algorithms, the SUs are grouped into disjoint cooperative groups
or coalitions, and within each coalition the local sensing data is exchanged.
However, these schemes do not account for the possibility that an SU can be
involved in multiple cooperative coalitions thus forming overlapping
coalitions. Here, we address this problem using novel techniques from a class
of cooperative games, known as overlapping coalition formation games, and based
on the game model, we propose a distributed DCS algorithm in which the SUs
self-organize into a desirable network structure with overlapping coalitions.
Simulation results show that the proposed overlapping algorithm yields
significant performance improvements, decreasing the total error probability up
to 25% in the Q_m+Q_f criterion, the missed detection probability up to 20% in
the Q_m/Q_f criterion, the overhead up to 80%, and the total report number up
to 10%, compared with the state-of-the-art non-overlapping algorithm
Matching Dynamics with Constraints
We study uncoordinated matching markets with additional local constraints
that capture, e.g., restricted information, visibility, or externalities in
markets. Each agent is a node in a fixed matching network and strives to be
matched to another agent. Each agent has a complete preference list over all
other agents it can be matched with. However, depending on the constraints and
the current state of the game, not all possible partners are available for
matching at all times. For correlated preferences, we propose and study a
general class of hedonic coalition formation games that we call coalition
formation games with constraints. This class includes and extends many recently
studied variants of stable matching, such as locally stable matching, socially
stable matching, or friendship matching. Perhaps surprisingly, we show that all
these variants are encompassed in a class of "consistent" instances that always
allow a polynomial improvement sequence to a stable state. In addition, we show
that for consistent instances there always exists a polynomial sequence to
every reachable state. Our characterization is tight in the sense that we
provide exponential lower bounds when each of the requirements for consistency
is violated. We also analyze matching with uncorrelated preferences, where we
obtain a larger variety of results. While socially stable matching always
allows a polynomial sequence to a stable state, for other classes different
additional assumptions are sufficient to guarantee the same results. For the
problem of reaching a given stable state, we show NP-hardness in almost all
considered classes of matching games.Comment: Conference Version in WINE 201
Coalitional Games with Overlapping Coalitions for Interference Management in Small Cell Networks
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
Coalitional Games in MISO Interference Channels: Epsilon-Core and Coalition Structure Stable Set
The multiple-input single-output interference channel is considered. Each
transmitter is assumed to know the channels between itself and all receivers
perfectly and the receivers are assumed to treat interference as additive
noise. In this setting, noncooperative transmission does not take into account
the interference generated at other receivers which generally leads to
inefficient performance of the links. To improve this situation, we study
cooperation between the links using coalitional games. The players (links) in a
coalition either perform zero forcing transmission or Wiener filter precoding
to each other. The -core is a solution concept for coalitional games
which takes into account the overhead required in coalition deviation. We
provide necessary and sufficient conditions for the strong and weak
-core of our coalitional game not to be empty with zero forcing
transmission. Since, the -core only considers the possibility of
joint cooperation of all links, we study coalitional games in partition form in
which several distinct coalitions can form. We propose a polynomial time
distributed coalition formation algorithm based on coalition merging and prove
that its solution lies in the coalition structure stable set of our coalition
formation game. Simulation results reveal the cooperation gains for different
coalition formation complexities and deviation overhead models.Comment: to appear in IEEE Transactions on Signal Processing, 14 pages, 14
figures, 3 table
Game-theoretic Resource Allocation Methods for Device-to-Device (D2D) Communication
Device-to-device (D2D) communication underlaying cellular networks allows
mobile devices such as smartphones and tablets to use the licensed spectrum
allocated to cellular services for direct peer-to-peer transmission. D2D
communication can use either one-hop transmission (i.e., in D2D direct
communication) or multi-hop cluster-based transmission (i.e., in D2D local area
networks). The D2D devices can compete or cooperate with each other to reuse
the radio resources in D2D networks. Therefore, resource allocation and access
for D2D communication can be treated as games. The theories behind these games
provide a variety of mathematical tools to effectively model and analyze the
individual or group behaviors of D2D users. In addition, game models can
provide distributed solutions to the resource allocation problems for D2D
communication. The aim of this article is to demonstrate the applications of
game-theoretic models to study the radio resource allocation issues in D2D
communication. The article also outlines several key open research directions.Comment: Accepted. IEEE Wireless Comms Mag. 201
Physical Layer Security: Coalitional Games for Distributed Cooperation
Cooperation between wireless network nodes is a promising technique for
improving the physical layer security of wireless transmission, in terms of
secrecy capacity, in the presence of multiple eavesdroppers. While existing
physical layer security literature answered the question "what are the
link-level secrecy capacity gains from cooperation?", this paper attempts to
answer the question of "how to achieve those gains in a practical decentralized
wireless network and in the presence of a secrecy capacity cost for information
exchange?". For this purpose, we model the physical layer security cooperation
problem as a coalitional game with non-transferable utility and propose a
distributed algorithm for coalition formation. Through the proposed algorithm,
the wireless users can autonomously cooperate and self-organize into disjoint
independent coalitions, while maximizing their secrecy capacity taking into
account the security costs during information exchange. We analyze the
resulting coalitional structures, discuss their properties, and study how the
users can self-adapt the network topology to environmental changes such as
mobility. Simulation results show that the proposed algorithm allows the users
to cooperate and self-organize while improving the average secrecy capacity per
user up to 25.32% relative to the non-cooperative case.Comment: Best paper Award at Wiopt 200
Interference Alignment-Aided Base Station Clustering using Coalition Formation
Base station clustering is necessary in large interference networks, where
the channel state information (CSI) acquisition overhead otherwise would be
overwhelming. In this paper, we propose a novel long-term throughput model for
the clustered users which addresses the balance between interference mitigation
capability and CSI acquisition overhead. The model only depends on statistical
CSI, thus enabling long-term clustering. Based on notions from coalitional game
theory, we propose a low-complexity distributed clustering method. The
algorithm converges in a couple of iterations, and only requires limited
communication between base stations. Numerical simulations show the viability
of the proposed approach.Comment: 2nd Prize, Student Paper Contest. Copyright 2015 SS&C. Published in
the Proceedings of the 49th Asilomar Conference on Signals, Systems and
Computers, Nov 8-11, 2015, Pacific Grove, CA, US
- …