79 resultados para Game strategies


Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we approach the classical problem of clustering using solution concepts from cooperative game theory such as Nucleolus and Shapley value. We formulate the problem of clustering as a characteristic form game and develop a novel algorithm DRAC (Density-Restricted Agglomerative Clustering) for clustering. With extensive experimentation on standard data sets, we compare the performance of DRAC with that of well known algorithms. We show an interesting result that four prominent solution concepts, Nucleolus, Shapley value, Gately point and \tau-value coincide for the defined characteristic form game. This vindicates the choice of the characteristic function of the clustering game and also provides strong intuitive foundation for our approach.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Space vector based PWM strategies for three-level inverters have a broader choice of switching sequences to generate the required reference vector than triangle comparison based PWM techniques. However, space vector based PWM involves numerous steps which are computationally intensive. A simplified algorithm is proposed here, which is shown to reduce the computation time significantly. The developed algorithm is used to implement synchronous and asynchronous conventional space vector PWM, synchronized modified space vector PWM and an asynchronous advanced bus-clamping PWM technique on a low-cost dsPIC digital controller. Experimental results are presented for a comparative evaluation of the performance of different PWM methods.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Intra and interspecific variation in frugivore behaviour can have important consequences for seed dispersal outcomes. However, most information comes from among-species comparisons, and within-species variation is relatively poorly understood. We examined how large intraspecific differences in the behaviour of a native disperser, blackbuck antelope Antilope cervicapra, influence dispersal of a woody invasive, Prosopis juliflora, in a grassland ecosystem. Blackbuck disperse P. juliflora seeds through their dung. In lekking blackbuck populations, males defend clustered or dispersed mating territories. Territorial male movement is restricted, and within their territories males defecate on dung-piles. In contrast, mixed-sex herds range over large areas and do not create dung-piles. We expected territorial males to shape seed dispersal patterns, and seed deposition and seedling recruitment to be spatially localized. Territorial males had a disproportionately large influence on seed dispersal. Adult males removed twice as much fruit as females, and seed arrival was disproportionately high on territories. Also, because lek-territories are clustered, seed arrival was spatially highly concentrated. Seedling recruitment was also substantially higher on territories compared with random sites, indicating that the local concentration of seeds created by territorial males continued into high local recruitment of seedlings. Territorial male behaviour may, thus, result in a distinct spatial pattern of invasion of grasslands by the woody P. juliflora. An ex situ experiment showed no beneficial effect of dung and a negative effect of light on seed germination. We conclude that large intraspecific behavioural differences within frugivore populations can result in significant variation in their effectiveness as seed dispersers. Mating strategies in a disperser could shape seed dispersal, seedling recruitment and potentially plant distribution patterns. These mating strategies may aid in the spread of invasives, such as P. juliflora, which could, in turn, negatively influence the behaviour and ecology of native dispersers.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motivated by the observation that communities in real world social networks form due to actions of rational individuals in networks, we propose a novel game theory inspired algorithm to determine communities in networks. The algorithm is decentralized and only uses local information at each node. We show the efficacy of the proposed algorithm through extensive experimentation on several real world social network data sets.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the problem of devising incentive strategies for viral marketing of a product. In particular, we assume that the seller can influence penetration of the product by offering two incentive programs: a) direct incentives to potential buyers (influence) and b) referral rewards for customers who influence potential buyers to make the purchase (exploit connections). The problem is to determine the optimal timing of these programs over a finite time horizon. In contrast to algorithmic perspective popular in the literature, we take a mean-field approach and formulate the problem as a continuous-time deterministic optimal control problem. We show that the optimal strategy for the seller has a simple structure and can take both forms, namely, influence-and-exploit and exploit-and-influence. We also show that in some cases it may optimal for the seller to deploy incentive programs mostly for low degree nodes. We support our theoretical results through numerical studies and provide practical insights by analyzing various scenarios.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We analytically study the role played by the network topology in sustaining cooperation in a society of myopic agents in an evolutionary setting. In our model, each agent plays the Prisoner's Dilemma (PD) game with its neighbors, as specified by a network. Cooperation is the incumbent strategy, whereas defectors are the mutants. Starting with a population of cooperators, some agents are switched to defection. The agents then play the PD game with their neighbors and compute their fitness. After this, an evolutionary rule, or imitation dynamic is used to update the agent strategy. A defector switches back to cooperation if it has a cooperator neighbor with higher fitness. The network is said to sustain cooperation if almost all defectors switch to cooperation. Earlier work on the sustenance of cooperation has largely consisted of simulation studies, and we seek to complement this body of work by providing analytical insight for the same. We find that in order to sustain cooperation, a network should satisfy some properties such as small average diameter, densification, and irregularity. Real-world networks have been empirically shown to exhibit these properties, and are thus candidates for the sustenance of cooperation. We also analyze some specific graphs to determine whether or not they sustain cooperation. In particular, we find that scale-free graphs belonging to a certain family sustain cooperation, whereas Erdos-Renyi random graphs do not. To the best of our knowledge, ours is the first analytical attempt to determine which networks sustain cooperation in a population of myopic agents in an evolutionary setting.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper studies the impact of exclusive contracts between a content provider (CP) and an internet service provider (ISP) in a nonneutral network. We consider a simple linear demand function for the CPs. We studywhen an exclusive contract is benefcial to the colluding pair and evaluate its impact on the noncolluding players at equilibrium. For the case of two CPs and one ISP we show that collusion may not always be benefcial. We derive an explicit condition in terms of the advertisement revenues of the CPs that tells when a collusion is proftable to the colluding entities.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Infinite horizon discounted-cost and ergodic-cost risk-sensitive zero-sum stochastic games for controlled Markov chains with countably many states are analyzed. Upper and lower values for these games are established. The existence of value and saddle-point equilibria in the class of Markov strategies is proved for the discounted-cost game. The existence of value and saddle-point equilibria in the class of stationary strategies is proved under the uniform ergodicity condition for the ergodic-cost game. The value of the ergodic-cost game happens to be the product of the inverse of the risk-sensitivity factor and the logarithm of the common Perron-Frobenius eigenvalue of the associated controlled nonlinear kernels. (C) 2013 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider a discrete time partially observable zero-sum stochastic game with average payoff criterion. We study the game using an equivalent completely observable game. We show that the game has a value and also we present a pair of optimal strategies for both the players.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This work assesses the performance of small biogas-fuelled engines and explores high-efficiency strategies for power generation in the very low power range of less than 1000 W. Experiments were performed on a small 95-cc, single-cylinder, four-stroke spark-ignition engine operating on biogas. The engine was operated in two modes, i.e., `premixed' and `fuel injection' modes, using both single and dual spark plug configurations. Measurements of in-cylinder pressure, crank angle, brake power, air and fuel flow rates, and exhaust emissions were conducted. Cycle-to-cycle variations in engine in-cylinder pressure and power were also studied and assessed quantitatively for various loading conditions. Results suggest that biogas combustion can be fairly sensitive to the ignition strategies thereby affecting the power output and efficiency. Further, results indicate that continuous fuel injection shows superior performance compared to the premixed case especially at low loads owing to possible charge stratification in the engine cylinder. Overall, this study has demonstrated for the first time that a combination of technologies such as lean burn, fuel injection, and dual spark plug ignition can provide highly efficient and stable operation in a biogas-fuelled small S.I. engine, especially in the low power range of 450-1000W. (C) 2014 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Elaborate male traits with no apparent adaptive value may have evolved through female mate discrimination. Tusks are an elaborate male-only trait in the Asian elephant that could potentially influence female mate choice. We examined the effect of male body size, tusk possession and musth status on female mate choice in an Asian elephant population. Large/musth males received positive responses from oestrous females towards courtship significantly more often than did small/non-musth males. Young, tusked non-musth males attempted courtship significantly more often than their tuskless peers, and received more positive responses (though statistically insignificant) than did tuskless males. A positive response did not necessarily translate into mating because of mate-guarding by a dominant male. Female elephants appear to choose mates based primarily on traits such as musth that signal direct fertility benefits through increased sperm received than for traits such as tusks that may signal only indirect fitness benefits.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We propose a new approach to clustering. Our idea is to map cluster formation to coalition formation in cooperative games, and to use the Shapley value of the patterns to identify clusters and cluster representatives. We show that the underlying game is convex and this leads to an efficient biobjective clustering algorithm that we call BiGC. The algorithm yields high-quality clustering with respect to average point-to-center distance (potential) as well as average intracluster point-to-point distance (scatter). We demonstrate the superiority of BiGC over state-of-the-art clustering algorithms (including the center based and the multiobjective techniques) through a detailed experimentation using standard cluster validity criteria on several benchmark data sets. We also show that BiGC satisfies key clustering properties such as order independence, scale invariance, and richness.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The classical Erdos-Szekeres theorem states that a convex k-gon exists in every sufficiently large point set. This problem has been well studied and finding tight asymptotic bounds is considered a challenging open problem. Several variants of the Erdos-Szekeres problem have been posed and studied in the last two decades. The well studied variants include the empty convex k-gon problem, convex k-gon with specified number of interior points and the chromatic variant. In this paper, we introduce the following two player game variant of the Erdos-Szekeres problem: Consider a two player game where each player playing in alternate turns, place points in the plane. The objective of the game is to avoid the formation of the convex k-gon among the placed points. The game ends when a convex k-gon is formed and the player who placed the last point loses the game. In our paper we show a winning strategy for the player who plays second in the convex 5-gon game and the empty convex 5-gon game by considering convex layer configurations at each step. We prove that the game always ends in the 9th step by showing that the game reaches a specific set of configurations.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider a system with multiple Femtocells operating in a Macrocell. The transmissions in one Femtocell interfere with its neighboring Femtocells as well as with the Macrocell Base Station. We model Femtocells as selfish nodes and the Macrocell Base Station protects itself by pricing subchannels for each usage. We use Stackelberg game model to study this scenario and obtain equilibrium policies that satisfy certain quality of service.