The jealousy derives from the interaction of difference and comparison. It is mainly reflected in wealth, reputation, status and love. This study reveals what¡¦s the dominant strategy and who can survive in the society via game theory to analyze and describe the result of the interaction between a jealous one and his rival for wealth on the different levels of jealousy. It is found as below: (1).Whether the jealous person takes offensive action or not, he will receive the most harm or punishment; so it is a dominant strategy for him. (2). If someone tortures by themselves, he will suffer misery from jealousy; so it is a dominant strategy for him. (3). If the jealous person desires to catch up with his rivals via honest means, he will turn jealousy into competitive ability; as a result, those that have opposite intention will gradually be eliminated through competition. (4). If the jealous person defames, or even attacks his rivals, and attempts to benefit from them, it is happened that the extra return will make up for the cost based on jealousy; consequently it is a dominant strategy so that they will be replaced step by step.

One neglected yet very important feature of family business is its internal homogeneity. Different from heterogeneity which focuses on differences across family firms, homogeneity here refers to the continuity and similarity of decision-making patterns either over time or across business units in a single family firm. This dissertation attempts to explore homogeneity in family businesses as well as its antecedents and performance consequences. To distinguish different types of homogeneity, strategic persistence is defined as homogeneity of strategic patterns over time and the pursuit of a dominant strategy as the homogeneity across related business units. Based upon S&P 1500 manufacturing firms from 1996 to 2013, it is found that family firms have a higher level of strategic persistence and a more consistent dominant strategy than nonamily firms. In addition, it appears that being older, with less organizational slack and having higher family involvement in ownership and management tends to strengthen the two kinds of homogeneity in family businesses. Finally, it is found that high homogeneity in decision-making can result in better performance in family business compared to nonamily firms, especially for those with high family involvement in management. Theoretical implications and limitations are discussed.

The main aspiration behind the contributions of this research work is the achievement of simultaneuos delay-efficiency, autonomy, and security through innovative protocol design to address complex real-life problems. To achieve this, we take a holistic approach. We apply theoretical mathematical modeling implementing implications of social-economic behavioral characteristics to propose a cross-layer network security protocol. We further complement this approach by a layer-specific focus with implementations at two lower OSI layers. For the cross-layer design, we suggest the use of game and mechanism design theories. We design a network-wide consumer-centric and delay-efficient security protocol, DSIC-S. It induces a Dominant Strategy Incentive Compatible equilibrium among all rational and selfish nodes. We prove it is network-wide socially desirable and Pareto optimal. We address resource management and delay-efficiency through synergy of several design aspects. We propose a scenario-based security model with different levels. Furthermore, we design a valuation system to integrate the caused delay in selection of security algorithms at each node without consumer's knowledge of the actual delays. We achieve this by incorporating the consumer's valuation system, in the calculation of the credit transfers through the Vickrey-Clarke-Groves (VCG) payments with Clarke's pivotal rule. As the utmost significant contribution of this work, we solve the revelation theorem's problem of misrepresentation of agents' private information in mechanism design theory through the proposed design. We design an incentive model and incorporate the valuations in the incentives. The simulations validate the theoretical results. They prove the significance of this model and among others show the correlation of the credit transfers to actual delays and security valuations. In the layer-specific approach for the network-layer, we implement the DSIC-S protocol to extend current IPsec and IKEv2 protocols. IPsec-O and IKEv2-O inherit the strong properties of DSIC-S through the proposed extensions. Furthermore, we propose yet another layer-specific protocol, the SME_Q, for the datalink layer based on ATM. We develop an extensive simulation software, SMEQSIM, to simulate ATM security negotiations. We simulate the proposed protocol in a comprehensive real-life ATM network and prove the significance of this research work. / Ph. D.

