Search results for "Ordination"

showing 10 items of 1367 documents

Gobernanza territorial para el desarrollo sostenible : estado de la cuestión y agenda

2008

Joaquin.Farinos@uv.es La gobernanza territorial se ha convertido en el instrumento en el que se encuentran depositadas las esperanzas de una más efectiva gestión y gobierno de las políticas de desarrollo territorial. A lo largo del presente texto, en los sucesivos epígrafes, se analizan sus puntos fuertes y limitaciones; las estratégicas relaciones dialécticas –en ascendente sinergia– entre la gobernanza territorial, los objetivos de Lisboa y la cohesión territorial; porqué la planificación del desarrollo territorial sostenible es uno de los campos predilectos de aplicación de nuevas formas de gobernanza (entre ellos el Método Abierto de coordinación). Cierra el artículo una interpretación …

Territorial GovernanceTerritorial Governance ; Lisbon Strategy Territorialisation ; Lisbon Governance ; Territorial Cohesion ; Territorial Sustainable Development ; Policies Coordination ; European Union ; SpainEspañaTerritorialización de la Estrategia de Lisboa:GEOGRAFÍA::Geografía humana ::Geografía política [UNESCO]Desarrollo Territorial SostenibleTerritorial CohesionGobernanza Territorial ; Territorialización de la Estrategia de Lisboa ; Gobernanza de la Estrategia de Lisboa ; Cohesión Territorial ; Desarrollo Territorial Sostenible ; Agenda Territorial ; Coordinación de las Políticas ; Unión Europea ; EspañaTerritorial Sustainable DevelopmentGobernanza de la Estrategia de LisboaAgenda TerritorialPolicies CoordinationUnión EuropeaSpainGobernanza TerritorialLisbon Strategy TerritorialisationCohesión TerritorialEuropean UnionUNESCO::GEOGRAFÍA::Geografía humana ::Geografía políticaCoordinación de las PolíticasLisbon Governance
researchProduct

Synthesis, characterization, crystal structures and magnetic exchange in dinuclear copper complexes with 3-amino-1-propanol as terminal and bridging …

1990

Abstract The synthesis, X-ray structures and spectroscopic and magnetic properties are described for two groups of dinuclear Cu(II) compounds with the ligand 3-amino-1-propanol (Hap). The formulae of the compounds are for group A: [Cu(ap)(anion)]2, in which ap is the dehydronated Hap and the anions are formate, nitrate, chloride and bromide and for group B: [Cu(ap)(Hap)]2(anion)2, with anion = iodide, bromide, chloride, nitrate and tetrafluoroborate. The structure of group A compounds consists of dinuclear units with the co-planar centrosymmetric chromophore ANCuOO′CuNA, in which the A ligands (anions) bridge to neighbouring units as axial ligands, thereby forming infinite chains. Dimer Cu……

TetrafluoroborateCoordination sphereChemistryHydrogen bondStereochemistryLigandDimerBridging ligandCrystal structureSquare pyramidal molecular geometryInorganic Chemistrychemistry.chemical_compoundCrystallographyMaterials ChemistryPhysical and Theoretical ChemistryInorganica Chimica Acta
researchProduct

