Linear algebraic structure of zero-determinant strategies in repeated games

Zero-determinant (ZD) strategies, a recently found novel class of strategies in repeated games, has attracted much attention in evolutionary game theory. A ZD strategy unilaterally enforces a linear relation between average payoffs of players. Although existence and evolutional stability of ZD strategies have been studied in simple games, their mathematical properties have not been well-known yet. For example, what happens when more than one players employ ZD strategies have not been clarified. In this paper, we provide a general framework for investigating situations where more than one players employ ZD strategies in terms of linear algebra. First, we theoretically prove that a set of linear relations of average payoffs enforced by ZD strategies always has solutions, which implies that incompatible linear relations are impossible. Second, we prove that linear payoff relations are independent of each other under some conditions. These results hold for general games with public monitoring including perfect-monitoring games. Furthermore, we provide a simple example of a two-player game in which one player can simultaneously enforce two linear relations, that is, simultaneously control her and her opponent's average payoffs. All of these results elucidate general mathematical properties of ZD strategies.Comment: 19 pages, 2 figure

Mathematical optimization techniques for resource allocation and spatial multiplexing in spectrum sharing networks

Due to introduction of smart phones with data intensive multimedia and interactive applications and exponential growth of wireless devices, there is a shortage for useful radio spectrum. Even though the spectrum has become crowded, many spectrum occupancy measurements indicate that most of the allocated spectrum is underutilised. Hence radically new approaches in terms of allocation of wireless resources are required for better utilization of radio spectrum. This has motivated the concept of opportunistic spectrum sharing or the so-called cognitive radio technology that has great potential to improve spectrum utilization. The cognitive radio technology allows an opportunistic user namely the secondary user to access the spectrum of the licensed user (known as primary user) provided that the secondary transmission does not harmfully affect the primary user. This is possible with the introduction of advanced resource allocation techniques together with the use of wireless relays and spatial diversity techniques. In this thesis, various mathematical optimization techniques have been developed for the efficient use of radio spectrum within the context of spectrum sharing networks. In particular, optimal power allocation techniques and centralised and distributed beamforming techniques have been developed. Initially, an optimization technique for subcarrier and power allocation has been proposed for an Orthogonal Frequency Division Multiple Access (OFDMA) based secondary wireless network in the presence of multiple primary users. The solution is based on integer linear programming with multiple interference leakage and transmission power constraints. In order to enhance the spectrum efficiency further, the work has been extended to allow multiple secondary users to occupy the same frequency band under a multiple-input and multiple-output (MIMO) framework. A sum rate maximization technique based on uplink-downlink duality and dirty paper coding has been developed for the MIMO based OFDMA network. The work has also been extended to handle fading scenarios based on maximization of ergodic capacity. The optimization techniques for MIMO network has been extended to a spectrum sharing network with relays. This has the advantage of extending the coverage of the secondary network and assisting the primary network in return for the use of the primary spectrum. Finally, instead of considering interference mitigation, the recently emerged concept of interference alignment has been used for the resource allocation in spectrum sharing networks. The performances of all these new algorithms have been demonstrated using MATLAB based simulation studies

Value Creation through Co-Opetition in Service Networks

Well-defined interfaces and standardization allow for the composition of single Web services into value-added complex services. Such complex Web Services are increasingly traded via agile marketplaces, facilitating flexible recombination of service modules to meet heterogeneous customer demands. In order to coordinate participants, this work introduces a mechanism design approach - the co-opetition mechanism - that is tailored to requirements imposed by a networked and co-opetitive environment

Linear Transmit-Receive Strategies for Multi-user MIMO Wireless Communications

