Search results for "Peat"
showing 10 items of 1026 documents
Consensus in Noncooperative Dynamic Games: a Multi-Retailer Inventory Application
2008
We focus on Nash equilibria and Pareto optimal Nash equilibria for a finite horizon noncooperative dynamic game with a special structure of the stage cost. We study the existence of these solutions by proving that the game is a potential game. For the single-stage version of the game, we characterize the aforementioned solutions and derive a consensus protocol that makes the players converge to the unique Pareto optimal Nash equilibrium. Such an equilibrium guarantees the interests of the players and is also social optimal in the set of Nash equilibria. For the multistage version of the game, we present an algorithm that converges to Nash equilibria, unfortunately, not necessarily Pareto op…
Distributed Consensus in Noncooperative Inventory Games
2009
This paper deals with repeated nonsymmetric congestion games in which the players cannot observe their payoffs at each stage. Examples of applications come from sharing facilities by multiple users. We show that these games present a unique Pareto optimal Nash equilibrium that dominates all other Nash equilibria and consequently it is also the social optimum among all equilibria, as it minimizes the sum of all the players’ costs. We assume that the players adopt a best response strategy. At each stage, they construct their belief concerning others probable behavior, and then, simultaneously make a decision by optimizing their payoff based on their beliefs. Within this context, we provide a …
Consensus in inventory games
2008
This paper studies design, convergence, stability and optimality of a distributed consensus protocol for n-player repeated non cooperative games under incomplete information. Information available to each player concerning the other players' strategies evolves in time. At each stage (time period), the players select myopically their best binary strategy on the basis of a payoff, defined on a single stage, monotonically decreasing with the number of active players. The game is specialized to an inventory application, where fixed costs are shared among all retailers, interested in reordering or not from a common warehouse. As information evolves in time, the number of active players changes t…
Existence and Optimality of Nash Equilibria in Inventory Games
2005
Abstract This paper studies the stability and optimality of a distributed consensus protocol for n -player repeated non cooperative games under incomplete information. At each stage, the players choose binary strategies and incur in a payoff monotonically decreasing with the number of active players. The game is specialized to an inventory application, where fixed costs are shared among all retailers, interested in whether reordering or not from a common warehouse. The authors focus on Pareto optimality as a measure of coordination of reordering strategies, proving that there exists a unique Pareto optimal Nash equilibrium that verifies certain stability conditions.
Noncooperative dynamic games for inventory applications: A consensus approach
2008
We focus on a finite horizon noncooperative dynamic game where the stage cost of a single player associated to a decision is a monotonically nonincreasing function of the total number of players making the same decision. For the single-stage version of the game, we characterize Nash equilibria and derive a consensus protocol that makes the players converge to the unique Pareto optimal Nash equilibrium. Such an equilibrium guarantees the interests of the players and is also social optimal in the set of Nash equilibria. For the multi-stage version of the game, we present an algorithm that converges to Nash equilibria, unfortunately not necessarily Pareto optimal. The algorithm returns a seque…
Bounded Computational Capacity Equilibrium
2010
We study repeated games played by players with bounded computational power, where, in contrast to Abreu and Rubisntein (1988), the memory is costly. We prove a folk theorem: the limit set of equilibrium payoffs in mixed strategies, as the cost of memory goes to 0, includes the set of feasible and individually rational payoffs. This result stands in sharp contrast to Abreu and Rubisntein (1988), who proved that when memory is free, the set of equilibrium payoffs in repeated games played by players with bounded computational power is a strict subset of the set of feasible and individually rational payoffs. Our result emphasizes the role of memory cost and of mixing when players have bounded c…
Mean Field Linear Quadratic Games with Set Up Costs
2013
This paper studies linear quadratic games with set up costs monotonic on the number of active players, namely, players whose action is non-null. Such games arise naturally in joint replenishment inventory systems. Building upon a preliminary analysis of the properties of the best response strategies and Nash equilibria for the given game, the main contribution is the study of the same game under large population. We also analyze the influence of an additional disturbance in the spirit of the literature on H∞ control. Numerical illustrations are provided. © 2012 Springer Science+Business Media New York.
Biomimetic synthesis of the tumor-associated (2,3)-sialyl-T antigen and its incorporation into glycopeptide antigens from the mucins MUC1 and MUC4.
2004
Glycoproteins on epithelial tumor cells often exhibit aberrant glycosylation profiles. The incomplete formation of the glycan side chains resulting from a down-regulated glucosamine transfer and a premature sialylation results in additional peptide epitopes, which become accessible to the immune system in mucin-type glycoproteins. These cancer-specific structure alterations are considered to be a promising basis for selective immunological attack on tumor cells. Among the tumor-associated saccharide antigens, the (2,3)-sialyl-T antigen has been identified as the most abundant glycan, found in several different carcinoma cell lines. According to a linear biomimetic strategy, the (2,3)-sialyl…
Respiratory mechanics measured by forced oscillations during mechanical ventilation through a tracheal tube
2011
The forced oscillation technique (FOT) allows the measurement of respiratory mechanics in the intensive care setting. The aim of this study was to compare the FOT with a reference method during mechanical ventilation through a tracheal tube. The respiratory impedance spectra were measured by FOT in nine anaesthetized pigs, and resistance and compliance were estimated on the basis of a linear resistance-compliance inertance model. In comparison, resistance and compliance were quantified by the multiple linear regression analysis (LSF) of conventional ventilator waveforms to the equation of motion. The resistance of the sample was found to range from 6 to 21 cmH(2)O s l(-1) and the compliance…
Pore water velocity and ionic strength effects on DOC release from peat-sand mixtures: Results from laboratory and field experiments
2017
Organic soils are the most important source of dissolved organic carbon (DOC) in surface water. To date, most studies have focused on natural and re-wetted peatlands, but in Central Europe a large proportion of organic soils are drained and under agricultural use. Furthermore, measures such as deep ploughing or sand addition have been conducted to improve trafficability and have resulted in topsoil horizons consisting of a peat-sand mixture. Very little is known about DOC losses from such soils. Moreover, peat soils frequently feature both mobile zones, characterised by active water and solute transport, and immobile zones, which exchange solutes with the mobile zone by diffusion. Surprisin…