<p style='text-indent:20px;'>Classical symplectic partitioned Runge–Kutta methods can be obtained from a variational formulation where all the terms in discrete Lagrangian are treated with same quadrature formula. We construct family of allowing use different formulas (primary and secondary) for Lagrangian. In particular, we study using Lobatto (with corresponding IIIA-B pair) as primary ...

Coalitional voting games appear in different forms in multi-agent systems, social choice and threshold logic. In this paper, the complexity of comparison of influence between players in coalitional voting games is characterized. The possible representations of simple games considered are simple games represented by winning coalitions, minimal winning coalitions, weighted voting game or a multip...

In this paper new approach to calculating power indices is described. The problem com­ plexity class is #P-complete. Constructed algorithm is a mix of ideas of two algorithms: Klinz & Woeginger partitioning algorithm and Mann & Shapley generating functions al­ gorithm. Time and space complexities of the algorithm are analysed and compared with other known algorithms for the problem. Constructed...

We summarize the foundations and applications of the new semantics called p-stable and we show that it holds the important property of extending the WFS semantics.