catena-[µ-Tris(1,2-bis(tetrazol-1-yl)ethane-N4,N4')iron(II)] bis(tetrafluoroborate): synthesis, structure, spectroscopic and magnetic characterizatio…

2002

In analogy to a common synthesis of 1-substituted 5-H tetrazoles (Tetrahedron Lett. 36 (1995)1759; Beloruss. Gos. Univ., Minsk, USSR. Khim. Geterotsikl. Soedin. 11 (1985) 1521; Beloruss. Gos. Univ., Minsk, USSR. Khim. Geterotsikl. Soedin. 1 (1991) 66; BGU, Belarus. Vestsi Akad. Navuk Belarusi, Ser. Khim. Navuk 1 (1992) 73), the new bidentate ligand 1,2-bis(tetrazol-1-yl)ethane [endi] was synthesized and characterized by X-ray diffraction, NMR, IR and UV–Vis spectroscopy. By using iron(II) tetrafluoroborate hexahydrate the complexation with this ligand yields a 1-dimensional linear coordination polymer similar to the recently published chain compound (Inorg. Chem. 39 (2000) 1891) exhibiting …

TetrafluoroborateSpin statesChemistryLigandCoordination polymerSpin transitionMagnetic susceptibilityInorganic ChemistryCrystallographychemistry.chemical_compoundSpin crossoverMaterials ChemistryPhysical and Theoretical ChemistrySingle crystal
researchProduct

Potentiometric study of the formation of hydroxo complexes of [Cu(terpy)]2+. Synthesis and crystal structure of [Cu(terpy) (H2O)](CF3SO3)2

1992

Two complexes of formula [Cu(terpy)(H2O)](CF3SO3)2 (1) and [Cu(terpy)(OH)]BPh4 (2) (terpy=2,2′∶6′,2″-terpyridine and BPh4=tetraphenylborate anion) have been synthesized and characterized by spectroscopic techniques. The x-ray crystal structure of (1) has been determined by x-ray diffraction. The structure is made up of [Cu(terpy)(H2O)]2+ mononuclear cations plus semi-coordinated CF3SO3 − anions. The coordination geometry around the copper atom is approximately elongated tetragonal octahedral. The oxygen atom of water and the three nitrogen atoms of terpy occupy the equatorial sites whereas the apical ones are filled by trifluoromethanesulphonate oxygen atoms. The formation of hydroxo comple…

TetraphenylborateChemistryStereochemistryMetals and AlloysCrystal structureInorganic ChemistryCrystallographychemistry.chemical_compoundOctahedronX-ray crystallographyMaterials ChemistryMoleculeTerpyridineOrganometallic chemistryCoordination geometryTransition Metal Chemistry
researchProduct

WITHIN-TEAM COMPETITION IN THE MINIMUM EFFORT COORDINATION GAME

2006

.  We report the results of an experiment on a continuous version of the minimum effort coordination game. The introduction of within-team competition significantly increases effort levels relative to a baseline with no competition and increases coordination relative to a secure treatment where the pay-off-dominant equilibrium strategy weakly dominates all other actions. Nonetheless, within-team competition does not prevent subjects from polarizing both in the efficient and the inefficient equilibria.

TheoryofComputation_MISCELLANEOUSCompetition (economics)MicroeconomicsEconomics and EconometricsNon-cooperative gameEconomicsCoordination gameBaseline (configuration management)Industrial organizationPacific Economic Review
researchProduct

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…

TheoryofComputation_MISCELLANEOUSComputer Science::Computer Science and Game TheoryCorrelated equilibriumSequential gameComputer scienceDynamic programmingSubgame perfect equilibriumsymbols.namesakeCoordination gameElectrical and Electronic EngineeringRisk dominanceFolk theoremPrice of stabilityNon-credible threatGame theoryCentipede gameImplementation theoryNon-cooperative gameInventoryNormal-form gameStochastic gameComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALComputer Science ApplicationsConsensus protocols; Dynamic programming; Game theory; InventoryConsensus protocolsZero-sum gameControl and Systems EngineeringNash equilibriumEquilibrium selectionBest responsesymbolsRepeated gameEpsilon-equilibriumConsensus protocols; Dynamic programming; Game theory; Inventory;Potential gameSolution conceptMathematical economicsGame theory
researchProduct

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…

TheoryofComputation_MISCELLANEOUSComputer Science::Computer Science and Game TheoryInventoryMulti-agent systemsStochastic gameComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALConsensus protocols; Game theory; Inventory; Multi-agent systemsOutcome (game theory)Consensus protocolssymbols.namesakeBayesian gameNash equilibriumBest responsesymbolsRepeated gameEconomicsCoordination gameMathematical economicsGame theoryGame theoryProceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
researchProduct

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.

TheoryofComputation_MISCELLANEOUSComputer Science::Computer Science and Game TheoryNon-cooperative gameMathematical optimizationStochastic gameTheoryofComputation_GENERALInventory control Stability Optimality Nash equilibriumInventory control; Nash equilibrium; Optimality; Stability;symbols.namesakeNash equilibriumBest responseRepeated gamesymbolsEconomicsCoordination gameEpsilon-equilibriumRisk dominanceMathematical economics
researchProduct

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…

TheoryofComputation_MISCELLANEOUSComputer Science::Computer Science and Game Theoryjel:Z13Economics and EconometricsMatemáticasjel:D85Heterogeneity Networks Nash Equilibrium StabilitySocial networksjel:D03MicroeconomicsCOMPLEMENTARITIESsymbols.namesakeBayesian gameEconomicsCoordination gameStrategic complementsjel:C72ComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALNetwork formationNash equilibriumEquilibrium selectionBest responsejel:L14Bayesian equilibriumsymbolsHeterogeneityEpsilon-equilibriumMathematical economicsFinanceIncomplete informationGames and Economic Behavior
researchProduct

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…

TheoryofComputation_MISCELLANEOUSDynamic gamesComputer Science::Computer Science and Game TheoryMathematical optimizationCorrelated equilibriumSequential gameConsensus ProtocolsComputer scienceA-priori; Consensus protocols; Dynamic games; Finite horizons; Inventory; Inventory systems; Joint decisions; Multi stages; Nash equilibrium; Pareto-optimal; Single stages; Unilateral improvementsSymmetric equilibriumOutcome (game theory)Joint decisionsNash equilibriumFinite horizonsMulti stagessymbols.namesakeBayesian gameSettore ING-INF/04 - AutomaticaPareto-optimalA-prioriCoordination gameFolk theoremPrice of stabilityRisk dominanceNon-credible threatConsensus Protocols Dynamic Programming Game Theory InventoryInventory systemsTraveler's dilemmaNormal-form gameStochastic gameInventoryComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALMinimaxConsensus protocolsEquilibrium selectionNash equilibriumBest responseSingle stagesRepeated gamesymbolsEpsilon-equilibriumSettore MAT/09 - Ricerca OperativaSolution conceptDynamic Programming Game TheoryUnilateral improvementsMathematical economicsGame theoryConsensus Protocols; Dynamic Programming Game Theory; Inventory
researchProduct