This note uncovers new properties of the von Neumann-Morgenstern solution in weak tournaments and majoritarian games. We propose a new procedure for the construction of choice sets from weak tournaments, based on dynamic stability criteria. The idea is to analyze dynamic versions of the tournament game introduced by Laffond, Laslier and Le Breton (1993) [The bipartisan set of a tournament game....

Abstract In the present paper, problem of estimating contingent cone to solution set associated with certain set-valued inclusions is addressed by variational analysis methods and tools. As a main result, inner (resp. outer) approximations, which are expressed in terms outer inner) prederivatives term appearing inclusion problem, provided. For evidence arises that metric increase property for m...

We show that for any roommate market the set of stochastically stable matchings coincides with the set of absorbing matchings. This implies that whenever the core is non-empty (e.g., for marriage markets), a matching is in the core if and only if it is stochastically stable, i.e., stochastic stability is a characteristic of the core. Several solution concepts have been proposed to extend the co...

a concept of weak $f$-property for a set-valued mapping is introduced‎, ‎and then under some suitable assumptions‎, ‎which do not involve any information‎ ‎about the solution set‎, ‎the lower semicontinuity of the solution mapping to‎ ‎the parametric‎ ‎set-valued vector equilibrium-like problems are derived by using a density result and scalarization method‎, ‎where the‎ ‎constraint set $k$...

The subject of this paper is to extend the diamond system, which analyses Abstract Dialectical Frameworks (adfs), such that it will be able to work with a variant of adfs called grappa (GRaph-based Argument Processing with Patterns of Acceptance). The implementation uses answer set programming encodings to analyze acceptance patterns of grappa Systems semantically.

Answer Set Solvers with Backjumping and Learning

Article history: Received 15 August 2015 Received in revised form 31 December 2015 Accepted 12 April 2016 Available online 22 April 2016