In this paper a variable neighborhood search approach as a method for solving combinatory optimization problems is presented. A variable neighborhood search based algorithm for solving the problem concerning the university course timetable design has been developed. This algorithm is used to solve the real problem regarding the university course timetable design. It is compared with other algor...

Modal logics for reasoning about the power of coalitions capture the notion of effectivity functions associated with game forms. The main goal of coalition logics is to provide formal tools for modeling the dynamics of a game frame whose states may correspond to different game forms. The two classes of effectivity functions studied are the families of playable and truly playable effectivity fun...

We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}ψ]φ expressing that the coalition of all agents satisfying ψ(x) can achieve a state in which φ holds. We use neighborhood semantics to model extensive games of perfect information with simultaneous actions and we provide a framework reasoning about agents in the same way as it is rea...

In this paper, for a complete residuated lattice L, we present the categorical properties of ?-neighborhood spaces and their relationships to neighborhood stratified L-neighborhood spaces. The main results are: (1) category is topological category; (2) can be embedded in as reflective subcategory, when L meet-continuous lattice, subcategory; (3) continuous (resp., spaces) simultaneously corefle...

We apply a physical based model to describe the clothes fashion market. Every time a new outlet appears on the market, it can invade the market under certain specific conditions. Hence, the “old” outlet can be completely dominated and disappears. Each creator competes for a finite population of agents. Fashion phenomena are shown to result from a collective phenomenon produced by local individu...

Given an undirected weighted graph G = (V,E) with vertex set V, edge set E and weights wi ∈ R associated to V or to E. Minimum weighted k-Cardinality tree problem (k-CARD for short) consists of finding a subtree of G with exactly k edges whose sum of weights is minimum [4]. There are two versions of this problem: vertex-weighted and edge-weighted, if weights to V or to E are associated, respect...

A systematic analysis of the effects of spatial extension on the equilibrium frequency of cooperators and defectors in 2× 2 games is presented and compared to well mixed populations where spatial extension can be neglected. We demonstrate that often spatial extension is indeed capable of promoting cooperative behavior. This holds in particular for the prisoner’s dilemma for a small but importan...

The category of von Neumann correspondences from B to C (or von Neumann B–C–modules) is dual to the category of von Neumann correspondences from C to B via a functor that generalizes naturally the functor that sends a von Neumann algebra to its commutant and back. We show that under this duality, called commutant, Rieffel’s Eilenberg-Watts theorem (on functors between the categories of represen...

The High School Timetabling Problem consists in assigning timeslots and resources to events, satisfying constraints which heavily depend on the specific institution. This work deals with the problem of the ongoing III International Timetabling Competition (ITC), which includes a diverse set of instances from many educational institutions around the world. We proposed an approach based on Simula...