On lattices from combinatorial game theory modularity and a representation theorem: finite case

We show that a self-generated set of combinatorial games, S. may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question "Is there a set which will give a non-distributive but modular lattice?" appears. A useful necessary condition for the existence of a finite non-distributive modular L(S) is proved. We show the existence of S such that L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented. (C) 2014 Elsevier B.V. All rights reserved.

Maximum-revenue tariff with different roles in a price-setting competition

Published also at Lecture Notes in Engineering and Computer Science

A tool to aid institutions recognize their employees competences acquired by informal learning

People do not learn only in formal educational institutions, but also throughout their lives, from their experiences, conversations, observations of others, exploration of the Internet, meetings and conferences, and chance encounters etc. However this informal and non-formal learning can easily remain largely invisible, making it hard for peers and employers to recognize or act upon it. The TRAILER project aims to make this learning visible so that it can benefit both the individual and the organization. The proposed demonstration will show a software solution that (i) helps the learners to capture, organize and classify a wide range of ’informal’ learning taking place in their lives, and (ii) assists the organization in recognizing this learning and use it to help managing human resources (benefiting both parts). This software tool has recently been used in two phases of pilot studies, which have run in four different European countries.