Reports de recerca
http://hdl.handle.net/2117/3094
2017-09-25T04:33:26ZThe complexity of testing properties of simple games
http://hdl.handle.net/2117/103171
The complexity of testing properties of simple games
Freixas Bosch, Josep; Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María José
Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea'' votes yield passage of the issue at hand. A collection of ``yea'' voters forms a winning coalition.
We are interested on performing a complexity analysis of problems on such games depending on the game representation. We consider four natural explicit representations, winning, loosing, minimal winning, and maximal loosing. We first analyze the computational complexity of obtaining a particular representation of a simple game from a different one. We show that some cases this transformation can be done in polynomial time while the others require exponential time. The second question is classifying the complexity for testing whether a game is simple or weighted. We show that for the four types of representation both problem can be solved in polynomial time. Finally, we provide results on the complexity of testing whether a simple game or a weighted game is of a special type. In this way, we analyze strongness, properness, decisiveness and homogeneity, which are desirable properties to be fulfilled for a simple game.
2017-03-31T15:48:07ZFreixas Bosch, JosepMolinero Albareda, XavierOlsen, MartinSerna Iglesias, María JoséSimple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea'' votes yield passage of the issue at hand. A collection of ``yea'' voters forms a winning coalition.
We are interested on performing a complexity analysis of problems on such games depending on the game representation. We consider four natural explicit representations, winning, loosing, minimal winning, and maximal loosing. We first analyze the computational complexity of obtaining a particular representation of a simple game from a different one. We show that some cases this transformation can be done in polynomial time while the others require exponential time. The second question is classifying the complexity for testing whether a game is simple or weighted. We show that for the four types of representation both problem can be solved in polynomial time. Finally, we provide results on the complexity of testing whether a simple game or a weighted game is of a special type. In this way, we analyze strongness, properness, decisiveness and homogeneity, which are desirable properties to be fulfilled for a simple game.Measuring satisfaction in societies with opinion leaders and mediators
http://hdl.handle.net/2117/101810
Measuring satisfaction in societies with opinion leaders and mediators
Molinero Albareda, Xavier; Riquelme Csori, F.; Serna Iglesias, María José
An opinion leader-follower model (OLF) is a two-action collective decision-making model for societies, in which three kinds of actors are considered:
2017-03-01T16:19:14ZMolinero Albareda, XavierRiquelme Csori, F.Serna Iglesias, María JoséAn opinion leader-follower model (OLF) is a two-action collective decision-making model for societies, in which three kinds of actors are considered:Firefighting as a Game
http://hdl.handle.net/2117/99479
Firefighting as a Game
Álvarez Faura, M. del Carme; Blesa Aguilera, Maria Josep; Molter, Hendrik
The Firefighter Problem was proposed in 1995 [16] as a deterministic discrete-time model for the spread (and containment) of a fire. Its applications reach from real fires to the spreading of deseases and the containment of floods. Furthermore, it can be used to model the spread of computer viruses or viral marketing in communication networks. In this work, we study the problem from a game-theorical perspective. Such a context seems very appropriate when applied to large networks, where entities may act and make decisions based on their own interests, without global coordination. We model the Firefighter Problem as a strategic game where there is one player for each time step who decides where to place the firefighters. We show that the Price of Anarchy is linear in the general case, but at most 2 for trees. We prove that the quality of the equilibria improves when allowing coalitional cooperation among players. In general, we have that the Price of Anarchy is in O( n / k ) where k is the coalition size. Furthermore, we show that there are topologies which have a constant Price of Anarchy even when constant sized coalitions are considered.
2017-01-17T13:25:59ZÁlvarez Faura, M. del CarmeBlesa Aguilera, Maria JosepMolter, HendrikThe Firefighter Problem was proposed in 1995 [16] as a deterministic discrete-time model for the spread (and containment) of a fire. Its applications reach from real fires to the spreading of deseases and the containment of floods. Furthermore, it can be used to model the spread of computer viruses or viral marketing in communication networks. In this work, we study the problem from a game-theorical perspective. Such a context seems very appropriate when applied to large networks, where entities may act and make decisions based on their own interests, without global coordination. We model the Firefighter Problem as a strategic game where there is one player for each time step who decides where to place the firefighters. We show that the Price of Anarchy is linear in the general case, but at most 2 for trees. We prove that the quality of the equilibria improves when allowing coalitional cooperation among players. In general, we have that the Price of Anarchy is in O( n / k ) where k is the coalition size. Furthermore, we show that there are topologies which have a constant Price of Anarchy even when constant sized coalitions are considered.A graph-semantics of business configurations
http://hdl.handle.net/2117/99474
A graph-semantics of business configurations
Fiadeiro, José Luiz; Mylonakis Pascual, Nicolás; Orejas Valdés, Fernando
In this paper we give graph-semantics to a fundamental part of the semantics of the service modeling language SRML. To achieve this goal we develop a new graph transformation system for what we call 2-level symbolic graphs. These kind of graphs extend symbolic graphs with a simple 2-level hierarchy that can be generalized to arbitrary hierarchies. We formalize the semantics using this new graph transformation system using a simple example of a trip booking agent.
2017-01-17T13:16:27ZFiadeiro, José LuizMylonakis Pascual, NicolásOrejas Valdés, FernandoIn this paper we give graph-semantics to a fundamental part of the semantics of the service modeling language SRML. To achieve this goal we develop a new graph transformation system for what we call 2-level symbolic graphs. These kind of graphs extend symbolic graphs with a simple 2-level hierarchy that can be generalized to arbitrary hierarchies. We formalize the semantics using this new graph transformation system using a simple example of a trip booking agent.Hierarchical conformance checking of process models based on event logs
http://hdl.handle.net/2117/99402
Hierarchical conformance checking of process models based on event logs
Muñoz Gama, Jorge; Carmona Vargas, Josep; Aalst, Wil M.P. van der
Process mining techniques aim to extract knowledge from event logs. Conformance checking is one of the hard problems in process mining: it aims to diagnose and quantify the mismatch between observed and modeled behavior. Precise conformance checking implies solving complex optimization problems and is therefore computationally challenging for real-life event logs. In this paper a technique to apply hierarchical conformance checking is presented, based on a state-of-the-art algorithm for deriving the subprocesses structure underlying a process model. Hierarchical conformance checking allows us to decompose problems that would otherwise be intractable. Moreover, users can navigate through conformance results and zoom into parts of the model that have a poor conformance. The technique has been implemented as a ProM plugin and an experimental evaluation showing the signicance of the approach is provided.
2017-01-17T09:43:18ZMuñoz Gama, JorgeCarmona Vargas, JosepAalst, Wil M.P. van derProcess mining techniques aim to extract knowledge from event logs. Conformance checking is one of the hard problems in process mining: it aims to diagnose and quantify the mismatch between observed and modeled behavior. Precise conformance checking implies solving complex optimization problems and is therefore computationally challenging for real-life event logs. In this paper a technique to apply hierarchical conformance checking is presented, based on a state-of-the-art algorithm for deriving the subprocesses structure underlying a process model. Hierarchical conformance checking allows us to decompose problems that would otherwise be intractable. Moreover, users can navigate through conformance results and zoom into parts of the model that have a poor conformance. The technique has been implemented as a ProM plugin and an experimental evaluation showing the signicance of the approach is provided.Fringe analysis of synchronized parallel algorithms on 2--3 trees
http://hdl.handle.net/2117/98213
Fringe analysis of synchronized parallel algorithms on 2--3 trees
Baeza-Yates, R.; Gabarró Vallès, Joaquim; Messeguer Peypoch, Xavier
We are interested in the fringe analysis of synchronized
parallel insertion algorithms on 2--3 trees, namely the algorithm of
W. Paul, U. Vishkin and H. Wagener~(PVW). This algorithm
inserts k keys into a tree of size n with parallel time O(log
n+log k).
Fringe analysis studies the distribution of the bottom subtrees
and it is still an open problem for parallel algorithms on search
trees. To tackle this problem we introduce a new kind of algorithms
whose two extreme cases upper and lower bounds the performance
of the PVW algorithm.
We extend the fringe analysis to parallel algorithms and we get a rich
mathematical structure giving new interpretations even in the
sequential case. The process of insertions is modeled by a Markov
chain and the coefficients of the transition matrix are related with
the expected local behavior of our algorithm.
Finally, we show that this matrix has a power
expansion over (n+1)^{-1} where the coefficients are the binomial
transform of the expected local behavior. This expansion shows that
the parallel
case can be approximated by iterating the sequential case.
2016-12-14T13:19:12ZBaeza-Yates, R.Gabarró Vallès, JoaquimMesseguer Peypoch, XavierWe are interested in the fringe analysis of synchronized
parallel insertion algorithms on 2--3 trees, namely the algorithm of
W. Paul, U. Vishkin and H. Wagener~(PVW). This algorithm
inserts k keys into a tree of size n with parallel time O(log
n+log k).
Fringe analysis studies the distribution of the bottom subtrees
and it is still an open problem for parallel algorithms on search
trees. To tackle this problem we introduce a new kind of algorithms
whose two extreme cases upper and lower bounds the performance
of the PVW algorithm.
We extend the fringe analysis to parallel algorithms and we get a rich
mathematical structure giving new interpretations even in the
sequential case. The process of insertions is modeled by a Markov
chain and the coefficients of the transition matrix are related with
the expected local behavior of our algorithm.
Finally, we show that this matrix has a power
expansion over (n+1)^{-1} where the coefficients are the binomial
transform of the expected local behavior. This expansion shows that
the parallel
case can be approximated by iterating the sequential case.Fringe analysis of synchronized parallel algorithms on 2--3 trees
http://hdl.handle.net/2117/98212
Fringe analysis of synchronized parallel algorithms on 2--3 trees
Baeza-Yates, R; Gabarró Vallès, Joaquim; Messeguer Peypoch, Xavier
We are interested in the fringe analysis of synchronized parallel insertion algorithms on 2—3 trees namely the algorithm of W.Paul
U. Vishkin and H. Wagener PVW. This algorithm inserts k keys into
a tree of size n with parallel time Olog n log k
Fringe analysis studies the distribution of the bottom subtrees and it is
still an open problem for parallel algorithms on search trees. To tackle
this problem we introduce a new kind of algorithms whose two extreme
cases seems to upper and lower bounds the performance of the PVW
algorithm.
We extend the fringe analysis to parallel algorithms and we get a rich
mathematical structure giving new interpretations even in the sequential
case. The process of insertions is modeled by a Markov chain and the
coecients of the transition matrix are related with the expected local
behavior of our algorithm. Finally we show that this matrix has a power
expansion over (n+1)-1 where the coecients are the binomial transform
of the expected local behavior. This expansion shows that the parallel
case can be approximated by iterating the sequential case.
2016-12-14T13:10:05ZBaeza-Yates, RGabarró Vallès, JoaquimMesseguer Peypoch, XavierWe are interested in the fringe analysis of synchronized parallel insertion algorithms on 2—3 trees namely the algorithm of W.Paul
U. Vishkin and H. Wagener PVW. This algorithm inserts k keys into
a tree of size n with parallel time Olog n log k
Fringe analysis studies the distribution of the bottom subtrees and it is
still an open problem for parallel algorithms on search trees. To tackle
this problem we introduce a new kind of algorithms whose two extreme
cases seems to upper and lower bounds the performance of the PVW
algorithm.
We extend the fringe analysis to parallel algorithms and we get a rich
mathematical structure giving new interpretations even in the sequential
case. The process of insertions is modeled by a Markov chain and the
coecients of the transition matrix are related with the expected local
behavior of our algorithm. Finally we show that this matrix has a power
expansion over (n+1)-1 where the coecients are the binomial transform
of the expected local behavior. This expansion shows that the parallel
case can be approximated by iterating the sequential case.Simple and efficient tree comparison
http://hdl.handle.net/2117/97629
Simple and efficient tree comparison
Valiente Feruglio, Gabriel Alejandro
A new distance metric for rooted trees is presented which is based on
the largest common forest of two rooted trees. The new measure is
superior to previous measures based on tree edit distance, because no
particular tree edit operations together with their costs or weights
need to be defined. The
metric can be computed in expected time linear in the number of nodes,
on rooted trees of unbounded degree, either unordered or ordered,
labeled or unlabeled. An algorithm for computing the metric is given
which is based on a simple and efficient bottom-up algorithm for finding
all common rooted subtrees in a forest.
2016-12-01T15:09:22ZValiente Feruglio, Gabriel AlejandroA new distance metric for rooted trees is presented which is based on
the largest common forest of two rooted trees. The new measure is
superior to previous measures based on tree edit distance, because no
particular tree edit operations together with their costs or weights
need to be defined. The
metric can be computed in expected time linear in the number of nodes,
on rooted trees of unbounded degree, either unordered or ordered,
labeled or unlabeled. An algorithm for computing the metric is given
which is based on a simple and efficient bottom-up algorithm for finding
all common rooted subtrees in a forest.Tree edit distance and common subtrees
http://hdl.handle.net/2117/97554
Tree edit distance and common subtrees
Valiente Feruglio, Gabriel Alejandro
The relationship between tree edit distance and maximum common
subtrees is established, showing that a tree edit distance constrained
by insertion and deletions on leaves only and by a simple condition on
the cost of the tree edit operations, corresponds to a maximum commonsubtree isomorphism, allowing thus the use of known tree edit distance algorithms to solve the maximum common subtree problem, and viceversa. Further, a tree distance based on the size of a maximum common subtree is introduced.
2016-11-30T16:31:58ZValiente Feruglio, Gabriel AlejandroThe relationship between tree edit distance and maximum common
subtrees is established, showing that a tree edit distance constrained
by insertion and deletions on leaves only and by a simple condition on
the cost of the tree edit operations, corresponds to a maximum commonsubtree isomorphism, allowing thus the use of known tree edit distance algorithms to solve the maximum common subtree problem, and viceversa. Further, a tree distance based on the size of a maximum common subtree is introduced.Exponential speedup of fixed parameter algorithms on K_{3,3}-minor-free or K_{5}-minor-free graphs
http://hdl.handle.net/2117/97525
Exponential speedup of fixed parameter algorithms on K_{3,3}-minor-free or K_{5}-minor-free graphs
Hajiaghayi, Mohammad Taghi; Demaine, Erik D.; Thilikos Touloupas, Dimitrios
We present a fixed parameter algorithm that constructively solves the
k-dominating set problem on graphs excluding one of the K_{5} or
K_3,3 as a minor in time O(3^{6sqrt{34 k}}n^{O(1)}). In fact,
we present our algorithm for any H-minor-free graph where H is
a single-crossing graph (can be drawn on the plane with at most one
crossing) and obtain the algorithm for K_{3,3} (K_{5})-minor-free
graphs as a special case. As a consequence, we extend our results to
several other problems such as vertex cover, edge dominating set,
independent set, clique-transversal set, kernels in digraphs,
feedback vertex set and a series of vertex removal problems.
Our work generalizes and extends the recent result of exponential speedup
in designing fixed-parameter algorithms on planar
graphs due to Alber et al. to other (non-planar) classes of graphs.
2016-11-30T14:35:59ZHajiaghayi, Mohammad TaghiDemaine, Erik D.Thilikos Touloupas, DimitriosWe present a fixed parameter algorithm that constructively solves the
k-dominating set problem on graphs excluding one of the K_{5} or
K_3,3 as a minor in time O(3^{6sqrt{34 k}}n^{O(1)}). In fact,
we present our algorithm for any H-minor-free graph where H is
a single-crossing graph (can be drawn on the plane with at most one
crossing) and obtain the algorithm for K_{3,3} (K_{5})-minor-free
graphs as a special case. As a consequence, we extend our results to
several other problems such as vertex cover, edge dominating set,
independent set, clique-transversal set, kernels in digraphs,
feedback vertex set and a series of vertex removal problems.
Our work generalizes and extends the recent result of exponential speedup
in designing fixed-parameter algorithms on planar
graphs due to Alber et al. to other (non-planar) classes of graphs.