An ad hoc wireless network is an infrastructure-less, autonomous system of nodes connected through wireless links. In many current applications of ad hoc wireless networks, individual wireless nodes are autonomous, rational, and intelligent and are often referred to as selfish nodes, following game theoretic terminology. In an ad hoc wireless network, a typical node may be an intermediate node of a route from a source node to a destination node and therefore is often required to forward packets so as to enable communication to be established. Selfish nodes may not always forward the packets since the forwarding activity consumes the node’s own resources. Such behavior by individual nodes may lead to suboptimal situations where nodes, through their actions, lead to a state that is undesirable from an overall network viewpoint. To counter this, there is a need to stimulate cooperation through methods such as providing appropriate incentives. In this thesis, our interest is in designing rigorous incentive based methods for stimulating cooperation among wireless nodes, in the specific context of broadcast. In particular, we address the Incentive Compatible Broadcast problem: how do we design broadcast protocols that induce truth revelation by the individual wireless nodes? We do this using a game theory and mechanism design framework. Incentive compatibility of broadcast protocols could manifest in two forms: (1) Dominant Strategy Incentive Compatibility (DSIC) (also called strategy-proofness) and (2) Bayesian incentive compatibility (BIC). A DSIC broadcast protocol is one which makes it a best response for every wireless node to reveal its true type, regardless of what the other nodes reveal. A BIC broadcast protocol is one which makes truth revelation a best response for a node, given that the other nodes are truthful. The DSIC property is stronger and more desirable but more difficult to achieve. On the other hand, the BIC property is much weaker and easier to achieve. In this thesis, we first design a DSIC broadcast protocol for ad hoc networks using the well known VCG (Vickrey-Clarke-Groves) mechanisms and investigate its properties and performance. Next, we design a BIC broadcast protocol, investigate its properties, and compare its performance with that of the DSIC broadcast protocol. Both the protocols developed in this thesis provide an elegant solution to the incentive compatible broadcast problem in ad hoc networks with selfish nodes and help stimulate cooperation among the selfish wireless nodes.

Global warming is currently a major challenge faced by the world. Reduction of carbon emissions is of paramount importance in the context of global warming. There are widespread ongoing efforts to find satisfactory ways of surmounting this challenge. The basic objective of all such efforts can be summarized as conception and formation of protocols to reduce the pace of global carbon levels. Countries and global companies are now engaged in understanding systematic ways of achieving well defined emission targets. In this dissertation, we explore the specific problem faced by a global industry or global company in allocating carbon emission reduction units to its different divisions and supply chain partners in achieving a required target of reductions in its carbon reduction program. The problem becomes a challenging one since the divisions and supply chain partners are often autonomous and could exhibit strategic behavior. Game theory and mechanism design provide a natural modeling tool for capturing the strategic dynamics involved in this problem. DSIC (Dominant Strategy Incentive Compatibility), AE (Allocative Efficiency), and SBB (Strict Budget Balance) are the key desirable properties for carbon reduction allocation mechanisms. But due to an impossibility result in mechanism design, DSIC, AE, and SBB can never be simultaneously achieved. Hence in this dissertation, we offer as contributions, two elegant solutions to this carbon emission reduction allocation problem. The first contribution is a mechanism which is DSIC and AE. We first propose a straightforward Vickrey-Clarke-Groves (VCG) mechanism based solution to the problem, leading to a DSIC and AE reverse auction protocol for allocating carbon reductions among the divisions. This solution, however, leads to a high level of budget imbalance. To reduce budget imbalance, we use redistribution mechanisms, without affecting the key properties of DSIC and AE. The Cavallo-Bailey redistribution mechanism, when applied to the above reverse auction protocol leads to reduced budget imbalance. To reduce the imbalance further, we propose an innovative forward auction protocol which achieves less imbalance when combined with the Cavallo-Bailey redistribution mechanism. The forward auction protocol also has the appealing feature of handsomely rewarding divisions that reduce emissions and levying appropriate penalties on divisions that do not participate in emission reductions. The second contribution is a DSIC and SBB mechanism. Even though the first mechanism tries to reduce the budget imbalance, there is always a surplus which cannot be distributed among divisions and is wasted. So, in this part, by slightly compromising on efficiency, we propose a mechanism which is DSIC and SBB. The SBB property guarantees that there is no need for any monetary support from an external agency for implementing the mechanism and there is no leakage of revenue.

