Search results for "Equilibrium"
showing 10 items of 1021 documents
Dicopper(II) Metallacyclophanes with N,N'-2,6-Pyridinebis(oxamate): Solution Study, Synthesis, Crystal Structures, and Magnetic Properties.
2016
The complexing ability of copper(II) in solution by the ligand N,N'-2,6-pyridinebis(oxamic acid) (H4mpyba, H4L) was determined through potentiometric and UV-vis spectroscopy at 25 °C and 0.15 M NaCl. The logarithms of the equilibrium constants for its copper(II) complexes according to the eqs 2H2L + 2Cu ⇆ [Cu2(H2L)2], 2H2L + 2Cu ⇆ [Cu2(H2L) (HL)] + H, 2H2L + 2Cu ⇆ [Cu2(HL)2] + 2H, 2H2L + 2Cu ⇆ [Cu2(HL)(L)] + 3H, and 2H2L + 2Cu ⇆ [Cu2L2] + 4H were 12.02(7), 8.04(5), 1.26(6), -7.51(6), and -16.36(6), respectively. The knowledge of the solution behavior has supported the synthesis of three new compounds bearing the common building block Cu2L2(4-). Their formulas are (Me4N)4[Cu2(mpyba)2(H2O)2]·…
Inverse Malthusianism and Recycling Economics: The Case of the Textile Industry
2020
The current use of natural resources in the textile industry leads us to introduce a new economic concept called inverse Malthusianism describing a context in which population grows linearly and resource consumption grows exponentially. Inverse Malthusianism implies an exponential increase in environmental impact that recycling may contribute to reduce. Our main goal is to extend the analysis of materials selection under the principle of equimarginality proposed by Jevons. As a first result, we show the particular circumstances under which policies excluding recycled supplies are never optimal. We also aim to overcome the difficulties of reducing environmental aspects to monetary units. To …
Optimizing channel selection for cognitive radio networks using a distributed Bayesian learning automata-based approach
2015
Consider a multi-channel Cognitive Radio Network (CRN) with multiple Primary Users (PUs), and multiple Secondary Users (SUs) competing for access to the channels. In this scenario, it is essential for SUs to avoid collision among one another while maintaining efficient usage of the available transmission opportunities. We investigate two channel access schemes. In the first model, an SU selects a channel and sends a packet directly without Carrier Sensing (CS) whenever the PU is absent on this channel. In the second model, an SU invokes CS in order to avoid collision among co-channel SUs. For each model, we analyze the channel selection problem and prove that it is a so-called "Exact Potent…
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…
Identification of efficient equilibria in multiproduct trading with indivisibilities and non-monotonicity
2018
Abstract This paper focuses on multiproduct trading with indivisibilities and where a representative agent may have non-monotonic preferences. In this framework, the set of firms’ profits (which comes from efficient subgame perfect Nash equilibria) is the Pareto frontier of some projection of the core of the game. We show that under monotonicity efficient subgame perfect Nash equilibria are achieved by single offers and the equilibrium characterization is easy to obtain. When dealing with non-monotonic preferences the problem becomes more challenging. Then, we define a pair of primal–dual linear programming problems that fully identifies the core of the game. A set of modified versions of t…
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.
Heterogeneous network games: Conflicting preferences
2013
Proceeding at: 2nd Annual UECE Lisbon Meeting: Game Theory and Applications, took place 2010, November, 4-6, in Lisbon (Portugal). The event Web site http://pascal.iseg.utl.pt/~uece/lisbonmeetings2010/ In many economic situations, a player pursues coordination or anti-coordination with her neighbors on a network, but she also has intrinsic preferences among the available options. We here introduce a model which allows to analyze this issue by means of a simple framework in which players endowed with an idiosyncratic identity interact on a social network through strategic complements or substitutes. We classify the possible types of Nash equilibria under complete information, finding two thr…
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…