25 research outputs found

    Intrasexual selection: Kin competition increases male-male territorial aggression in a monogamous cichlid fish

    Get PDF
    During intrasexual competition, individuals of the same sex compete for access to breeding sites and mating partners, often accompanied by aggressive behavior. Kin selection theory predicts different kin-directed social interactions ranging from cooperation to aggression depending on the context and the resource in question. Kin competition reducing indirect fitness might be avoided by actively expelling relatives from territories and by showing higher aggression against kin. The West-African cichlid Pelvicachromis taeniatus is a monogamous cave breeder with males occupying and defending breeding sites against rivals. This species is capable of kin recognition and shows kin-preference during juvenile shoaling and mate choice. However, subadults of P. taeniatus seem to avoid the proximity of same-sex kin. In the present study, we examined territorial aggression of territory holders against intruding related and unrelated males as well as intruder's behavior. We observed higher aggression among related competitors suggesting that related males are less tolerated as neighbors. Avoidance of intrasexual competition with relatives might increase indirect fitness of males in monogamous species

    A large Muon Electric Dipole Moment from Flavor?

    Full text link
    We study the prospects and opportunities of a large muon electric dipole moment (EDM) of the order (10^{-24} - 10^{-22}) ecm. We investigate how natural such a value is within the general minimal supersymmetric extension of the Standard Model with CP violation from lepton flavor violation in view of the experimental constraints. In models with hybrid gauge-gravity mediated supersymmetry breaking a large muon EDM is indicative for the structure of flavor breaking at the Planck scale, and points towards a high messenger scale.Comment: 12 pages, 12 figures. v3: References and Eq 28 fixed; conclusions unchange

    Peer Effects in Endogenous Networks

    Get PDF

    Friends and enemies:a model of signed network formation

    Get PDF
    I propose a simple model of signed network formation, where agents make friends to extract payoffs from weaker enemies. The model thereby accounts for the interplay between friendship and alliance on one hand and enmity and antagonism on the other. Nash equilibrium configurations are such that either everyone is friends with everyone or agents can be partitioned into different sets, where agents within the same set are friends and agents in different sets are enemies. Any strong Nash equilibrium must be such that a single agent is in an antagonistic relationship with everyone else. Furthermore, I show that Nash equilibria cannot be Pareto ranked. This paper offers a game-theoretic foundation for a large body of work on signed networks, called structural balance theory, which has been studied in sociology, social psychology, bullying, international relations, and applied physics. The paper also contributes to the literature on contests and economics of conflict

    A simple model of network formation with congestion effects

    Full text link
    This paper provides a game-theoretic model of network formation with a continuous effort choice. Efforts are strategic complements for direct neighbors in the network and display global substitution/congestion effects. We show that if the parameter governing local strategic complements is larger than the one governing global strategic substitutes, then all pairwise Nash equilibrium networks are nested split graphs. We also consider the problem of a planner, who can choose effort levels and place links according to a network cost function. Again all socially optimal configurations are such that the network is a nested split graph. However, the socially optimal network may be different from equilibrium networks and efficient effort levels do not coincide with Nash equilibrium effort levels. In the presence of strategic substitutes, Nash equilibrium effort levels may be too high or too low relative to efficient effort levels. The relevant applications are crime networks and R&D collaborations among firms, but also interbank lending and trade

    Essays on social and economic networks

    No full text
    Defence date: 9 March 2011; Examining Board: Sergio Currarini, Università Ca’ Foscari di Venezia Massimo Morelli, European University Institute Francesco Squintani, University of Essex Fernando Vega-Redondo, Supervisor, European University InstituteThis thesis consists of three papers in the field of social and economic networks. In the first, called "Peer Effects in Endogenous Networks", I build a model of endogenous net- work formation in the presence of peer effects, which play an important role for decisions concerning educational attainment, criminal activity, labor market participation and R&D expenditures of firms. The class of payoff functions assumed induce local complementarities in effort levels and positive local externalities. Links are one-sided and agents move simultaneously in links and effort levels. I find that equilibrium networks display - other than the complete and the empty network - a core-periphery structure, which is commonly observed in empirical studies. Ex-ante homogenous agents may obtain very different ex-post outcomes, depending on the network that arises in equilibrium. Multiplicity of equilibria serves as an explanation for large differences in behaviour across otherwise identical groups. The second paper, titled "Alliance Formation and Coercion in Networks", presents a game-theoretic model of network formation, which allows agents to enter bilateral alliances and to extract payoffs from enemies. Each pair of agents creates a surplus of one, which allies divide in equal parts. If agents are enemies, then the agent with more allies obtains a larger share of the surplus. I show that Nash equilibria are of two types. First, a state of utopia, where all agents are allies. Second, asymmetric equilibria, such that agents can be partitioned into sets of different size, where agents within the same set are allies and agents in different sets are enemies. These results stand in contrast to coalition formation games in the economics of conflict literature, where stable group structures are generally symmetric. The model also provides a game-theoretic foundation for structural balance, a long-standing notion in social psychology, which has been fruitfully applied to the study of alliance formation in international relations. The third paper, "A Note on Stochastically Stable States for ‘Alliance Formation and Coercion in Networks’", introduces dynamics into the model of the second paper and provides a conjecture for stochastically stable states. At every time period t and with fixed probability p, each agent adjusts his strategy myopically, while with small probability E he chooses his strategy at random. The configuration where all agents sustain only positive links is shown to not be stochastically stable. Stochastically stable state are thought to be such that the number of cliques is maximal, under a restriction on the relative size of groups.-- Peer effects in endogenous networks -- Alliance formation and coercion in networks -- A note on stochastically stable states for alliance formation and coercion in network

    Targeting in adaptive networks

    Full text link
    This paper studies optimal targeting policies, consisting of eliminating (preserving) a set of agents in a network and aimed at minimizing (maximizing) aggregate effort levels. Different from the existing literature, we allow the equilibrium network to adapt after a network intervention and consider targeting of multiple agents. A simple and tractable adjustment process is introduced. We find that allowing the network to adapt may overturn optimal targeting results for a fixed network and that congestion/competition effects are crucial to understanding differences between the two settings

    Alliance formation and coercion in networks

    Full text link
    This paper presents a game-theoretic model of network formation, which allows agents to enter bilateral alliances and to extract payoffs from enemies. Each pair of agents creates a surplus of one, which allies divide in equal parts. If agents are enemies, then the agent with more allies obtains a larger share of the surplus. I show that Nash equilibria are of two types. First, a state of utopia, where all agents are allies. Second, asymmetric equilibria, such that agents can be partitioned into sets of different size, where agents within the same set are allies and agents in different sets are enemies. These results stand in contrast to coalition formation games in the economics of conflict literature, where stable group structures are generally symmetric. The model provides a game-theoretic foundation for structural balance, a long- standing notion in social psychology, which has been fruitfully applied to the study of alliance formation in international relations

    Alliance Formation and Coercion in Networks

    No full text
    This paper presents a game-theoretic model of network formation, which allows agents to enter bilateral alliances and to extract payoffs from enemies. Each pair of agents creates a surplus of one, which allies divide in equal parts. If agents are enemies, then the agent with more allies obtains a larger share of the surplus. I show that Nash equilibria are of two types. First, a state of utopia, where all agents are allies. Second, asymmetric equilibria, such that agents can be partitioned into sets of different size, where agents within the same set are allies and agents in different sets are enemies. These results stand in contrast to coalition formation games in the economics of conflict literature, where stable group structures are generally symmetric. The model provides a game-theoretic foundation for structural balance, a long- standing notion in social psychology, which has been fruitfully applied to the study of alliance formation in international relations
    corecore