909 resultados para Game theory.
Resumo:
This dissertation discussed resource allocation mechanisms in several network topologies including infrastructure wireless network, non-infrastructure wireless network and wire-cum-wireless network. Different networks may have different resource constrains. Based on actual technologies and implementation models, utility function, game theory and a modern control algorithm have been introduced to balance power, bandwidth and customers' satisfaction in the system. ^ In infrastructure wireless networks, utility function was used in the Third Generation (3G) cellular network and the network was trying to maximize the total utility. In this dissertation, revenue maximization was set as an objective. Compared with the previous work on utility maximization, it is more practical to implement revenue maximization by the cellular network operators. The pricing strategies were studied and the algorithms were given to find the optimal price combination of power and rate to maximize the profit without degrading the Quality of Service (QoS) performance. ^ In non-infrastructure wireless networks, power capacity is limited by the small size of the nodes. In such a network, nodes need to transmit traffic not only for themselves but also for their neighbors, so power management become the most important issue for the network overall performance. Our innovative routing algorithm based on utility function, sets up a flexible framework for different users with different concerns in the same network. This algorithm allows users to make trade offs between multiple resource parameters. Its flexibility makes it a suitable solution for the large scale non-infrastructure network. This dissertation also covers non-cooperation problems. Through combining game theory and utility function, equilibrium points could be found among rational users which can enhance the cooperation in the network. ^ Finally, a wire-cum-wireless network architecture was introduced. This network architecture can support multiple services over multiple networks with smart resource allocation methods. Although a SONET-to-WiMAX case was used for the analysis, the mathematic procedure and resource allocation scheme could be universal solutions for all infrastructure, non-infrastructure and combined networks. ^
Resumo:
Wireless sensor networks are emerging as effective tools in the gathering and dissemination of data. They can be applied in many fields including health, environmental monitoring, home automation and the military. Like all other computing systems it is necessary to include security features, so that security sensitive data traversing the network is protected. However, traditional security techniques cannot be applied to wireless sensor networks. This is due to the constraints of battery power, memory, and the computational capacities of the miniature wireless sensor nodes. Therefore, to address this need, it becomes necessary to develop new lightweight security protocols. This dissertation focuses on designing a suite of lightweight trust-based security mechanisms and a cooperation enforcement protocol for wireless sensor networks. This dissertation presents a trust-based cluster head election mechanism used to elect new cluster heads. This solution prevents a major security breach against the routing protocol, namely, the election of malicious or compromised cluster heads. This dissertation also describes a location-aware, trust-based, compromise node detection, and isolation mechanism. Both of these mechanisms rely on the ability of a node to monitor its neighbors. Using neighbor monitoring techniques, the nodes are able to determine their neighbors’ reputation and trust level through probabilistic modeling. The mechanisms were designed to mitigate internal attacks within wireless sensor networks. The feasibility of the approach is demonstrated through extensive simulations. The dissertation also addresses non-cooperation problems in multi-user wireless sensor networks. A scalable lightweight enforcement algorithm using evolutionary game theory is also designed. The effectiveness of this cooperation enforcement algorithm is validated through mathematical analysis and simulation. This research has advanced the knowledge of wireless sensor network security and cooperation by developing new techniques based on mathematical models. By doing this, we have enabled others to build on our work towards the creation of highly trusted wireless sensor networks. This would facilitate its full utilization in many fields ranging from civilian to military applications.
Resumo:
In recent years, there has been an enormous growth of location-aware devices, such as GPS embedded cell phones, mobile sensors and radio-frequency identification tags. The age of combining sensing, processing and communication in one device, gives rise to a vast number of applications leading to endless possibilities and a realization of mobile Wireless Sensor Network (mWSN) applications. As computing, sensing and communication become more ubiquitous, trajectory privacy becomes a critical piece of information and an important factor for commercial success. While on the move, sensor nodes continuously transmit data streams of sensed values and spatiotemporal information, known as ``trajectory information". If adversaries can intercept this information, they can monitor the trajectory path and capture the location of the source node. ^ This research stems from the recognition that the wide applicability of mWSNs will remain elusive unless a trajectory privacy preservation mechanism is developed. The outcome seeks to lay a firm foundation in the field of trajectory privacy preservation in mWSNs against external and internal trajectory privacy attacks. First, to prevent external attacks, we particularly investigated a context-based trajectory privacy-aware routing protocol to prevent the eavesdropping attack. Traditional shortest-path oriented routing algorithms give adversaries the possibility to locate the target node in a certain area. We designed the novel privacy-aware routing phase and utilized the trajectory dissimilarity between mobile nodes to mislead adversaries about the location where the message started its journey. Second, to detect internal attacks, we developed a software-based attestation solution to detect compromised nodes. We created the dynamic attestation node chain among neighboring nodes to examine the memory checksum of suspicious nodes. The computation time for memory traversal had been improved compared to the previous work. Finally, we revisited the trust issue in trajectory privacy preservation mechanism designs. We used Bayesian game theory to model and analyze cooperative, selfish and malicious nodes' behaviors in trajectory privacy preservation activities.^
Resumo:
Wireless sensor networks are emerging as effective tools in the gathering and dissemination of data. They can be applied in many fields including health, environmental monitoring, home automation and the military. Like all other computing systems it is necessary to include security features, so that security sensitive data traversing the network is protected. However, traditional security techniques cannot be applied to wireless sensor networks. This is due to the constraints of battery power, memory, and the computational capacities of the miniature wireless sensor nodes. Therefore, to address this need, it becomes necessary to develop new lightweight security protocols. This dissertation focuses on designing a suite of lightweight trust-based security mechanisms and a cooperation enforcement protocol for wireless sensor networks. This dissertation presents a trust-based cluster head election mechanism used to elect new cluster heads. This solution prevents a major security breach against the routing protocol, namely, the election of malicious or compromised cluster heads. This dissertation also describes a location-aware, trust-based, compromise node detection, and isolation mechanism. Both of these mechanisms rely on the ability of a node to monitor its neighbors. Using neighbor monitoring techniques, the nodes are able to determine their neighbors’ reputation and trust level through probabilistic modeling. The mechanisms were designed to mitigate internal attacks within wireless sensor networks. The feasibility of the approach is demonstrated through extensive simulations. The dissertation also addresses non-cooperation problems in multi-user wireless sensor networks. A scalable lightweight enforcement algorithm using evolutionary game theory is also designed. The effectiveness of this cooperation enforcement algorithm is validated through mathematical analysis and simulation. This research has advanced the knowledge of wireless sensor network security and cooperation by developing new techniques based on mathematical models. By doing this, we have enabled others to build on our work towards the creation of highly trusted wireless sensor networks. This would facilitate its full utilization in many fields ranging from civilian to military applications.
Resumo:
The Ultimatum Game is a methodology of the Game Theory that intends to investigate the individuals cooperative behavior in situations of resources division. Studies have shown that half of the subjects don’t accept unfair division of resources, and prefer to bear a momentary cost to revenge the deceivers. However, people who have assertiveness impairment, such as social phobic individuals, could have some difficulties to reject unfair offer division resource, especially in situations that cause over anxiety, like being in the presence of an individual considered to be in a high hierarchical level. A negative perception about his own worth can also make the person thinks that he does not deserve a fair division. These individuals also have a strong desire to convey a positive impression to the others, which could cause them to be more generous in a resource division. The aim of this study was to verify, through the Ultimatum Game, if social anxiety individuals would accept more high confederate’s unfair offers that low confederate’s unfair offers; and if they would be more generous in goods division, in the same game, when compared to individuals without social anxiety. Ninety-five (95) college students participated in this study answering the Social Phobia Inventory, the Factorial Scale of Extroversion, socio-demographic questionnaire, situational anxiety scale and, finally, the Ultimatum Game in four rounds (1st and 3rd – confederate representing high or low ranking using an unfair proposal; 2nd – confederate without social status using fair proposal; 4th – subject’s research proposes the offer). The results showed a significant negative correlation between social anxiety and haughtiness, and social anxiety and assertiveness, and a significant positive correlation between social anxiety and situational anxiety. There was no significant difference in situational anxiety due to the status for anxious individuals. Also we found no significant difference in the amount of donated goods, showing that generous behavior does not differ between groups. Finally, the social status did not influence the decision in response to the game for anxious individuals. These results corroborate to other studies that show the relationship between social anxiety and assertiveness, and social anxiety and negative self-perception capability and value (low haughtiness). As show the results of situational anxiety scale, the high status stimulus was not perceived as threatening to the individual, which may have affected his answer in the game. The results for the Ultimatum Game follow the same direction as the acceptance rate for unfair proposals (approximately 50%) in studies with non-clinical sample.
Resumo:
The Ultimatum Game is a methodology of the Game Theory that intends to investigate the individuals cooperative behavior in situations of resources division. Studies have shown that half of the subjects don’t accept unfair division of resources, and prefer to bear a momentary cost to revenge the deceivers. However, people who have assertiveness impairment, such as social phobic individuals, could have some difficulties to reject unfair offer division resource, especially in situations that cause over anxiety, like being in the presence of an individual considered to be in a high hierarchical level. A negative perception about his own worth can also make the person thinks that he does not deserve a fair division. These individuals also have a strong desire to convey a positive impression to the others, which could cause them to be more generous in a resource division. The aim of this study was to verify, through the Ultimatum Game, if social anxiety individuals would accept more high confederate’s unfair offers that low confederate’s unfair offers; and if they would be more generous in goods division, in the same game, when compared to individuals without social anxiety. Ninety-five (95) college students participated in this study answering the Social Phobia Inventory, the Factorial Scale of Extroversion, socio-demographic questionnaire, situational anxiety scale and, finally, the Ultimatum Game in four rounds (1st and 3rd – confederate representing high or low ranking using an unfair proposal; 2nd – confederate without social status using fair proposal; 4th – subject’s research proposes the offer). The results showed a significant negative correlation between social anxiety and haughtiness, and social anxiety and assertiveness, and a significant positive correlation between social anxiety and situational anxiety. There was no significant difference in situational anxiety due to the status for anxious individuals. Also we found no significant difference in the amount of donated goods, showing that generous behavior does not differ between groups. Finally, the social status did not influence the decision in response to the game for anxious individuals. These results corroborate to other studies that show the relationship between social anxiety and assertiveness, and social anxiety and negative self-perception capability and value (low haughtiness). As show the results of situational anxiety scale, the high status stimulus was not perceived as threatening to the individual, which may have affected his answer in the game. The results for the Ultimatum Game follow the same direction as the acceptance rate for unfair proposals (approximately 50%) in studies with non-clinical sample.
Resumo:
Monitoring and enforcement are perhaps the biggest challenges in the design and implementation of environmental policies in developing countries where the actions of many small informal actors cause significant impacts on the ecosystem services and where the transaction costs for the state to regulate them could be enormous. This dissertation studies the potential of innovative institutions based on decentralized coordination and enforcement to induce better environmental outcomes. Such policies have in common that the state plays the role of providing the incentives for organization but the process of compliance happens through decentralized agreements, trust building, signaling and monitoring. I draw from the literatures in collective action, common-pool resources, game-theory and non-point source pollution to develop the instruments proposed here. To test the different conditions in which such policies could be implemented I designed two field-experiments that I conducted with small-scale gold miners in the Colombian Pacific and with users and providers of ecosystem services in the states of Veracruz, Quintana Roo and Yucatan in Mexico. This dissertation is organized in three essays.
The first essay, “Collective Incentives for Cleaner Small-Scale Gold Mining on the Frontier: Experimental Tests of Compliance with Group Incentives given Limited State Monitoring”, examines whether collective incentives, i.e. incentives provided to a group conditional on collective compliance, could “outsource” the required local monitoring, i.e. induce group interactions that extend the reach of the state that can observe only aggregate consequences in the context of small-scale gold mining. I employed a framed field-lab experiment in which the miners make decisions regarding mining intensity. The state sets a collective target for an environmental outcome, verifies compliance and provides a group reward for compliance which is split equally among members. Since the target set by the state transforms the situation into a coordination game, outcomes depend on expectations of what others will do. I conducted this experiment with 640 participants in a mining region of the Colombian Pacific and I examine different levels of policy severity and their ordering. The findings of the experiment suggest that such instruments can induce compliance but this regulation involves tradeoffs. For most severe targets – with rewards just above costs – raise gains if successful but can collapse rapidly and completely. In terms of group interactions, better outcomes are found when severity initially is lower suggesting learning.
The second essay, “Collective Compliance can be Efficient and Inequitable: Impacts of Leaders among Small-Scale Gold Miners in Colombia”, explores the channels through which communication help groups to coordinate in presence of collective incentives and whether the reached solutions are equitable or not. Also in the context of small-scale gold mining in the Colombian Pacific, I test the effect of communication in compliance with a collective environmental target. The results suggest that communication, as expected, helps to solve coordination challenges but still some groups reach agreements involving unequal outcomes. By examining the agreements that took place in each group, I observe that the main coordination mechanism was the presence of leaders that help other group members to clarify the situation. Interestingly, leaders not only helped groups to reach efficiency but also played a key role in equity by defining how the costs of compliance would be distributed among group members.
The third essay, “Creating Local PES Institutions and Increasing Impacts of PES in Mexico: A real-Time Watershed-Level Framed Field Experiment on Coordination and Conditionality”, considers the creation of a local payments for ecosystem services (PES) mechanism as an assurance game that requires the coordination between two groups of participants: upstream and downstream. Based on this assurance interaction, I explore the effect of allowing peer-sanctions on upstream behavior in the functioning of the mechanism. This field-lab experiment was implemented in three real cases of the Mexican Fondos Concurrentes (matching funds) program in the states of Veracruz, Quintana Roo and Yucatan, where 240 real users and 240 real providers of hydrological services were recruited and interacted with each other in real time. The experimental results suggest that initial trust-game behaviors align with participants’ perceptions and predicts baseline giving in assurance game. For upstream providers, i.e. those who get sanctioned, the threat and the use of sanctions increase contributions. Downstream users contribute less when offered the option to sanction – as if that option signal an uncooperative upstream – then the contributions rise in line with the complementarity in payments of the assurance game.
Resumo:
In this project we review the effects of reputation within the context of game theory. This is done through a study of two key papers. First, we examine a paper from Fudenberg and Levine: Reputation and Equilibrium Selection in Games with a Patient Player (1989). We add to this a review Gossner’s Simple Bounds on the Value of a Reputation (2011). We look specifically at scenarios in which a long-run player faces a series of short-run opponents, and how the former may develop a reputation. In turn, we show how reputation leads directly to both lower and upper bounds on the long-run player’s payoffs.
Resumo:
This paper proposes a technique to defeat Denial of Service (DoS) and Distributed Denial of Service (DDoS) attacks in Ad Hoc Networks. The technique is divided into two main parts and with game theory and cryptographic puzzles. Introduced first is a new client puzzle to prevent DoS attacks in such networks. The second part presents a multiplayer game that takes place between the nodes of an ad hoc network and based on fundamental principles of game theory. By combining computational problems with puzzles, improvement occurs in the efficiency and latency of the communicating nodes and resistance in DoS and DDoS attacks. Experimental results show the effectiveness of the approach for devices with limited resources and for environments like ad hoc networks where nodes must exchange information quickly.
Resumo:
We consider how three firms compete in a Salop location model and how cooperation in location choice by two of these firms affects the outcomes. We con- sider the classical case of linear transportation costs as a two-stage game in which the firms select first a location on a unit circle along which consumers are dispersed evenly, followed by the competitive selection of a price. Standard analysis restricts itself to purely competitive selection of location; instead, we focus on the situation in which two firms collectively decide about location, but price their products competitively after the location choice has been effectuated. We show that such partial coordination of location is beneficial to all firms, since it reduces the number of equilibria significantly and, thereby, the resulting coordination problem. Subsequently, we show that the case of quadratic transportation costs changes the main conclusions only marginally.
Resumo:
A novelty of the new Paris Agreement is the inclusion of a process for assessment and review of countries’ nationally determined pledges and contributions. The intent is to reveal whether similar countries are making comparable pledges, whether the totality of such pledges will achieve the global goal, and whether, over the coming years, the contributions actually made by countries will equal or exceed their pledges. The intent is also to provide an opportunity for countries to express their approval, or disapproval, of the pledges and contributions made by individual countries. Here we report the results of a lab experiment on the effects of such a process in a game in which players choose a group target, declare their individual pledges, and then make voluntary contributions to supply a public good. Our results show that a review process is more likely to affect targets and pledges than actual contributions. Even when a review process increases average contributions, the effect is relatively small. As the window for achieving the 2 °C goal will close soon, our results suggest that, rather than merely implement the Paris Agreement, negotiators should begin now to develop complementary approaches to limiting emissions, including the adoption of agreements that are designed differently than the one adopted in Paris.
Resumo:
La investigación se ha orientado, partiendo del origen y la evolución de la neurociencia, hacia los efectos que otorga la toma de decisiones, donde la interdisciplinariedad existente en la neurociencia, nos muestra una complementariedad e “integración” entre diversas disciplinas, que permite el reordenamiento de los saberes y dar cabida a nuevos planteamientos científicos -- Contamos por una parte con las ciencias cognitivas, las cuales tienen su origen en seis disciplinas: la lingüística, la filosofía, la inteligencia artificial, la psicología, las neurociencias y las ciencias sociales (teoría de la comunicación, la economía, la antropología y la teoría de la decisión) -- Dentro del desarrollo de esta ciencia unificada salta a la palestra el hecho de la toma de decisiones, que es producto de las actividades cerebrales que van correlacionadas al comportamiento humano -- A partir de la anterior premisa surge el concepto de la neuroeconomía, la dualidad cerebrofunción y conducta económica, originando la toma de decisión ante las múltiples alternativas de elección
Resumo:
Interações sociais são frequentemente descritas como trocas sociais. Na literatura, trocas sociais em Sistemas Multiagentes são objeto de estudo em diversos contextos, nos quais as relações sociais são interpretadas como trocas sociais. Dentre os problemas estudados, um problema fundamental discutido na literatura e a regulação¸ ao de trocas sociais, por exemplo, a emergência de trocas equilibradas ao longo do tempo levando ao equilíbrio social e/ou comportamento de equilíbrio/justiça. Em particular, o problema da regulação de trocas sociais e difícil quando os agentes tem informação incompleta sobre as estratégias de troca dos outros agentes, especificamente se os agentes tem diferentes estratégias de troca. Esta dissertação de mestrado propõe uma abordagem para a autorregulacao de trocas sociais em sistemas multiagentes, baseada na Teoria dos Jogos. Propõe o modelo de Jogo de Autorregulacão ao de Processos de Trocas Sociais (JAPTS), em uma versão evolutiva e espacial, onde os agentes organizados em uma rede complexa, podem evoluir suas diferentes estratégias de troca social. As estratégias de troca são definidas através dos parâmetros de uma função de fitness. Analisa-se a possibilidade do surgimento do comportamento de equilíbrio quando os agentes, tentando maximizar sua adaptação através da função de fitness, procuram aumentar o numero de interações bem sucedidas. Considera-se um jogo de informação incompleta, uma vez que os agentes não tem informações sobre as estratégias de outros agentes. Para o processo de aprendizado de estratégias, utiliza-se um algoritmo evolutivo, no qual os agentes visando maximizar a sua função de fitness, atuam como autorregulares dos processos de trocas possibilitadas pelo jogo, contribuindo para o aumento do numero de interações bem sucedidas. São analisados 5 diferentes casos de composição da sociedade. Para alguns casos, analisa-se também um segundo tipo de cenário, onde a topologia de rede é modificada, representando algum tipo de mobilidade, a fim de analisar se os resultados são dependentes da vizinhança. Alem disso, um terceiro cenário é estudado, no qual é se determinada uma política de influencia, quando as medias dos parâmetros que definem as estratégias adotadas pelos agentes tornam-se publicas em alguns momentos da simulação, e os agentes que adotam a mesma estratégia de troca, influenciados por isso, imitam esses valores. O modelo foi implementado em NetLogo.
Resumo:
A teoria de jogos modela estratégias entre agentes (jogadores), os quais possuem recompensas ao fim do jogo conforme suas ações. O melhor par de estratégias para os jogadores constitui uma solução de equilíbrio. Porém, nem sempre se consegue estimar os dados do problema. Diante disso, os parâmetros incertos presentes em modelos de jogos são formalizados pela teoria fuzzy. Assim, a teoria fuzzy auxilia a teoria de jogos, formando jogos fuzzy. Dessa forma, parâmetros, como as recompensas, tornam-se números fuzzy. Mais ainda, quando há incerteza na representação desses números fuzzy utilizam-se os números fuzzy intervalares. Então, neste trabalho modelos de jogos fuzzy intervalares são analisados e métodos computacionais são desenvolvidos para a resolução desses jogos. Por fim, realizam-se simulações de programação linear para observar melhor a aplicação das teorias estudadas e avaliar a proposta.
Resumo:
Delusion and gamble, but also failure and disillusion are some of the most striking features of The Absolute Perfection of Crime, a novel that encloses its own reading instructions, which are intimately linked to film codes and the idea of remake. Tanguy Viel’s work manages to stage the frailness of fiction, halfway between the signified and the signifier, critical detachment and fictional illusion. Following the anthropological approach to game theory and the theory of literary genres, this paper aims to analyze the inner functioning of the representation tools at work in the novel as a means to highlight the paradoxical role granted to the reader.