DOCSLIB.ORG

Carrier Aggregation Between Operators in Next

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Carrier Aggregation Between Operators in Next 1 Carrier Aggregation between Operators in Next Generation Cellular Networks: A Stable Roommate Market Yong Xiao, Senior Member, IEEE, Zhu Han, Fellow, IEEE, Chau Yuen, Senior Member, IEEE, Luiz A. DaSilva, Senior Member, IEEE Abstract—This paper studies carrier aggregation between next generation of mobile technology will rely on CA to multiple mobile network operators (MNO), referred to as achieve its promised peak data rates. In a typical network, inter-operator carrier aggregation (IO-CA). In IO-CA, each a mobile network operator (MNO) may aggregate MNO can transmit on its own licensed spectrum and aggregate the spectrum licensed to other MNOs. We focus frequency resource blocks contiguously or on the case that MNOs are distributedly partitioned into non-contiguously within a single frequency band, i.e. small groups, called IO-CA pairs, each of which consists of intra-band CA, or it may aggregate resources which are two MNOs that mutually agree to share their spectrum with located in separate frequency bands. While much of the each other. We model the IO-CA pairing problem between current work on CA investigates the aggregation of MNOs as a stable roommate market and derive a condition for which a stable matching structure among all MNOs exclusive blocks of spectrum from the perspective of exists. We propose an algorithm that achieves a stable typical macrocell topologies [3]–[5], we study carrier matching if it exists. Otherwise, the algorithm results in a aggregation (CA) for cellular networks from a cognitive stable partition. For each IO-CA pair, we derive the optimal radio (CR) network perspective. transmit power for each spectrum aggregator and establish In this paper, we investigate a framework that allows a Stackelberg game model to analyze the interaction between the licensed subscribers and aggregators in the multiple MNOs to access and aggregate each other’s spectrum of each MNO. We derive the Stackelberg licensed spectrum for the purpose of providing more equilibrium of our proposed game and then develop a joint spectrum for the low power elements of their network optimization algorithm that achieves the stable matching topology. As such, we propose a system that allows for structure among MNOs as well as the optimal transmit the dynamic aggregation of spectrum resources over both powers for the aggregators and prices for the subscribers of each MNO. the MNO’s own spectrum holdings and the spectrum holdings of other MNOs. In this scenario, an MNO may Index Terms—Carrier aggregation, cellular network, operate high power macrocells in its own exclusively cognitive radio, stable roommate, stable marriage, matching, graph, game theory. licensed spectrum and may dynamically aggregate additional sub-bands, for lower power use, in another network’s licensed spectrum. We refer to this type of I. INTRODUCTION carrier aggregation as inter-operator CA (IO-CA), i.e. a With the fast growing demand for mobile data service, heterogeneous mix of users, having different rights and it becomes more and more difficult to allocate a wide and employing different transmit powers, exploits the same contiguous frequency band to support high speed data frequencies over the same area. communication for each user equipment (UE). A new From a CR network perspective [6]–[8], each MNO technology proposed in LTE-Advanced (LTE-A) [2], and its corresponding subscriber UEs, who are spectrum referred to as carrier aggregation (CA), allows network license holders, are also referred to as the primary users operators to support high data rates over large bandwidths (PU). The subscriber UEs of each MNO have priority to by aggregating frequency resources that lie in different use their own licensed spectrum, but they can also tolerate frequency bands or which may not be contiguous. The a certain interference increase caused by subscriber UEs from other MNOs. These subscriber UEs from other Some of the results in this paper have been presented at the IEEE MNOs, also referred to as secondary users (SU), can Global Communications Conference (GLOBECOM), Anaheim, CA, USA, access the spectrum licensed to the MNO as long as the Dec., 2012 [1]. This work is partially supported by the National Science Foundation under Grants CNS-1443917, ECCS-1405121, CNS- resulting interference is lower than the tolerable level of 1265268, and CNS-0953377, the Science Foundation Ireland under Grant the spectrum license holders, i.e. the PUs. We propose 10/IN.1/I3007, and A*Star SERC Project Grant 142 02 00043. two IO-CA approaches: a direct extension of the Y. Xiao and Z. Han are with the Department of Electrical and Computer Engineering at University of Houston, TX, USA 77004 (e-mails: traditional CA in LTE Advanced into the inter-operator [email protected] and [email protected]). scenario, called regular IO-CA, and a spatial spectrum C. Yuen is with Singapore University of Technology and Design, sharing-based IO-CA framework for multi-operator Singapore 487372 (email: [email protected]) L. A. DaSilva is with CONNECT, Trinity College Dublin, Ireland cellular networks, called sharing IO-CA. In both Dublin 2 (e-mail: [email protected]). approaches, each MNO and its subscriber UEs are 2 regarded as PUs in its own spectrum. Some UEs from introduce two operations: deletion and addition, for each MNO can also access and aggregate the spectrum of cellular networks. Specifically, if an MNO observes other MNOs, where they will be regarded as the SUs and increasing traffic demands in its network and would should always control their access to keep the resulting like to seek extra network capacity by forming an interference under a given tolerable level. IO-CA pair with others, it will join the roommate There are several challenges to enable IO-CA between market by using the addition operation to decide its MNOs. Specifically, in the traditional CA within the IO-CA pairing partner and still maintain the stability spectrum of one MNO, the MNO’s infrastructure (e.g., of the existing partitions. Similarly, if the service eNB in LTE Advanced) controls and manages the demand for an MNO in an IO-CA pair decreases to spectrum aggregation behavior of its UEs in a centralized a level that can be satisfied without using IO-CA, the fashion. In cellular networks with multiple MNOs, delete operation will be applied to remove this MNO however, there is no central controller and, because of from the existing IO-CA pair. We observe that a privacy and business reasons, each MNO cannot disclose stable matching structure may not always exist. We its private information (such as the payoffs and preference derive a condition for which a stable matching of its UEs and the performance improvement brought by structure exists and propose an algorithm that can IO-CA) to other MNOs. In addition, since each MNO has detect whether this condition is satisfied and, if it is, already been licensed an exclusive spectrum band and achieves this matching structure. does not have to always rely on IO-CA to achieve the 2) Price Adjustment Problem: in this problem, each basic quality-of-service (QoS) for its subscriber UEs, each MNO charges a price to the subscriber UEs from MNO will only allow its spectrum to be aggregated by other MNOs that aggregate its spectrum. We observe others when it has an incentive to do so. that for each MNO, charging a high price to the One approach that has been proposed in the existing aggregators will deter the potential MNOs that are literature is for all the operators to merge their licensed willing to form an IO-CA pair. On the other hand, spectrum to form a common spectrum pool [9]–[12]. charging a low price will decrease the profit and However, the spectrum pooling system generally requires increase possible interference between pairing all operators to give up their exclusive use of spectrum. In MNOs. We hence propose a Stackelberg game-based addition, the coordination and competition for the hierarchical framework to investigate the case where spectrum usage among all the operators and their one MNO and its subscriber UEs are the leaders in corresponding UEs does not always lead to an efficient their own licensed spectrum, with the ability to set solution, especially when the size of the coverage area prices for secondary use of the spectrum, and and the number of operators and UEs becomes large [12]. subscriber UEs, also called the aggregators, of other A tradeoff between spectrum pooling and intra-operator MNOs are the followers who can optimize their CA can be achieved by partitioning all MNOs into small performance under the prices imposed by the leaders. groups, each of which consisting of a limited number of 3) Power Control Problem: in this problem, each MNOs that are willing to coordinate and share their subscriber UE using sharing IO-CA can optimize its spectrum with each other. However, as observed in [8], transmit power to further improve its performance there may not always exist a stable coalition formation without causing intolerably high interference to the structure in a distributed multi-agent system and even if it subscriber UEs of the primary operator. exists, there is still a lack of an effective algorithm to 4) Joint Optimization problem: we consider the joint allow all MNOs to distributedly negotiate and form this optimization of the above three problems and structure. That is, finding a coalition formation structure develop a distributed algorithm to jointly optimize in a distributed multi-agent system has been proved to be the resulting decisions. NP-hard [13], [14]. To the best of our knowledge, this is the first work that In this paper, we study the joint optimization for an IO- studies the optimization of IO-CA in cellular networks, CA-based cellular network with multiple MNOs.
Load more