Die Notwendigkeit zur Unterdrueckung von Interferenzen auf der einen Seite und zur Ausnutzung der durch Mehrfachzugriffsverfahren erzielbaren Gewinne auf der anderen Seite rueckte die raeumlichen Mehrfachzugriffsverfahren (Space Division Multiple Access, SDMA) in den Fokus der Forschung. Ein Vertreter der raeumlichen Mehrfachzugriffsverfahren, die lineare Vorkodierung, fand aufgrund steigender Anzahl an Nutzern und Antennen in heutigen und zukuenftigen Mobilkommunikationssystemen besondere Beachtung, da diese Verfahren das Design von Algorithmen zur Vorcodierung vereinfachen. Aus diesem Grund leistet diese Dissertation einen Beitrag zur Entwicklung linearer Sende- und Empfangstechniken fuer MIMO-Technologie mit mehreren Nutzern. Zunaechst stellen wir ein Framework zur Approximation des Datendurchsatzes in Broadcast-MIMO-Kanaelen mit mehreren Nutzern vor. In diesem Framework nehmen wir das lineare Vorkodierverfahren regularisierte Blockdiagonalisierung (RBD) an. Durch den Vergleich von Dirty Paper Coding (DPC) und linearen Vorkodieralgorithmen (z.B. Zero Forcing (ZF) und Blockdiagonalisierung (BD)) ist es uns moeglich, untere und obere Schranken fuer den Unterschied bezueglich Datenraten und bezueglich Leistung zwischen beiden anzugeben. Im Weiteren entwickeln wir einen Algorithmus fuer koordiniertes Beamforming (Coordinated Beamforming, CBF), dessen Loesung sich in geschlossener Form angeben laesst. Dieser CBF-Algorithmus basiert auf der SeDJoCo-Transformation und loest bisher vorhandene Probleme im Bereich CBF. Im Anschluss schlagen wir einen iterativen CBF-Algorithmus namens FlexCoBF (flexible coordinated beamforming) fuer MIMO-Broadcast-Kanaele mit mehreren Nutzern vor. Im Vergleich mit bis dato existierenden iterativen CBF-Algorithmen kann als vielversprechendster Vorteil die freie Wahl der linearen Sende- und Empfangsstrategie herausgestellt werden. Das heisst, jede existierende Methode der linearen Vorkodierung kann als Sendestrategie genutzt werden, waehrend die Strategie zum Empfangsbeamforming frei aus MRC oder MMSE gewaehlt werden darf. Im Hinblick auf Szenarien, in denen Mobilfunkzellen in Clustern zusammengefasst sind, erweitern wir FlexCoBF noch weiter. Hier wurde das Konzept der koordinierten Mehrpunktverbindung (Coordinated Multipoint (CoMP) transmission) integriert. Zuletzt stellen wir drei Moeglichkeiten vor, Kanalzustandsinformationen (Channel State Information, CSI) unter verschiedenen Kanalumstaenden zu erlangen. Die Qualitaet der Kanalzustandsinformationen hat einen starken Einfluss auf die Guete des Uebertragungssystems. Die durch unsere neuen Algorithmen erzielten Verbesserungen haben wir mittels numerischer Simulationen von Summenraten und Bitfehlerraten belegt.In order to combat interference and exploit large multiplexing gains of the multi-antenna systems, a particular interest in spatial division multiple access (SDMA) techniques has emerged. Linear precoding techniques, as one of the SDMA strategies, have obtained more attention due to the fact that an increasing number of users and antennas involved into the existing and future mobile communication systems requires a simplification of the precoding design. Therefore, this thesis contributes to the design of linear transmit and receive strategies for multi-user MIMO broadcast channels in a single cell and clustered multiple cells. First, we present a throughput approximation framework for multi-user MIMO broadcast channels employing regularized block diagonalization (RBD) linear precoding. Comparing dirty paper coding (DPC) and linear precoding algorithms (e.g., zero forcing (ZF) and block diagonalization (BD)), we further quantify lower and upper bounds of the rate and power offset between them as a function of the system parameters such as the number of users and antennas. Next, we develop a novel closed-form coordinated beamforming (CBF) algorithm (i.e., SeDJoCo based closed-form CBF) to solve the existing open problem of CBF. Our new algorithm can support a MIMO system with an arbitrary number of users and transmit antennas. Moreover, the application of our new algorithm is not only for CBF, but also for blind source separation (BSS), since the same mathematical model has been used in BSS application.Then, we further propose a new iterative CBF algorithm (i.e., flexible coordinated beamforming (FlexCoBF)) for multi-user MIMO broadcast channels. Compared to the existing iterative CBF algorithms, the most promising advantage of our new algorithm is that it provides freedom in the choice of the linear transmit and receive beamforming strategies, i.e., any existing linear precoding method can be chosen as the transmit strategy and the receive beamforming strategy can be flexibly chosen from MRC or MMSE receivers. Considering clustered multiple cell scenarios, we extend the FlexCoBF algorithm further and introduce the concept of the coordinated multipoint (CoMP) transmission. Finally, we present three strategies for channel state information (CSI) acquisition regarding various channel conditions and channel estimation strategies. The CSI knowledge is required at the base station in order to implement SDMA techniques. The quality of the obtained CSI heavily affects the system performance. The performance enhancement achieved by our new strategies has been demonstrated by numerical simulation results in terms of the system sum rate and the bit error rate

