We apply a commodity-money refinement to matching models in which people meet in pairs and buyers make take-it-or-leave-it offers to sellers. The refinement is applied by attaching a utility value to nominal money and letting that value approach zero. An equilibrium satisfies the refinement if it is such a limit. We show that the refinement eliminates a class of non full-support steady states. ...

When intelligent systems are deployed into a real-world application, then the maintenance and the refinement of the knowledge are essential tasks. Many existing automatic knowledge refinement methods only provide limited control and clarification capabilities during the refinement process. In this paper, we present a novel user-guided approach for the refinement of knowledge bases using subgrou...

Refinement in bisimulation semantics is defined differently from refinement in failure semantics: in bisimulation semantics refinement is based on simulations between labelled transition systems, whereas in failure semantics refinement is based on inclusions between failure systems. There exist however pairs of refinements, for bisimulation and failure semantics respectively, that have almost t...

In this paper we consider CSP stable failures refinement checks, where the right hand side of the refinement contains n copies of a process P . We show that such refinement checks capture precisely those predicates of the form ∀ f1, . . . , fn ∈ failures(P ) q R(f1, . . . , fn) for some n-ary relation R. The construction of the refinement test is, in general, infinitary; however, we show how, g...

‎in this article‎, ‎we introduce a new type iterative scheme for‎ ‎approximating common fixed points of two asymptotically‎ ‎nonexpansive mappings is defined‎, ‎and weak and strong convergence‎ ‎theorem are proved for the new iterative scheme in a uniformly‎ ‎convex banach space‎. ‎the results obtained in this article‎ ‎represent an extension as well as refinement of previous known‎ ‎resu...

The refinement of tetrahedral meshes is a significant task in many numerical and discretizations methods. The computational aspects for implementing refinement of meshes with complex geometry need to be carefully considered in order to have real-time and optimal results. In this paper we study some computational aspects of a class of tetrahedral refinement algorithms. For local adaptive refinem...

We consider the extensions of modal transition systems (MTS), namely Boolean MTS and parametric MTS and we investigate the refinement problems over both classes. Firstly, we reduce the problem of modal refinement over both classes to a problem solvable by a QBF solver and provide experimental results showing our technique scales well. Secondly, we extend the algorithm for thorough refinement of...

we consider the numerical approximation of a singularly perturbed reaction-diffusion problem over a square. Two different. approaches are compared namely: adaptive isotropic mesh refinement and anisotropic mesh refinement. Thus, we compare the h-refinement and the Shishkin mesh approaches numerically with PLTMG software [l]. It is shown how isotropic elements lead to over-refinement. and how an...

In this article we present a strategy to formalize frequently occurring forms of refinement that take place in UML model construction. Such strategy consists in recognizing a set of well founded refinement structures in a formal language which are then immersed into a UML-based development, giving origin to a set of UML refinement patterns. Apart from providing semi-formal evidence on the prese...