No description available.

[pt] O objetivo deste trabalho é aplicar a Teoria dos Jogos como elemento motivador no ensino da Matemática em turmas da terceira série do ensino médio de uma escola estadual da cidade do Rio de Janeiro, que apresentam com grande frequência dificuldades no aprendizado desta disciplina. Construímos então uma sequência didática a ser realizada em sala de aula: apresentação de breve histórico da teoria, realização do jogo Dilema do Prisioneiro e posterior explicação sobre os resultados previstos pela teoria para este jogo, introduzindo os conceitos de matriz de ganhos e estratégia dominante. Em seguida foi aplicado um teste simples de auto-avaliação, para fixação dos tópicos apresentados anteriormente. Assumindo então que neste momento os alunos estão familiarizados com os conceitos mais simples da Teoria dos Jogos, realizamos em sala de aula o jogo Barganha com Ultimato, para posterior comparação de resultados com aqueles obtidos por Bianchi, Carter e Irons e Castro e Ribeiro. / [en] The objective of this study is to apply Game Theory as a motivating element in the teaching of mathematics in those classes in the 3rd series of secondary education in the state schools of the city of Rio de Janeiro which have already frequently presented difficulties in learning this discipline. We construct a didactic sequence to be applied in the classroom: presentation of a brief history of the theory; the realisation of the game, the Prisoner s Dilema; and a subsequent explanation of the results predicted by Game Theory for this game, introducing the concepts of the result matrix and the dominant strategy. We then apply a simple self-assessment test in order to consolidate these topics. Once the students are familiarised with the basic concepts of Game Theory, we realise the Ultimatum Game in the classroom in order to compare the results with those obtained by Bianchi, Carter e Irons and Castro e Ribeiro.

A computational grid is a hardware and software infrastructure that provides dependable, consistent, pervasive, and inexpensive access to high-end computational capabilities. In the presence of grid users who are autonomous, rational, and intelligent, there is an overall degradation of the total efficiency of the computational grid in comparison to what can be achieved when the participating users are centrally coordinated . This loss in efficiency might arise due to an unwillingness on the part of some of the grid resource providers to either not perform completely or not perform to the fullest capability, the computational jobs of other users in the grid. In this thesis, our attention is focused on designing grid resource procurement mechanisms which a grid user can use for procuring resources in a computational grid based on bids submitted by autonomous, rational, and intelligent resource providers. Specifically, we follow a game theoretic and mechanism design approach to design three elegant, different incentive compatible procurement mechanisms for this purpose: G-DSIC (Grid-Dominant Strategy Incentive Compatible) mechanism which guarantees that truthful bidding is a best response for each resource provider, irrespective of what the other resource providers bid G-BIC (Grid-Bayesian Nash Incentive Compatible) mechanism which only guarantees that truthful bidding is a best response for each resource provider whenever all other resource providers also bid truthfully G-OPT (Grid-Optimal) mechanism which minimizes the cost to the grid user, satisfying at the same time, (1) Bayesian Incentive Compatibility (which guarantees that truthful bidding is a best response for each resource provider whenever all other resource providers also bid truthfully) and (2) Individual Rationality (which guarantees that the resource providers have non-negative payoffs if they participate in the bidding process). We evaluate the relative merits and demerits of the above three mechanisms using game theoretical analysis and numerical experiments. The mechanisms developed in this thesis are in the context of parameter sweep type of jobs, which consist of multiple homogeneous and independent tasks. We believe the use of the mechanisms proposed transcends beyond parameter sweep type of jobs and in general, the proposed mechanisms could be extended to provide a robust way of procuring resources in a computational grid where the resource providers exhibit rational and strategic behavior.