On a finite element method for three‐dimensional unsteady compressible viscous flows

In this article we analyze a finite element method for three‐dimensional unsteady compressible Navier‐Stokes equations. We prove the existence and uniqueness of the numerical solution, and obtain a priori error estimates uniform in time. Numerical computations are carried out to test the orders of accuracy in the error estimates. Blend function interpolations are applied in the calculation of numerical integrations. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 432–449, 2004.     

On Mixed Error Estimates for Elliptic Obstacle Problems

We establish in this paper sharp error estimates of residual type for finite element approximation to elliptic obstacle problems. The estimates are of mixed nature, which are neither of a pure a priori form nor of a pure a posteriori form but instead they are combined by an a priori part and an a posteriori part. The key ingredient in our derivation for the mixed error estimates is the use of a new interpolator which enables us to eliminate inactive data from the error estimators. One application of our mixed error estimates is to construct a posteriori error indicators reliable and efficient up to higher order terms, and these indicators are useful in mesh-refinements and adaptive grid generations. In particular, by approximating the a priori part with some a posteriori quantities we can successfully track the free boundary for elliptic obstacle problems.     

A Cooperative Search Method for the <Emphasis Type="Italic">k</Emphasis>-Coloring Problem

In this paper, a cooperative search method, based on a multi-agent structure is developed to deal with the k-coloring problem. Three agents coordinate using an adaptive memory, a search agent, an intensification agent and a diversification agent. We use the results of a preliminary fitness landscape study to adjust the navigation strategy in the solution space and to fix the search parameters. Our method provides competitive results and it is fast when compared with best existing techniques on instances extracted from the second DIMACS challenge.      

Effort Games and the Price of Myopia

We consider Effort Games, a game‐theoretic model of cooperation in open environments, which is a variant of the principal‐agent problem from economic theory. In our multiagent domain, a common project depends on various tasks; carrying out certain subsets of the tasks completes the project successfully, while carrying out other subsets does not. The probability of carrying out a task is higher when the agent in charge of it exerts effort, at a certain cost for that agent. A central authority, called the principal, attempts to incentivize agents to exert effort, but can only reward agents based on the success of the entire project. We model this domain as a normal form game, where the payoffs for each strategy profile are defined based on the different probabilities of carrying out each task and on the boolean function that defines which task subsets complete the project, and which do not. We view this boolean function as a simple coalitional game, and call this game the underlying coalitional game. We suggest the Price of Myopia (PoM) as a measure of the influence the model of rationality has on the minimal payments the principal has to make in order to motivate the agents in such a domain to exert effort. We consider the computational complexity of testing whether exerting effort is a dominant strategy for an agent, and of finding a reward strategy for this domain, using either a dominant strategy equilibrium or using iterated elimination of dominated strategies. We show these problems are generally #P‐hard, and that they are at least as computationally hard as calculating the Banzhaf power index in the underlying coalitional game. We also show that in a certain restricted domain, where the underlying coalitional game is a weighted voting game with certain properties, it is possible to solve all of the above problems in polynomial time. We give bounds on PoM in weighted voting effort games, and provide simulation results regarding PoM in another restricted class of effort games, namely effort games played over Series‐Parallel Graphs (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Error analysis of the L2 least‐squares finite element method for incompressible inviscid rotational flows

In this article we analyze the L² least‐squares finite element approximations to the incompressible inviscid rotational flow problem, which is recast into the velocity‐vorticity‐pressure formulation. The least‐squares functional is defined in terms of the sum of the squared L² norms of the residual equations over a suitable product function space. We first derive a coercivity type a priori estimate for the first‐order system problem that will play the crucial role in the error analysis. We then show that the method exhibits an optimal rate of convergence in the H¹ norm for velocity and pressure and a suboptimal rate of convergence in the L² norm for vorticity. A numerical example in two dimensions is presented, which confirms the theoretical error estimates. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2004     

Finite‐volume schemes for Friedrichs systems in multiple space dimensions: A priori and a posteriori error estimates

We consider a class of finite‐volume schemes on unstructured meshes for symmetric hyperbolic linear systems of balance laws in two and three space dimensions. This class of schemes has been introduced and analyzed by Vila and Villedieu ( 5 ). They have proven an a priori error estimate for approximations of smooth solutions. We extend the results to weak solutions. This is the base to derive an a posteriori error estimate for finite‐volume approximations of weak solutions. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

Single dopant diffusion in semiconductor technology

The paper deals with the analysis of pair diffusion models in semiconductor technology. The underlying model contains reaction‐drift‐diffusion equations for the mobile point defects and dopant‐defect pairs as well as reaction equations for immobile dopants which are coupled with a non‐linear Poisson equation for the chemical potential of the electrons. For homogeneous structures we present an existence and uniqueness result for strong solutions. Starting with energy estimates we derive further a priori estimates such that fixed point arguments due to Leray–Schauder guarantee the solvability of the model equations. Copyright © 2004 John Wiley & Sons, Ltd.     

