Efficiency-free characterizations of the Kalai–Smorodinsky bargaining solution

Roth (1977) axiomatized the Nash (1950) bargaining solution without Pareto optimality, replacing it by strong individual rationality in Nash’s axiom list. In a subsequent work (Roth, 1979) he showed that when strong individual rationality is replaced by weak individual rationality, the only solutions that become admissible are the Nash and the disagreement solutions. In this paper I derive analogous results for the Kalai–Smorodinsky (1975) bargaining solution.     

A generalization of the Egalitarian and the Kalai–Smorodinsky bargaining solutions

We characterize the class of weakly efficient n-person bargaining solutions that solely depend on the ratios of the players’ ideal payoffs. In the case of at least three players the ratio between the solution payoffs of any two players is a power of the ratio between their ideal payoffs. As special cases this class contains the Egalitarian and the Kalai–Smorodinsky bargaining solutions, which can be pinned down by imposing additional axioms.     

Duality,area-considerations,and the Kalai–Smorodinsky solution

We introduce a new solution concept for $2$-person bargaining problems, which can be considered as the dual of the Equal-Area solution (EA) (see Anbarc? and Bigelow (1994)). Hence, we call it the Dual Equal-Area solution (DEA). We show that the point selected by the Kalai–Smorodinsky solution (see Kalai and Smorodinsky (1975)) lies in between those that are selected by EA and DEA. We formulate an axiom–area-based fairness–and offer three characterizations of the Kalai–Smorodinsky solution in which this axiom plays a central role.     

A characterization of convex TU games by means of the Mas-Colell bargaining set (à la Shimomura)

Within the class of zero-monotonic games, we prove that a cooperative game with transferable utility is convex if and only if the core of the game coincides with the Mas-Colell bargaining set (à la Shimomura, in Int J Game Theory 26:283–302, 1997).     

A novel Ishikawa–Green’s fixed point scheme for the solution of BVPs

In this article, a new numerical approach is introduced for the numerical solution of a wide class of boundary value problems (BVPs). The underlying strategy of the algorithm is based on embedding an integral operator, defined in terms of Green’s function, into Ishikawa fixed point iteration scheme. The validity of the method is demonstrated by a number of examples that confirm the applicability and high efficiency of the method. The absolute error or residual error computations show that the current technique provides highly accurate approximations.     

A particle approximation of the solution of the Kushner–Stratonovitch equation

We construct a sequence of branching particle systems α _n convergent in measure to the solution of the Kushner–Stratonovitch equation. The algorithm based on this result can be used to solve numerically the filtering problem. We prove that the rate of convergence of the algorithm is of order n ^?. This paper is the third in a sequence, and represents the most efficient algorithm we have identified so far. Received: 4 February 1997 / Revised version: 26 October 1998     

A short note on the monotonicity of the Erlang C formula in the Halfin–Whitt regime

We prove a monotonicity condition satisfied by the Erlang C formula when computed in the Halfin?CWhitt regime. This property was recently conjectured in (Janssen et al., Queueing Syst. Theory Appl. 68:361?C363, 2011).     

A characterization of arithmetical invariants by the monoid of relations

The investigation and classification of non-unique factorization phenomena have attracted some interest in recent literature. For finitely generated monoids, S.T. Chapman and P. García-Sánchez, together with several co-authors, derived a method to calculate the catenary and tame degree from the monoid of relations, and they applied this method successfully in the case of numerical monoids. In this paper, we investigate the algebraic structure of this approach. Thereby, we dispense with the restriction to finitely generated monoids and give applications to other invariants of non-unique factorizations, such as the elasticity and the set of distances.     

A characterization of finite simple groups by the orders of solvable subgroups

Let G be a finite group and S be a finite simple group. In this paper, we prove that if G and S have the same sets of all orders of solvable subgroups, then G is isomorphic to S, or G and S are isomorphic to Bn(q), Cn(q), where n≥3 and q is odd. This gives a positive answer to the problem put forward by Abe and Iiyori.     

Approximative solution of the coagulation–fragmentation equation by stochastic particle systems

This paper studies stochastic particle systems related to the coagulation fragmentation equation. For a certain class of unbounded coagulation kernels and fragmentation rates, relative compactness of the stochastic systems is established and weak accumulation points are characterized as solutions. These results imply a new existence theorem. Finally a simulation algorithm based on the particle systems is proposed     

A reliable approach to the solution of Navier–Stokes equations

In this paper we will demonstrate an affective approach of solving Navier–Stokes equations by using a very reliable transformation method known as the Cole–Hopf transformation, which reduces the problem from nonlinear into a linear differential equation which, in turn, can be solved effectively.     

A mesh-free method for the numerical solution of the KdV–Burgers equation

This paper formulates a simple classical radial basis functions (RBFs) collocation (Kansa) method for the numerical solution of the nonlinear dispersive and dissipative KdV–Burgers’ (KdVB) equation. The computed results show implementation of the method to nonlinear partial differential equations. This method has an edge over traditional methods such as finite-difference and finite element methods because it does not require a mesh to discretize the problem domain, and a set of scattered nodes in the domain of influence provided by initial data is required for the realization of the method. Accuracy of the method is assessed in terms of error norms _L2,_L∞$L_2\text{,}{L}_{\infty }$, number of nodes in the domain of influence, parameter dependent RBFs and time step length. Numerical experiments demonstrate accuracy and robustness of the method for solving nonlinear dispersive and dissipative problems.     

Frankl–Füredi–Kalai Inequalities on the γ-Vectors of Flag Nestohedra

For any flag nestohedron, we define a flag simplicial complex whose f-vector is the γ-vector of the nestohedron. This proves that the γ-vector of any flag nestohedron satisfies the Frankl–Füredi–Kalai inequalities, partially solving a conjecture by Nevo and Petersen (Discrete Comput. Geom. 45:503–521, 2010). We also compare these complexes to those defined by Nevo and Petersen (Discrete Comput. Geom. 45:503–521, 2010) for particular flag nestohedra.     

Representation of the general solution of an equation of the Cauchy–Riemann type with a supersingular circle and a singular point

For a generalized system of the Cauchy–Riemann type with complex conjugation whose coefficients admit a strong singularity on a circle and a weak singularity at a point, we find an integral representation of the general solution.     

A soft version of the Knaster–Tarski fixed point theorem with applications

In this paper, first, we define a partial order on a soft set (F, A) and introduce some related concepts. Then, using the concept of a soft mapping introduced by Babitha and Sunil (Comput Math Appl 60(7):1840–1849, 2010), a soft version of Knaster–Tarski fixed point theorem is obtained. Some examples are presented to support the concepts introduced and the results proved herein. As an application of our result, we show that the soft Knaster–Tarski fixed point theorem ensures the existence of a soft common fixed point for a commuting family of order-preserving soft mappings.     

Multi-soliton solution,rational solution of the Boussinesq–Burgers equations

In this paper we consider the Boussinesq–Burgers equations and establish the transformation which turns the Boussinesq–Burgers equations into the single nonlinear partial differential equation, then we obtain an auto-Bäcklund transformation and abundant new exact solutions, including the multi-solitary wave solution and the rational series solutions. Besides the new trigonometric function periodic solutions are obtained by using the generalized tan h method.     

On the fundamental solution of the Fokker–Planck–Kolmogorov equation

The Fokker–Planck–Kolmogorov parabolic second-order differential operator is considered, for which its fundamental solution is derived in explicit form. Such operators arise in numerous applications, including signal filtering, portfolio control in financial mathematics, plasma physics, and problems involving linear-quadratic regulators.