A folk theorem which holds for all repeated matching games is established. The folk theorem holds any time the stage game
payoffs of any two players are not affinely equivalent. The result is independent of population size and matching rule—including
rules that depend on players choices or the history of play.
相似文献
We establish necessary and sufficient conditions for properly efficient solutions of a class of nonsmooth nonconvex optimal control problems with multiple fractional objective functions, linear dynamics, and nonlinear inequality constraints on both the state and control variables. Subsequently, we utilize these proper efficiency criteria to construct two multiobjective dual problems and prove appropriate duality theorems. Also, we specialize and discuss these results for a particular case of our principal problem which contains square roots of positivesemidefinite quadratic forms. As special cases of the main proper efficiency and duality results, this paper also contains similar results for control problems with multiple, fractional, and ordinary objective functions. 相似文献
We study the almost sure limiting behavior and convergence in probability of weighted partial sums of the form
where {Wnj, 1jn, n1} and {Xnj, 1jn, n1} are triangular arrays of random variables. The results obtain irrespective of the joint distributions of the random variables within each array. Applications concerning the Efron bootstrap and queueing theory are discussed. 相似文献
The velocity correction algorithm is used in the finite element method to solve forced convection problems between parallel plates with a triangular step, for Reynolds numbers up to 1000. Equal-order interpolation functions for velocity, pressure and temperature are used. The solutions show a smooth variation of pressure. The streamfunction, isotherms, isobars and velocity profiles are presented for a typical Reynolds number of 500. The skin friction and heat transfer results are presented for Reynolds numbers up to 1000. 相似文献
Up till now there has been no exact and effective algorithm for the problem of finding optimal cutting patterns of rectangles which are not restricted to those with the ‘guillotine’ property. This problem can be interpreted in a resource constrained scheduling context. The contribution of this paper to this topic is a good characterization of the flow functions and graphs corresponding to cutting patterns. 相似文献
In this paper we prove error estimates for a piecewise average interpolation on anisotropic rectangular elements, i.e., rectangles with sides of different orders, in two and three dimensions.
Our error estimates are valid under the condition that neighboring elements have comparable size. This is a very mild assumption that includes more general meshes than those allowed in previous papers. In particular, strong anisotropic meshes arising naturally in the approximation of problems with boundary layers fall under our hypotheses.
Moreover, we generalize the error estimates allowing on the right-hand side some weighted Sobolev norms. This extension is of interest in singularly perturbed problems.
Finally, we consider the approximation of functions vanishing on the boundary by finite element functions with the same property, a point that was not considered in previous papers on average interpolations for anisotropic elements.
As an application we consider the approximation of a singularly perturbed reaction-diffusion equation and show that, as a consequence of our results, almost optimal order error estimates in the energy norm, valid uniformly in the perturbation parameter, can be obtained.
By considering four kinds of Chebyshev polynomials, an extended set of (real) results are given for Chebyshev polynomial minimality in suitably weighted Hölder norms on [–1,1], as well as (L) minimax properties, and best L1 sufficiency requirements based on Chebyshev interpolation. Finally we establish best Lp, L and L1 approximation by partial sums of lacunary Chebyshev series of the form i=0aibi(x) where n(x) is a Chebyshev polynomial and b is an odd integer 3. A complete set of proofs is provided. 相似文献
Given a finite set
in a linear space X, we consider two problems. The first problem consists of finding the points minimizing the maximum distance to the points in A; the second problem looks for the points that minimize the average distance to the points in A. In both cases, we assume that the distances at different points are defined as
with norms
defined on X. The use of different norms to measure distances from different points allows us to extend some results that hold in the single-norm case, while some strange and rather unexpected facts arise in the general case.The research of the first author was supported by the Italian National Group GNAMPA.The research of the second author was supported by the Spanish Ministry of Science and Technology through Grant BFM2001-2378, MTM2004:0909 相似文献