Efficient computation of the exponential operator for large,sparse, symmetric matrices

In this paper we compare Krylov subspace methods with Chebyshev series expansion for approximating the matrix exponential operator on large, sparse, symmetric matrices. Experimental results upon negative‐definite matrices with very large size, arising from (2D and 3D) FE and FD spatial discretization of linear parabolic PDEs, demonstrate that the Chebyshev method can be an effective alternative to Krylov techniques, especially when memory bounds do not allow the storage of all Ritz vectors. We also discuss the sensitivity of Chebyshev convergence to extreme eigenvalue approximation, as well as the reliability of various a priori and a posteriori error estimates for both methods. Copyright © 2000 John Wiley & Sons, Ltd.     

On the existence of incompressible current–vortex sheets: study of a linearized free boundary value problem

We study the initial boundary value problem resulting from the linearization of the equations of ideal incompressible magnetohydrodynamics and the jump conditions on the hypersurface of tangential discontinuity (current–vortex sheet) about an unsteady piecewise smooth solution. Under some assumptions on the unperturbed flow, we prove an energy a priori estimate for the linearized problem. Since the so‐called loss of derivatives in the normal direction to the boundary takes place even for the constant coefficients linearized problem, for the variable coefficients problem and non‐planar current–vortex sheets the natural functional setting is provided by the anisotropic weighted Sobolev space W₂^1,σ. The result of this paper is a necessary step to prove the local in time existence of solutions of the original non‐linear free boundary value problem. The uniqueness of the regular solution of this problem follows already from the a priori estimate we obtain for the linearized problem. Copyright © 2005 John Wiley & Sons, Ltd.     

Distributed subgradient method for multi‐agent optimization with quantized communication

This paper focuses on a distributed optimization problem associated with a time‐varying multi‐agent network with quantized communication, where each agent has local access to its convex objective function, and cooperatively minimizes a sum of convex objective functions of the agents over the network. Based on subgradient methods, we propose a distributed algorithm to solve this problem under the additional constraint that agents can only communicate quantized information through the network. We consider two kinds of quantizers and analyze the quantization effects on the convergence of the algorithm. Furthermore, we provide explicit error bounds on the convergence rates that highlight the dependence on the quantization levels. Finally, some simulation results on a l₁‐regression problem are presented to demonstrate the performance of the algorithm. Copyright © 2016 John Wiley & Sons, Ltd.     

Claw‐free 3‐connected P11‐free graphs are hamiltonian

We show that every 3‐connected claw‐free graph which contains no induced copy of P₁₁ is hamiltonian. Since there exist non‐hamiltonian 3‐connected claw‐free graphs without induced copies of P₁₂ this result is, in a way, best possible. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 111–121, 2004     

On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries

This paper is concerned with techniques for identifying simple and quantified lattice points in 2SAT polytopes. 2SAT polytopes generalize the polyhedra corresponding to Boolean 2SAT formulas, Vertex‐Packing (Covering, Partitioning) and Network flow problems; they find wide application in the domains of Program verification (Software Engineering) and State‐Space search (Artificial Intelligence). Our techniques are based on the symbolic elimination strategy called the Fourier‐Motzkin elimination procedure and thus have the advantages of being extremely simple (from an implementational perspective) and incremental. We also provide a characterization of a 2SAT polytope in terms of its extreme points and derive some interesting hardness results for associated optimization problems. Finally, we provide a brief discussion on the maximum size of a subdeterminant of the linear system representing a 2SAT polytope; this parameter plays a vital role in deriving analytical bounds on the size of the search space for checking whether the polyhedron includes a lattice point. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

New global a priori estimates for the third‐grade fluid equations

This note bridges the gap between the existence and regularity classes for the third‐grade Rivlin–Ericksen fluid equations. We obtain a new global a priori estimate, which conveys the precise regularity conditions that lead to the existence of a global in time regular solution. Copyright © 2006 John Wiley & Sons, Ltd.     

A Riesz–Feller space‐fractional backward diffusion problem with a time‐dependent coefficient: regularization and error estimates

In this paper, we consider a Riesz–Feller space‐fractional backward diffusion problem with a time‐dependent coefficient We show that this problem is ill‐posed; therefore, we propose a convolution regularization method to solve it. New error estimates for the regularized solution are given under a priori and a posteriori parameter choice rules, respectively. Copyright © 2016 John Wiley & Sons, Ltd.     

Cooperation in bike racing—When to work together and when to go it alone