Recommended publications
  • Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions
    Int J Game Theory (2008) 36:537–569 DOI 10.1007/s00182-008-0117-6 ORIGINAL PAPER Deferred acceptance algorithms: history, theory, practice, and open questions Alvin E. Roth Accepted: 19 July 2007 / Published online: 29 January 2008 © Springer-Verlag 2008 Abstract The deferred acceptance algorithm proposed by Gale and Shapley (1962) has had a profound influence on market design, both directly, by being adapted into practical matching mechanisms, and, indirectly, by raising new theoretical questions. Deferred acceptance algorithms are at the basis of a number of labor market clea- ringhouses around the world, and have recently been implemented in school choice systems in Boston and New York City. In addition, the study of markets that have failed in ways that can be fixed with centralized mechanisms has led to a deeper understanding of some of the tasks a marketplace needs to accomplish to perform well. In particular, marketplaces work well when they provide thickness to the mar- ket, help it deal with the congestion that thickness can bring, and make it safe for participants to act effectively on their preferences. Centralized clearinghouses organi- zed around the deferred acceptance algorithm can have these properties, and this has sometimes allowed failed markets to be reorganized. Keywords Matching · Market design · Gale-shapley · Deferred acceptance Introduction Matching is one of the important functions of markets. Who gets which jobs, which school places, who marries whom, these help shape lives and careers. Partly for this reason, a substantial literature has grown out of the remarkable paper “College Admissions and the Stability of Marriage” that David Gale and Lloyd Prepared for Gale’s Feast: a Day in honor of the 85th birthday of David Gale, July 2007, Stony Brook.
    [Show full text]
  • Matchingmarkets
    Package ‘matchingMarkets’ February 20, 2015 Version 0.1-2 Depends R (>= 2.15.2) Imports Rcpp (>= 0.11.2), lpSolve (>= 5.6.6), partitions LinkingTo Rcpp, RcppArmadillo Date 2014-08-14 Title An R package for the analysis of stable matchings Author Thilo Klein Maintainer Thilo Klein <[email protected]> Description This package implements a structural estimator to correct for the sample selection bias from observed outcomes in matching markets. It also contains R code for matching algorithms such as the deferred-acceptance algorithm for college admissions, the top-trading-cycles algorithm for house allocation and a partitioning linear program for the roommates problem. URL https://github.com/thiloklein/matchingMarkets License GPL (>= 2) | file LICENSE Repository CRAN Repository/R-Forge/Project matchingmarkets Repository/R-Forge/Revision 16 Repository/R-Forge/DateTimeStamp 2014-11-22 23:10:11 Date/Publication 2014-11-23 09:35:22 NeedsCompilation yes R topics documented: matchingMarkets-package . .2 baac00 . .4 daa..............................................6 khb .............................................8 mfx .............................................9 1 2 matchingMarkets-package plp..............................................9 stabit . 10 stabsim . 15 ttc.............................................. 17 Index 18 matchingMarkets-package An R package for the analysis of stable matchings. Description The matchingMarkets package contains R and C++ code for the estimation of structural models that correct for the sample selection bias of observed outcomes in matching markets. Matching is concerned with who transacts with whom, and how. For example, who works at which job, which students go to which school, who forms a workgroup with whom, and so on. The empirical analysis of matching markets is naturally subject to sample selection problems.
    [Show full text]
  • 15 Hedonic Games Haris Azizaand Rahul Savanib
    Draft { December 5, 2014 15 Hedonic Games Haris Azizaand Rahul Savanib 15.1 Introduction Coalitions are a central part of economic, political, and social life, and coalition formation has been studied extensively within the mathematical social sciences. Agents (be they humans, robots, or software agents) have preferences over coalitions and, based on these preferences, it is natural to ask which coalitions are expected to form, and which coalition structures are better social outcomes. In this chapter, we consider coalition formation games with hedonic preferences, or simply hedonic games. The outcome of a coalition formation game is a partitioning of the agents into disjoint coalitions, which we will refer to synonymously as a partition or coalition structure. The defining feature of hedonic preferences is that every agent only cares about which agents are in its coalition, but does not care how agents in other coali- tions are grouped together (Dr`ezeand Greenberg, 1980). Thus, hedonic preferences completely ignore inter-coalitional dependencies. Despite their relative simplicity, hedonic games have been used to model many interesting settings, such as research team formation (Alcalde and Revilla, 2004), scheduling group activities (Darmann et al., 2012), formation of coalition governments (Le Breton et al., 2008), cluster- ings in social networks (see e.g., Aziz et al., 2014b; McSweeney et al., 2014; Olsen, 2009), and distributed task allocation for wireless agents (Saad et al., 2011). Before we give a formal definition of a hedonic game, we give a standard hedonic game from the literature that we will use as a running example (see e.g., Banerjee et al.
    [Show full text]
  • Stable Matching with PCF Version 2, an Étude in Secure Computation
    Stable Matching with PCF Version 2, an Etude´ in Secure Computation A Thesis Presented to the Faculty of the School of Engineering and Applied Science University of Virginia In Partial Fulfillment of the requirements for the Degree Master of Science (Computer Science) by Benjamin Terner August 2015 To Mom Everything I am is a reflection of the woman who raised me, and everything I do is an honor to her memory. iii Abstract The classic stable-matching algorithm of Gale and Shapley and subsequent variants by, e.g., Abdulkadiroglu et al. [APR05], have been used successfully in a number of real-world scenarios, including the assignment of US medical school graduates to residency programs and students in New York, Norway, and Singapore to high schools and universities. One shortcoming of the Gale-Shapley family of matching algorithms is susceptibility to strategic manipulation by the participants. The commonly used paradigm to mitigate this shortcoming, employing a trusted third party to compute matchings explicitly, is outdated, expensive, and in some scenarios, impossible. This makes stable matching a natural problem for secure, multiparty computation (SMPC). Secure multiparty computation allows two or more mutually distrustful parties to evaluate a joint function on their inputs without revealing more information about the inputs than each player can derive from his own input and output. We use Portable Circuit Format (PCF), a compiler and interpreter for Yao’s garbled circuit protocols, to produce the first feasible, privacy-preserving protocol for stable matching. In doing so, we improve the theoretical bounds for stable matching constructions, develop global optimizations for PCF circuits, and improve garbling techniques used by PCF.
    [Show full text]
  • Devising a Framework for Efficient and Accurate Matchmaking and Real-Time Web Communication
    Dartmouth College Dartmouth Digital Commons Dartmouth College Undergraduate Theses Theses and Dissertations 6-1-2016 Devising a Framework for Efficient and Accurate Matchmaking and Real-time Web Communication Charles Li Dartmouth College Follow this and additional works at: https://digitalcommons.dartmouth.edu/senior_theses Part of the Computer Sciences Commons Recommended Citation Li, Charles, "Devising a Framework for Efficient and Accurate Matchmaking and Real-time Web Communication" (2016). Dartmouth College Undergraduate Theses. 106. https://digitalcommons.dartmouth.edu/senior_theses/106 This Thesis (Undergraduate) is brought to you for free and open access by the Theses and Dissertations at Dartmouth Digital Commons. It has been accepted for inclusion in Dartmouth College Undergraduate Theses by an authorized administrator of Dartmouth Digital Commons. For more information, please contact [email protected]. Devising a framework for efficient and accurate matchmaking and real-time web communication Charles Li Department of Computer Science Dartmouth College Hanover, NH [email protected] Abstract—Many modern applications have a great need for propose and evaluate original matchmaking algorithms, and matchmaking and real-time web communication. This paper first also discuss and evaluate implementations of real-time explores and details the specifics of original algorithms for communication using existing web protocols. effective matchmaking, and then proceeds to dive into implementations of real-time communication between different clients across the web. Finally, it discusses how to apply the II. PRIOR WORK AND RELEVANT TECHNOLOGIES techniques discussed in the paper in practice, and provides samples based on the framework. A. Matchmaking: No Stable Matching Exists Consider a pool of users. What does matchmaking entail? It Keywords—matchmaking; real-time; web could be the task of finding, for each user, the best compatriot or opponent in the pool to match with, given the user’s set of I.
    [Show full text]
  • Cheating to Get Better Roommates in a Random Stable Matching
    Dartmouth College Dartmouth Digital Commons Computer Science Technical Reports Computer Science 12-1-2006 Cheating to Get Better Roommates in a Random Stable Matching Chien-Chung Huang Dartmouth College Follow this and additional works at: https://digitalcommons.dartmouth.edu/cs_tr Part of the Computer Sciences Commons Dartmouth Digital Commons Citation Huang, Chien-Chung, "Cheating to Get Better Roommates in a Random Stable Matching" (2006). Computer Science Technical Report TR2006-582. https://digitalcommons.dartmouth.edu/cs_tr/290 This Technical Report is brought to you for free and open access by the Computer Science at Dartmouth Digital Commons. It has been accepted for inclusion in Computer Science Technical Reports by an authorized administrator of Dartmouth Digital Commons. For more information, please contact [email protected]. Cheating to Get Better Roommates in a Random Stable Matching Chien-Chung Huang Technical Report 2006-582 Dartmouth College Sudikoff Lab 6211 for Computer Science Hanover, NH 03755, USA [email protected] Abstract This paper addresses strategies for the stable roommates problem, assuming that a stable matching is chosen at random. We investigate how a cheating man should permute his preference list so that he has a higher-ranking roommate probabilistically. In the first part of the paper, we identify a necessary condition for creating a new stable roommate for the cheating man. This condition precludes any possibility of his getting a new roommate ranking higher than all his stable room- mates when everyone is truthful. Generalizing to the case that multiple men collude, we derive another impossibility result: given any stable matching in which a subset of men get their best possible roommates, they cannot cheat to create a new stable matching in which they all get strictly better roommates than in the given matching.
    [Show full text]
  • A General Framework for Stable Roommates Problems Using Answer Set Programming∗
    TPLP 20 (6): 911–925, 2020. c The Author(s), 2020. Published by Cambridge University Press. This is an Open Access 911 article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited doi:10.1017/S1471068420000277 A General Framework for Stable Roommates Problems using Answer Set Programming∗ ESRA ERDEM and MUGE¨ FIDAN Faculty of Engineering and Natural Sciences, Sabanci University, Istanbul, Turkey fesraerdem,mugefi[email protected] DAVID MANLOVE and PATRICK PROSSER School of Computing Science, University of Glasgow, Glasgow, UK fdavid.manlove,[email protected] submitted 7 August 2020; accepted 10 August 2020 Abstract The Stable Roommates problem (SR) is characterized by the preferences of agents over other agents as roommates: each agent ranks all others in strict order of preference. A solution to SR is then a partition of the agents into pairs so that each pair shares a room, and there is no pair of agents that would block this matching (i.e., who prefers the other to their roommate in the matching). There are interesting variations of SR that are motivated by applications (e.g., the preference lists may be incomplete (SRI) and involve ties (SRTI)), and that try to find a more fair solution (e.g., Egalitarian SR). Unlike the Stable Marriage problem, every SR instance is not guaranteed to have a solution. For that reason, there are also variations of SR that try to find a good-enough solution (e.g., Almost SR).
    [Show full text]
  • Cheating to Get Better Roommates in a Random Stable Matching
    Cheating to Get Better Roommates in a Random Stable Matching Chien-Chung Huang Technical Report 2006-582 Dartmouth College Sudikoff Lab 6211 for Computer Science Hanover, NH 03755, USA [email protected] Abstract This paper addresses strategies for the stable roommates problem, assuming that a stable matching is chosen at random. We investigate how a cheating man should permute his preference list so that he has a higher-ranking roommate probabilistically. In the first part of the paper, we identify a necessary condition for creating a new stable roommate for the cheating man. This condition precludes any possibility of his getting a new roommate ranking higher than all his stable room- mates when everyone is truthful. Generalizing to the case that multiple men collude, we derive another impossibility result: given any stable matching in which a subset of men get their best possible roommates, they cannot cheat to create a new stable matching in which they all get strictly better roommates than in the given matching. Our impossibility result, considered in the context of the stable marriage problem, easily re-establishes the cel- ebrated Dubins-Freedman-Roth Theorem. The more generalized Demange-Gale-Sotomayor Theorem states that a coalition of men and women cannot cheat to create a stable matching in which everyone of them gets a strictly better partner than in the Gale-Shapley algorithm (with men proposing). We give a sharper result: a coalition of men and women cannot cheat together so that, in a newly-created stable matching, every man in the coalition gets a strictly better partner than in the Gale-Shapley algorithm while none of the women in the coalition is worse off.
    [Show full text]
  • Random Stable Matchings
    Random Stable Matchings Stephan Mertens † Institut fur¨ Theoretische Physik, Otto-von-Guericke Universitat,¨ PF 4120, 39016 Magdeburg, Germany Abstract. The stable matching problem is a prototype model in economics and social sciences where agents act selfishly to optimize their own satisfaction, subject to mutually conflicting constraints. A stable matching is a pairing of adjacent vertices in a graph such that no unpaired vertices prefer each other to their partners under the matching. The problem of finding stable matchings is known as stable marriage problem (on bipartite graphs) or as stable roommates problem (on the complete graph). It is well-known that not all instances on non-bipartite graphs admit a stable matching. Here we present numerical results for the probability that a graph with n vertices and random preference relations admits a stable matching. In particular we find that this probability decays algebraically on graphs with connectivity Θ(n) and exponentially on regular grids. On finite connectivity Erdos-R¨ en´ yi graphs the probability converges to a value larger than zero. Based on the numerical results and some heuristic reasoning we formulate five conjectures on the asymptotic properties of random stable matchings. Journal Ref.: J. Stat. Mech. (2005) P10008 1. Introduction The stable matching problem is a prototype model in economics and social sciences where agents act selfishly to optimize their own satisfaction, subject to mutually conflicting constraints. The best known example is the stable marriage problem [1, 2], where the agents are n men and n women that compete with each other in the “marriage market”. Each man ranks all the women according to his individual preferences, and each woman does the same with all men.
    [Show full text]
  • On Coalition Formation Games ∗
    On Coalition Formation Games ∗ Jana Hajdukov´a Institute of Mathematics, Faculty of Science, P.J. Saf´arikUniversity,ˇ Jesenn´a5, 041 54 Koˇsice, Slovakia, e-mail: [email protected] June 22, 2004 Abstract. In this paper we give an overview of various methods used to study cooperation within a set of players. Besides the classical games with transferable utility and games without transferable utility, recently new models have been proposed: the coalition formation games. In these, each player has his own preferences over coalitions to which he could belong and the quality of a coalition structure is evaluated according to its stability. We review various definitions of stability and restrictions of preferences ensuring the existence of a partition stable with respect to a particular stability definition. Further, we stress the importance of preferences over sets of players derived from preferences over individuals and review the known algorithmic results for special types of preferences derived from the best and/or the worst player of a coalition. Keywords: coalition formation, stability, extending preferences, algorithms, NP-completeness Mathematical subjects classification: 91A12, 91A06, 91B68, 68W05 ∗This research was started while the author was visiting Universitat Aut`onoma de Barcelona. She is grateful to their hospitality and financial support under Marie Curie Fellowship. This work was supported also by the Slovak Agency for Science, contract #1/0425/03 ”Combina- torial Structures and Complexity of Algorithms”. The author would like to thank Katar´ına Cechl´arov´afor her helpful comments. 1 2 IM Preprint series A, No. 5/2004 1 Introduction In many social, economic and political situations individuals prefer to carry out their activities in groups (coalitions) rather than on their own.
    [Show full text]
  • The Core of Roommate Problems: Size and Rank-Fairness Within Matched Pairs∗
    The Core of Roommate Problems: Size and Rank-Fairness within Matched Pairs∗ Paula Jaramilloy C¸aˇgatay Kayız Flip Klijnx September 15, 2018 Abstract This paper deals with roommate problems (Gale and Shapley, 1962) that are solvable, i.e., have a non-empty core (set of stable matchings). We study rank-fairness within pairs of stable matchings and the size of the core by means of maximal and average rank gaps. We provide upper bounds in terms of maximal and average disagreements in the agents' rankings. Finally, we show that most of our bounds are tight. Keywords: matching, roommate problem, stability, core, rank-fairness, rank gap, bound. JEL{Numbers: C78. 1 Introduction In roommate problems (Gale and Shapley, 1962), a group of agents wish to divide up into pairs and singletons. Each agent has a preference list or so-called ranking over the other agents and being single (which can be interpreted as recurring to an outside option). The central solution concept for roommate problems is the set of stable matchings (or core), i.e., the partitions of agents in pairs and singletons for which there are no blocking coalitions. ∗We thank David Manlove for useful suggestions on the computation of stable matchings for roommate problems. We thank Bettina Klaus, Fuhito Kojima, Andreu Mas-Colell, and seminar audiences at Universitat de Barcelona and Universitat Rovira i Virgili for useful discussions. We thank an Associate Editor and three anonymous reviewers for their valuable comments and suggestions. yUniversidad de Los Andes, Bogot´a,Colombia. zUniversidad del Rosario, Bogot´a,Colombia. xCorresponding author. Institute for Economic Analysis (CSIC) and Barcelona GSE, Spain; e{mail: [email protected].
    [Show full text]
  • Behavioral Game Theory
    Behavioral Game Theory Heinrich Harald Nax ETH Zurich¨ a thesis submitted for habilitation at the professorship of computational social science in the department of humanities, social and political sciences (d-gess). 2015 Gr¨ußean Oma K¨athi,Elisabeth Eiche und Wilhelm und Margarete Busch. Behavioral Game Theory HH Nax, 2015 Habilitation Committee: Prof. Dirk Helbing (Computational Social Science, ETH Z¨urich) Prof. Guillaume Hollard (Economics, Ecole´ polytechnique) Prof. Andreas Diekmann (Sociology, ETH Z¨urich) Prof. Tatsuyoshi Saijo (Experimental Economics, Kochi University of Technology) 2 Thesis outline In one of his last publications, \The Agencies Method for Modeling Coalitions and Cooperation in Games" (IGTR 10: 539-564, 2008), John F. Nash wrote I feel, personally, that the study of experimental games is the proper route of travel for finding \the ultimate truth" in relation to games as played by human players. But in practical game theory the players can be corporations or states; so the problem of usefully analyzing a game does not, in a practical sense, re- duce to a problem only of the analysis of human behavior. It is apparent that actual human behavior is guided by complex human instincts promoting cooper- ation among individuals and that moreover there are also the various cultural influences acting to modify individual human behavior and at least often to influence the behavior of humans toward enhanced cooperativeness. To most, this quote will come as a surprise because the name John Nash is associated, not with behavioral or experimental research, but rather with the mathematics of game theory and, in particular, with the `Nash equilibrium'.
    [Show full text]