نتایج جستجو برای: sum game while non
تعداد نتایج: 2370791 فیلتر نتایج به سال:
this paper shows how game theory can be applied to modeling the interaction between government and manufacturer in implementation of cleaner production. a generic game model based upon ‘two-person non-cooperative’ static game is created to allow various strategic actions being tested by stages, and aid decision making by selecting optimal strategy for both manufacturer and policy maker to reduc...
In this paper, we investigate a non-zero-sum stochastic differential reinsurance-investment game problem between two insurers. Both insurers can purchase proportional reinsurance and invest in financial market that contains risk-free asset risky asset. We consider the insurers' wealth processes with delay to characterize bounded memory feature. For considering effec...
International trade has improved living standards but also become a major channel for spreading shocks on global scale. The increasing relevance of intersectoral linkages and in intermediates renewed interest input–output techniques. This paper enriches the literature empirical models with an input–output/econometric approach including substitution effects price spillovers. Our model shows that...
Abstract We discuss a game theoretic variant of the subset sum problem, in which two players compete for common resource represented by knapsack. Each player owns private set items, pack items alternately, and each either wants to maximize total weight his own packed into knapsack or minimize other player. show that finding best packing strategy against hostile selfish adversary is PSPACE-compl...
In this paper we present a new algorithm for negotiations in non-zero-sum games. Although games have been studied extensively, most game playing algorithms have been developed under the assumption that players do not communicate. Many real-world problems, however, can be modeled as non-zero-sum games in which players may mutually benefit if they coordinate their actions, which requires negotiat...
A given number of n applicants are to be interviewed for a position of secretary. They present themselves one-by-one in random order, all n! permutations being equally likely. Two players I and II jointly interview the i-th applicant and observe that his (or her) relative rank is y for I and z for II, relative to i − 1 applicants that have already seen (rank 1 is for the best). Each player choo...
In this paper, the problem of power control for cognitive systems is studied via game theory. The objective is to maximize the sum utility of secondary users (SUs) subject to the primary users (PUs) interference constraints, the transmission power constraints of SUs, and the signal-to-interference-plus-noise ratio (SINR) constraint of each SU. In our earlier work, the problem was formulated as ...
While the idea of a matching pennies game may seem contrived, it is merely the simplest example of a general class of zero-sum games, where the total payoff of the players is constant regardless of the outcome. Consequently gains for one player can only come from losses of the other. For this reason, zero-sum games will rarely have a pure strategy Nash equilibrium. Examples would be chess, or m...
We study new classes of games, called zero-sum equivalent games and zero-sum equivalent potential games, and prove decomposition theorems involving these classes of games. We say that two games are “strategically equivalent” if, for every player, the payoff differences between two strategies (holding other players’ strategies fixed) are identical. A zero-sum equivalent game is a game that is st...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید