نتایج جستجو برای: nash vs stackelberg game
تعداد نتایج: 346834 فیلتر نتایج به سال:
In the first part of this paper we have derived achievable transmission rates for the (single-band) interference relay channel (IRC) when the relay implements either the amplify-and-forward, decode-and-forward or estimate-andforward protocol. Here, we consider wireless networks that can be modeled by a multi-band IRC. We tackle the existence issue of Nash equilibria (NE) in these networks where...
Concepts needed in the definition of difference game problems are first studied in detail. Solutions for a general class of deterministic linear quadratic two-player nonzero-sum difference games are then developed. Nash and Stackelberg solutions for open-loop and zero-memory information structure are considered. An augmentation techniques and a dynamic programming approach are applied to obtain...
In this paper we present the extraproximal method for computing the Stackelberg/Nash equilibria in a class of ergodic controlled finite Markov chains games. We exemplify the original game formulation in terms of coupled nonlinear programming problems implementing the Lagrange principle. In addition, Tikhonov’s regularization method is employed to ensure the convergence of the cost-functions to ...
Achieving the goals of price stability, sustainable economic growth, and the improvement of many economic variables require coordination between the monetary and financial authorities. In this study, a new modified Keynesian stochastic dynamic equilibrium general equilibrium model is introduced for Iran and in the framework of game theory, optimal policy of fiscal and monetary authorities are d...
We model the coexistence of DSRC and WiFi networks as a strategic form game with networks as the players. Nodes in a DSRC network must support messaging of status updates that are time sensitive. Such nodes would like to achieve a small age of information of status updates. In contrast, nodes in a WiFi network would like to maximize their throughput. Each network chooses a medium access probabi...
We model strategic competition in a market with asymmetric information as a noncooperative game in which each firm competes for the business of a buyer of unknown type by offering the buyer a catalog of products and prices. The timing in our model is Stackelberg: in the first stage, given the distribution of buyer types known to all firms and the deducible, type-dependent best responses of the ...
We characterize equilibria of games with two properties: (i) Agents have the opportunity to adjust their strategic variable after their initial choices and before payoffs occur; but (ii) they can only add to their initial amounts. The equilibrium set consists of just the Cournot-Nash outcome, one or both Stackelberg outcomes, or a continuum of points including the Cournot-Nash outcome and one o...
We characterize equilibria of games with two properties: (i) Agents have the opportunity to adjust their strategic variable after their initial choices and before payoffs occur; but (ii) they can only add to their initial amounts. The equilibrium set consists of just the Cournot–Nash outcome, one or both Stackelberg outcomes, or a continuum of points including the Cournot– Nash outcome and one ...
This paper considers advertising, collection and pricing decisions simultaneously for a closed-loop supply chain (CLSC) with one manufacturer (he) and two retailers (she). A multiplicatively separable new demand function is proposed which influenced by pricing and advertising. In this paper, three well-known scenarios in the game theory including the Nash, Stackelberg and Cooperative games are ...
The challenge of self-optimization for orthogonal frequency-division multiple-access (OFDMA) interference channels is that users inherently compete harmfully and simultaneous water-filling (WF) would lead to a Pareto-inefficient equilibrium. To overcome this, we first introduce the role of environmental interference derivative in the WF optimization of the interactive OFDMA game and then study ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید