Browsing by Author "Álvarez Faura, M. del Carme"
Now showing items 21-40 of 43
-
Network creation games: structure vs anarchy
(2017-09-03)
Research report
Open AccessWe study Nash equilibria and the price of anarchy in the classical model of Network Creation Games introduced by Fabrikant et al. In this model every agent (node) buys links at a prefixed price a > 0 in order to get connected ... -
Network formation for asymmetric players and bilateral contracting
(2016-10-01)
Article
Open AccessWe study a network formation game where players wish to send traffic to other players. Players can be seen as nodes of an undirected graph whose edges are defined by contracts between the corresponding players. Each player ... -
On bipartite sum basic equilibria
(Springer, 2021)
Conference report
Restricted access - publisher's policyA connected and undirected graph G of size n≥1 is said to be a sum basic equilibrium iff for every edge uv from G and any node v′ from G, when performing the swap of the edge uv for the edge uv′ the sum of the ... -
On the existence of Nash equilibria in strategic search games
(2011)
Conference report
Open AccessWe consider a general multi-agent framework in which a set of n agents are roaming a network where m valuable and sharable goods (resources, services, information ....) are hidden in m different vertices of the network. ... -
On the price of anarchy for high-price links
(Springer, 2019)
Conference report
Open AccessWe study Nash equilibria and the price of anarchy in the classic model of Network Creation Games introduced by Fabrikant, Luthra, Maneva, Papadimitriou and Shenker in 2003. This is a selfish network creation model where ... -
On the proper intervalization of colored caterpillar trees
(2009-11-01)
Research report
Open AccessThis paper studies the computational complexity of the Proper interval colored graph problem (picg), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a ... -
On the proper intervalization of colored caterpillar trees
(2009)
Article
Restricted access - publisher's policyThis paper studies the computational complexity of the proper interval colored graph problem (picg), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a ... -
Parallel complexity in the design and analysis of concurrent systems
(1990-10)
Research report
Open AccessWe study the parallel complexity of three problems on concurrency: decision of firing sequences for Petri nets, trace equivalence for partially commutative monoids, and strong bisimilarity in finite transition systems. We ... -
Parallel complexity of partially commutative monoids
(1989-01)
Research report
Open AccessWe consider the parallel complexity of some problems issued from Petri nets, partially commutative monoids and finite automata. we prove the following: (19 The membership problem for firing sequances on Petri Nets can be ... -
PSPACE suffices for deciding nash equilibria properties for extensive games with large trees
(2005-09)
Research report
Open AccessWe study the computational complexity of deciding the existence of a Pure Nash Equilibrium or a subgame perfect equilibrium with a given payoff and other related problems in finite multi-player extensive games with perfect ... -
Pure Nash equilibria in games with a large number of actions
(2004-11)
Research report
Open AccessWe study the computational complexity of deciding the existence of a Pure Nash Equilibrium in multi-player strategic games. We address two fundamental questions: how can we represent a game?, and how can we represent a ... -
Sensor field: a computational model
(2009)
Article
Restricted access - publisher's policyWe introduce a formal model of computation for networks of tiny artifacts, the static synchronous sensor field model (SSSF) which considers that the devices communicate through a fixed communication graph and interact ... -
Sensor field: a computational model
(2009-09-23)
Research report
Open AccessWe introduce a formal model of computation for networks of tiny artifacts, the static synchronous sensor field model (SSSF) which considers that the devices communicate through a fixed communication graph and interact ... -
Sensor field: a computational model
(2009)
Conference lecture
Open AccessIn this work we introduce a formal model for studying networks of tiny artifacts, the static synchronous sensor field model (SSSF). The model consider that these devices communicate among them by means of a communication ... -
Some results of Maria Serna on strategic games: Complexity of equilibria and models
(Elsevier, 2021-02)
Article
Restricted access - publisher's policyWe survey some recent work of Maria Serna concerning strategic games. We first examine some results related to the formal representation of strategic games and the complexity of problems related to both the existence of ... -
Stars and celebrities: A network creation game
(2015)
Research report
Open AccessCelebrity games, a new model of network creation games is introduced. The specific features of this model are that players have different celebrity weights and that a critical distance is taken into consideration. The aim ... -
The Complexity of deciding stability under FFS in the adversarial model
(2003-04)
Research report
Open AccessIn this paper we show the polynomial time decidability of the stability property under FFS in the case that the adversary can solve ties arbitrarily. This results follows from a characterization of the stability property ... -
The Complexity of pure Nash equilibria in weighted Max-Congestion Games
(Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, 2008-03-04)
Research report
Open AccessWe study Network Max-Congestion Games (NMC games, for short), a class of network games where each player tries to minimize the most congested edge along the path he uses as strategy. We focus our study on the complexity ... -
The Hardness of intervalizing four colored caterpillars
(1998-07-02)
Research report
Open AccessThe problem of Intervalizing Colored Graphs (ICG) has received a lot of attention due to their use as a model for DNA physical mapping with ambiguous data. If k is the number of colors, the problem is known to be NP-Complete ... -
The HOM problem is decidable
(2009-06)
Research report
Open AccessWe close affirmatively a question which has been open for 35 years: decidability of the HOM problem. The HOM problem consists in deciding, given a tree homomorphism $H$ and a regular tree languagle $L$ represented by a ...