Mobile edge computing in wireless communication networks: design and optimization

This dissertation studies the design and optimization of applying mobile edge computing (MEC) in three kinds of advanced wireless networks, which is motivated by three non-trivial but not thoroughly studied topics in the existing MEC-related literature. First, we study the application of MEC in wireless powered cooperation-assisted systems. The technology of wireless power transfer (WPT) used at the access point (AP) is capable of providing sustainable energy supply for resource-limited user equipment (UEs) to support computation offloading, but also introduces the double-near-far effect into wireless powered communication networks (WPCNs). By leveraging cooperation among near-far users, the system performance can be highly improved through effectively suppressing the double-near-far effect in WPCNs. Then, we consider the application of MEC in the unmanned aerial vehicle (UAV)-assisted relaying systems to make better use of the flexible features of UAV as well as its computing resources. The adopted UAV not only acts as an MEC server to help compute UEs' offloaded tasks but also a relay to forward UEs' offloaded tasks to the AP, thus such kind of cooperation between the UAV and the AP can take the advantages of both sides so as to improve the system performance. Last, heterogeneous cellular networks (HetNets) with the coexistence of MEC and central cloud computing (CCC) are studied to show the complementary and promotional effects between MEC and CCC. The small base stations (SBSs) empowered by edge clouds offer limited edge computing services for UEs, whereas the macro base station (MBS) provides high-performance CCC services for UEs via restricted multiple-input multiple-output (MIMO) backhauls to their associated SBSs. With further considering the case with massive MIMO backhauls, the system performance can be further improved while significantly reducing the computational complexity. In the aforementioned three advanced MEC systems, we mainly focus on minimizing the energy consumption of the systems subject to proper latency constraints, due to the fact that energy consumption and latency are regarded as two important metrics for measuring the performance of MEC-related works. Effective optimization algorithms are proposed to solve the corresponding energy minimization problems, which are further validated by numerical results

コグニティブネットワークとヘテロジニアスネットワークの協調によるスペクトルの効率的利用に関する研究

学位の種別: 課程博士審査委員会委員 : （主査）東京大学教授 瀬崎 薫, 東京大学教授 浅見 徹, 東京大学教授 江崎 浩, 東京大学准教授 川原 圭博, 東京大学教授 森川 博之, 東京大学教授 相田 仁University of Tokyo(東京大学

Supporting cooperation and coordination in open multi-agent systems

Cooperation and coordination between agents are fundamental processes for increasing aggregate and individual benefit in open Multi-Agent Systems (MAS). The increased ubiquity, size, and complexity of open MAS in the modern world has prompted significant research interest in the mechanisms that underlie cooperative and coordinated behaviour. In open MAS, in which agents join and leave freely, we can assume the following properties: (i) there are no centralised authorities, (ii) agent authority is uniform, (iii) agents may be heterogeneously owned and designed, and may consequently have con icting intentions and inconsistent capabilities, and (iv) agents are constrained in interactions by a complex connecting network topology. Developing mechanisms to support cooperative and coordinated behaviour that remain effective under these assumptions remains an open research problem. Two of the major mechanisms by which cooperative and coordinated behaviour can be achieved are (i) trust and reputation, and (ii) norms and conventions. Trust and reputation, which support cooperative and coordinated behaviour through notions of reciprocity, are effective in protecting agents from malicious or selfish individuals, but their capabilities can be affected by a lack of information about potential partners and the impact of the underlying network structure. Regarding conventions and norms, there are still a wide variety of open research problems, including: (i) manipulating which convention or norm a population adopts, (ii) how to exploit knowledge of the underlying network structure to improve mechanism efficacy, and (iii) how conventions might be manipulated in the middle and latter stages of their lifecycle, when they have become established and stable. In this thesis, we address these issues and propose a number of techniques and theoretical advancements that help ensure the robustness and efficiency of these mechanisms in the context of open MAS, and demonstrate new techniques for manipulating convention emergence in large, distributed populations. Specfically, we (i) show that gossiping of reputation information can mitigate the detrimental effects of incomplete information on trust and reputation and reduce the impact of network structure, (ii) propose a new model of conventions that accounts for limitations in existing theories, (iii) show how to manipulate convention emergence using small groups of agents inserted by interested parties, (iv) demonstrate how to learn which locations in a network have the greatest capacity to in uence which convention a population adopts, and (v) show how conventions can be manipulated in the middle and latter stages of the convention lifecycle