We present an agent‐based model of bicycle racing that incorporates both physiology and the types of multiplayer scenarios that arise in real races. In these scenarios, riders can choose to share the workload with other riders (cooperate) or pursue their own self‐interests (defect). We compare the model's predictions to race situations and use it to investigate how different strategies can affect outcomes. We find that an individual player's best strategy depends on fitness level: below‐average riders fare better as defectors whereas above‐average riders perform better as cooperators. The strategies of stronger riders affect their teammates' results as well. The teammates of defecting strong riders fare worse overall than the teammates of cooperating strong riders. These results reproduce a dynamic that played out in the 2009 Tour de France. The winner, Alberto Contador, pursued a strategy perceived by many to be unusually uncooperative by repeatedly defecting on his teammates. The strategy worked to his advantage but may have negatively affected his teammates' placements. © 2011 Wiley Periodicals, Inc. Complexity, 17,39–44, 2011     

Analyzing Risky Choices: Q‐learning for Deal‐No‐Deal

In this paper, we derive an optimal strategy for the popular Deal or No Deal game show. To do this, we use Q‐learning methods, which quantify the continuation value inherent in sequential decision making in the game. We then analyze two contestants, Frank and Susanne, risky choices from the European version of the game. Given their choices and our optimal strategy, we find what their implied bounds would be on their levels of risk aversion. Previous empirical evidence in risky decision making has suggested that past outcomes affect future choices and that contestants have time‐varying risk aversion. We demonstrate that the strategies of Frank and Susanne are consistent with constant risk aversion levels except for their final risk‐seeking choice. We conclude with directions for future research. Copyright © 2013 John Wiley & Sons, Ltd.     

Action learning versus strategy learning

This article seeks to ascertain whether the strategy‐learning model of Hanaki, Sethi, Erev, and Peterhansl (2003) better accounts for observed behavior than do the various action‐learning models. It does so by measuring the goodness‐of‐fit of the models' predictions against published experimental results for such games as Coordination, Prisoner's Dilemma, and Chicken. The fit is measured via the mean squared deviation (MSD) between the observed behavior and the one predicted by the model. The results show that, for Chicken, the strategy‐learning model fits the observed data much better than do the action‐learning models. The best action‐learning model, on the other hand, fits the observed data well in Coordination. Overall, the strength of the strategy‐learning model is best shown in games where alternations between the two stage‐game Nash equilibria are often observed in the laboratory experiments. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–50, 2004     

Agent‐based simulation of an N‐person game with parabolic payoff functions

We report computer simulation experiments based on our agent‐based simulation tool to model a new N‐person game based on John Conway's Game of Life. The individual agents may choose between two behavior options: cooperation or defection. The payoff (reward/penalty) functions are given as two parabolas: one for each option. After a certain number of iterations, the behavior of the agents stabilizes to either a constant value or oscillates around such a value. The simulation's goal is to investigate the effects of intermediate behavior on a society of agents. We have performed a systematic investigation of this game for all six possible cases of the mutual positions of parabolic payoff functions crossing each other at two points: x = 0.3 and 0.7 where x is the ratio of the cooperation choice to the total number of agents in the agent's neighborhood. The global ratios X(t) of the total number of cooperators in the entire array of agents as functions of time (iterations) and the solutions of the game X_final as functions of X₀ were observed for each case for Pavlovian, greedy, and conformist agents. The solutions have predictable tendencies only when the neighborhood is the entire array of greedy or conformist agents. In all other cases unexpected properties emerge. © 2009 Wiley Periodicals, Inc. Complexity, 2010     

Quantum logics with the Riesz Interpolation Property

We study the quantum logics which satisfy the Riesz Interpolation Property. We call them the RIP logics. We observe that the class of RIP logics is considerable large—it contains all lattice quantum logics and, also, many (infinite) non‐lattice ones. We then find out that each RIP logic can be enlarged to an RIP logic with a preassigned centre. We continue, showing that the “nearly” Boolean RIP logics must be Boolean algebras. In a somewhat surprising contrast to this, we finally show that the attempt for the σ‐complete formulation of this result fails: We show by constructing an example that there is a non‐Boolean nearly Boolean σ‐RIP logic. As a result, there are interesting σ‐RIP logics which are intrinsically close to Boolean σ‐algebras. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Lattice ordered effect algebras

The purpose of this paper is to discuss some structural properties of lattice ordered effect algebras. We will use these structural properties to find certain lattices and classes of lattices that do not admit an effect algebra structure. Finally, using these structural properties, we will show that if L is the face lattice of a convex polytope in $ R^3 $ with more than 3 vertices, then L does not admit an effect algebra structure.Dedicated to the memory of Gian-Carlo Rota