Chapter
COMMUTATIVITY OF RINGSWITH CONSTRAINTS ON NILPOTENTSAND THE JACOBSON RADICAL
DECOMPOSABILITY OF ITERATEDEXTENSIONS∗
1. Invariance of Symbolic Powers of Certain Ideals
2. Decomposability of the Iterated Extension Rings
SOME ASPECTS OF A PURE THEORYOF BARGAINING: PLAYERS, INFORMATION,EQUILIBRIUM AND VOTING POWER
3. The Complete Information Setting
4. The Incomplete Information Setting
4.1. The Incomplete Information Setting without Intermediary
4.2. Incomplete Information Setting and Intermediary Given Veto Power
LIMITS AT INFINITY OF GENERALIZEDRIESZ POTENTIALS
PHASE OPERATOR ON ADEFORMED HILBERT SPACE
2. Preliminaries and Notations
4.2. Completeness of Phase Vectors
4.4.1. Incoherent Vectors
4.4.3. Coherent Phase Vectors
5. Phase Measurement Statistics
5.1. Probability Operator Measure
GALOIS THEORYOF GRADED FIELDS∗
SELF SIMILAR ISOTHERMAL EXPANSIONOF MAGNETO-HYDRODYNAMIC GASBEHIND A SPHERICAL SHOCK WAVEWITH SELF GRAVITATION
Basic Equations and Boundary Conditions
CLASSIFICATION OF THE 5-DIMENSIONALPOWER-ASSOCIATIVE 2nd-ORDERBERNSTEIN ALGEBRAS
2. Jordan and Power-Associative 2nd-order Bernstein Algebras
3. Classification in Dimension 5
3.1. Power-associative 2nd-order Bernstein Algebras of Type (1,4)
3.2. Power-associative 2nd-order Bernstein Algebras of Type (2,3)
3.3. Power-associative 2nd-order Bernstein Algebras of Type (3,2)
A DUAL APPROACHTO ALPHA-REGULARITY
2. Subgroups of the Schur Multiplier
LIMIT CYCLE IN FRACTIONALDIFFERENTIAL SYSTEMS
3. Melnikove Function Reduce to Abelian Function orRiemann-Liouville Function
4. Limit Cycles in Fractional Differential Systems
THE HALF-FACTORIAL PROPERTY IN THE RINGA+XI[X] WHERE A IS A UFR
2. Half-Factorial Property
SOME DIOPHANTINE EQUATIONSASSOCIATED TO SEMINORMALCOHEN-KAPLANSKY DOMAINS
2. Basic Results on CK Domains
3. Characterization of Seminormal CK Domains
4. On the Number of Solutions of a System of Two SpecialDiophantine Equations
5. On the Asymptotic Behaviour of the Number of DistinctFactorizations into Atoms in a Seminormal CK Domain
ON INTEGRALLY CLOSEDGOING-DOWN RINGS
COMPUTATIONALOF THE INTEGRAL CLOSURE
NEGACYCLIC CODESOF LENGTH 2e OVER Z4
COOPERATIVE STOCHASTIC GAMESIN STATIONARY STRATEGIES
2. One Leader, n Non-cooperative Followers
3. One Leader, n Cooperative Followers
4. Two Leaders Play a Non-cooperative Game
CONJUGATE–SET GAME FOR A NONLINEARPROGRAMMING PROBLEM∗
DYNKIN’S STOPPING GAMES WITH ZERO PAYOFFSFOR SEPARATE STOPPING
2. Superharmonic and Subharmonic Functions.Martin Boundaries
3. Properties of Randomized Stopping Strategies
4. Optimality Equations and Games with Zero Values
5. Games with Transitive Strategies
6. Games with Nontransitive and Nonstopping Strategies
AN INVESTMENT ALLOCATION GAMEWITH A COST
4. Solution of the Two Firms Game
6. Stackelberg Equilibrium
AN OPTIMAL INSURANCE POLICYIN THE INDIVIDUALRISK MODEL SEEN AS A BARGAINING GAME
2. The Individual Risk Model as a Bargaining Game
3. Pareto-optimal Policies
4. Constructing a Nash’s Solution
5. Constructing a Kalai-Smorodinsky’s Solution
A FISHERY GAME MODELWITH MIGRATION:RESERVED TERRITORY APPROACH
2.1. Nash Optimal Solution
3. Model Over an Infinite Horizon
4.1. Stackelberg Optimal Solution
NON-HIERARCHICAL SIGNALLING:TWO-STAGE FINANCING GAME
2.2. Asymmetric Information
THREE-PLAYER GAMEOF ‘KEEP-OR-EXCHANGE’
1. Three-Player Games of ‘ Score Showdown’
2. Keep-or-Exchange —Two-Player Game
3. Keep-or-Exchange —Three-Player Game
4. Simultaneous-Move Game
DYNAMIC NONCOOPERATIVE R&DIN DUOPOLY WITH SPILLOVERSAND TECHNOLOGY GAP∗
2. D’Aspremont and Jacquemin (AJ) Revisited -The Static Case
4. A General Model of Dynamic R&Dwith Endogenous Spillovers
5. Summary and Concluding Remarks
6.1. Derivations of (13) and (14)
6.2. Proof for Proposition 2.1
6.4. Proof for Proposition 3.1
MATHEMATICS OF THE JIPTOAND THEORY OF THE PURSUIT
2. The Particularity of the JIPTO
3. Classification of the Versions
5. Modeling of the Strategies
6. Sources of the Irresolute Problems
7. Mathematics of the JIPTO and Differential Games
INVESTMENT DECISIONS UNDER UNCERTAINTYAND EVALUATION OF AMERICAN OPTIONS
2. Formulation of the Problem
3. The Option Value for Projects with Zero Volatilities
4. Properties of the Exercise Region Boundary
5. Upper Bound for the Option Value
ON A CONTINUOUS DYNAMICSTRATEGIC MARKET GAME
2. Model and the Main Result
DISTORTION OF LENGTHS UNDER FUNCTIONSSTARLIKE WITH RESPECT TO A BOUNDARY POINT
SERVICE FACILITY INVENTORYSYSTEM WITHIMPATIENT CUSTOMERS∗
3.2. Steady State Analysis
4. System Performance Measures
4.1. Mean Inventory Level
6. Numerical Illustrations
CERTAIN WEAKER FORMS OF FUZZYPAIRWISE CONTINUOUS FUNCTIONSAND BIEXTENSION OF FUZZYBITOPOLOGICAL SPACES
3. Biextension of Fuzzy Bitopological Spaces
ON POLYNILPOTENT COVERING GROUPS OF APOLYNILPOTENT GROUP
1. Introduction and Motivation
THE BAER INVARIANT OF SEMIDIRECTAND VERBAL WREATH PRODUCTSOF GROUPS∗
1. Introduction and Motivation
2. Notation and Preliminaries
3. Some Results on the Baer Invariant of a Semidirect Product
4. The Baer Invariant of a Verbal Wreath Product
5. The Baer Invariant of a Free Wreath Product
A CHARACTERIZATION OFCOMMUTATIVE CLEAN RINGS∗
2. All Rings Are Commutative and with Identity
3. Commutative Clean Group Rings
ON ABSOLUTE MATRIX SUMMABILITY OF FOURIERSERIES AND ITS ALLIED SERIES
1. Let Σun be a given infinite series with the sequence of partial sum {sn}. Let T ≡(an,k) be an infinite triangular matrix with real constants. The sequence-to-sequencetransformation
2. Let f(t) be a periodic function, with period 2π, and be Lebesgue integrable over (-π,π). We may assume, with out loss of generality, that the constant term in the Fourierseries of f(t) is zero, so that
3. Absolute Cesaro summability of a Fourier series has been studied by variousinvestigators. In particular, the following theorems are well known :
4. For proving our Theorems, we need the following Lemmas:
5. Proof of Theorem 1. We have
SEMIREGULAR ASSOCIATIVE PAIRS
1. Definition and Basic Concepts
2. Semiregularity of the Standard Embedding
3. Preliminary Facts on Modules
4. Characterization of Semiregular Associative Pairs
MAGNETOHYDRODYNAMIC FLOW AND RADIATIONOF A RAREFIED GAS
FIRST STRONGLY GRADED MODULES#
2. First Strongly Graded Modules
SOLVING SOME HIGHER-ORDERDISCRETE DYNAMIC SYSTEMSAND APPLICATIONS
2. Some Expressions of Solutions of the System (1.2)
3. The Second-Order Discrete Systems: Simple Case
3.1. Solutions of the Homogeneous Part
3.2. Solutions of the System (3.14)
4. Study of the Discrete System (1.3): Simple Case
5. Combinatorial Solutions of (1.3)
6. Some Concluding Remarks
PROPERTY OF THE CYCLOTOMICPOLYNOMIAL
ON STRONGER FORMS OF (1,2)* QUOTIENTMAPPINGS IN BITOPOLOGICAL SPACES
3. (1,2)* α–Quotient Mappings
4. Strongly (1,2)* α-Quotient Mappings
5. (1,2)* α* – Quotient Mappings
A FURTHER INSTABILITY RESULTFOR A CERTAIN VECTOR DIFFERENTIALEQUATION OF FOURTH ORDER
1. Introduction and Statement of the Result
ON THE REGULARITY OF MAGNETIC FLUXFUNCTION IN NUCLEAR FUSION
2. Mathematical Model of an Axi-symmetric Equilibrium Statefor the Plasma in a Tokamak
2.1. Equilibrium of Plasma in Magnetic Field
2.2. Slow Evolution of a Quasi-Equilibrium Plasma-Vacuum System
3. Smooth Variational Structures and Modified Lagrange MultiplierRule with a Functional Constraint
4. A State of Equilibrium of Plasma Flow in Nuclear Fusion
COLLISION ORBITS FOR N-BODY PROBLEMSWITH FIXED ENERGY
1. Introduction and Main Results
2. The Proof of Theorem 1.1 and Theorem 1.2
GRAPH SEARCHING PROBLEMSWITH THE COUNTERACTION
2. Statement of the Problem
3. Theorems on -search Numbers
COMPETITION FOR STAFFBETWEEN TWO DEPARTMENTS
3. The Dominant Firm Problem
4. The One and Two Applicant Games with No CandidatePreference
5. The General Game with No Candidate Preference
6. Discussion of the Results
A COMPETITIVE PREDICTIONNUMBER GAME
EFFICIENCY OF BERTRANDAND COURNOT UNDER PRECOMMITMENT
5. Comparison of Equilibria
ONE APPROACH TO SOLUTIONOF COMPLEX GAME PROBLEMS
2. Using Effect of Information Delay for Solution of the LinearEvolutionary Game with Perfect Information
A DIFFERENTIAL GAMEWITH INVESTMENT IN TRANSPORTAND COMMUNICATION R&D
3.1. Degenerate Markov Perfect Nash Equilibrium
4.1. Open-Loop Nash Equilibrium
4.2. Closed-Loop Nash Equilibrium
5. Social Optimum andWelfare Appraisal
Appendix 1: Proof of Proposition 1
Appendix 3: Proof of Proposition 2
TIME–CONSISTENCY AND THE PROBLEMOF MINIMAL REDUCTION
3. Formulation of Minimal Reduction Problem
4. Conditionally Minimal Coalition
CONCEPT OF SOLUTIONFOR A STRATEGIC COOPERATIVE GAMEINVOLVING UNKNOWN PARAMETERS
2. The Statement of the Problem
3. The Concept of the w-Equilibrium
4. The Existence of the w-Equilibrium
5. The Determination of w-Equilibrium
ON A DISCRETE ARBITRATIONPROCEDURE IN THREE POINTS
REPEATED GAMEWITH CONSTRAINT ON THE TIMEOF OBSERVATION∗
2. Preservation of Equilibrium under Absence ofContinuous Observation
3. Dependence of Set of Situations of Equilibrium on Limitationon Time of Observation
VALUE FOR THE GAME WITHCHANGING COALITIONAL STRUCTURE
2. Dynamic Game with Changing Coalitional Partition
3. The Algorithm for Aonstructing the Solution
4. Characteristic Functions for an Associated CooperativeGame
THE REDISTRIBUTION PARADOX
2. Power Indices and Their Paradoxes
2.1. Voting Games and Power Indices
2.2. Voting Power Paradoxes
3. Power Indices for the German Parliament
4. The Paradox of Redistribution in the German Parliament
5. Paradox of New Members in German Politics
6. Agreements between Power Indices
PLAYERS’ INFORMATION IN TWO-PLAYER GAMESOF “SCORE SHOWDOWN”
1. Two-Player Game of “Score Showdown”
2. Game of “Keep-or-Exchange” under I10−01
3. Game of “Keep-or-Exchange” under I11−11
4. Game of “Keep-or-Exchange” under I10−11
5. Game of “Risky Exchange” under I10−01
6. Game of “Risky Exchange” under I11−11
7. Game of “Risky Exchange” under I10−11
8. Comparison between Theorem 16.
9. More about Games under Information I10−11.
INFINITELY REPEATEDSYMMETRIC 2 × 2-BIMATRIX GAMES
2. Symmetric 2 × 2 Bimatrix Games
3. Infinitely Repeated Bimatrix Games With Finite Players’Memory
3.2. Dynamics of the Game
3.4. Payoff Functions of the Players
4. Nash Equilibria in the Infinitely Repeated Bimatrix Gamewith m-step Memory
4.1. Nash Algorithm of Finding the Nash Equilibria
5. Hierarchical Setting of the Game
5.1. Algorithm of Constructing the Optimal Partition
5.1.1. Constructing the Initial Partition
5.1.2. Choice of the Admissible Set of Multiplicities
5.1.3. Improvement of the Leader’s Strategy in the Domain Pi
5.1.4. Survey of the Cycles
Appendix A. Nash Equilibria in the Game With 1-step Memory
Appendix B. Stackelberg Solution of Repeated SymmetricBimatrix Games With 1-step Memory
NONSYMMETRIC CONSISTENTSURPLUS SHARING METHODS
2. Surplus Sharing Methods and Their Properties
4. Path Independent Methods