Browsing by Author "Álvarez Faura, M. del Carme"
Now showing items 2140 of 46

Maximum congestion games on networks: How can we compute their equilibria?
Álvarez Faura, M. del Carme; Francès, Guillem (200709)
Research report
Open AccessWe study Network Maximum Congestion Games, a class of network games where players choose a path between two given nodes in order to minimize the congestion of the bottleneck (the most congested link) of their path. For ... 
Network creation games: structure vs anarchy
Álvarez Faura, M. del Carme; Messegué Buisan, Arnau (20170903)
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
Álvarez Faura, M. del Carme; Serna Iglesias, María José; Fernández, Aleix (20161001)
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
Álvarez Faura, M. del Carme; Messegué Buisan, Arnau (Springer, 2021)
Conference report
Open AccessA 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 dlogtime and polylogtime reductions
Álvarez Faura, M. del Carme; Jenner Núñez, Birgit (Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, 1993)
Conference report
Open AccessWe investigate properties of the relativized NC and AC hierarchies in their DLOGTIME. respectively, ALOGTIMEuniform setting and show that these hierarchies can be characterized in terms of adaptive reducibility in ... 
On the existence of Nash equilibria in strategic search games
Álvarez Faura, M. del Carme; Duch Brown, Amalia; Serna Iglesias, María José; Thilikos Touloupas, Dimitrios (2011)
Conference report
Open AccessWe consider a general multiagent 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 PoA conjecture: Trees versus biconnected components
Álvarez Faura, M. del Carme; Messegué Buisan, Arnau (Society for Industrial and Applied Mathematics (SIAM), 2023)
Article
Open AccessIn the classical model of network creation games introduced by Fabrikant et al. [Ona network creation game, in Proceedings of the TwentySecond Annual Symposium on Principlesof Distributed Computing (PODC`03), 2003, pp. ... 
On the price of anarchy for highprice links
Álvarez Faura, M. del Carme; Messegué Buisan, Arnau (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
Álvarez Faura, M. del Carme; Serna Iglesias, María José (20091101)
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
Álvarez Faura, M. del Carme; Serna Iglesias, María José (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
Álvarez Faura, M. del Carme; Balcázar Navarro, José Luis; Gabarró Vallès, Joaquim (199010)
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
Álvarez Faura, M. del Carme; Gabarró Vallès, Joaquim (198901)
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
Álvarez Faura, M. del Carme; Gabarró Vallès, Joaquim; Serna Iglesias, María José (200509)
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 multiplayer extensive games with perfect ... 
Pure Nash equilibria in games with a large number of actions
Álvarez Faura, M. del Carme; Gabarró Vallès, Joaquim; Serna Iglesias, María José (200411)
Research report
Open AccessWe study the computational complexity of deciding the existence of a Pure Nash Equilibrium in multiplayer strategic games. We address two fundamental questions: how can we represent a game?, and how can we represent a ... 
Sensor field: a computational model
Álvarez Faura, M. del Carme; Duch Brown, Amalia; Gabarró Vallès, Joaquim; Serna Iglesias, María José (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
Álvarez Faura, M. del Carme; Duch Brown, Amalia; Gabarró Vallès, Joaquim; Serna Iglesias, María José (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 ... 
Sensor field: a computational model
Álvarez Faura, M. del Carme; Duch Brown, Amalia; Gabarró Vallès, Joaquim; Serna Iglesias, María José (20090923)
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 ... 
Some results of Maria Serna on strategic games: Complexity of equilibria and models
Álvarez Faura, M. del Carme; Duch Brown, Amalia (Elsevier, 202102)
Article
Open AccessWe 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
Álvarez Faura, M. del Carme; Blesa Aguilera, Maria Josep; Duch Brown, Amalia; Messegué Buisan, Arnau; Serna Iglesias, María José (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
Álvarez Faura, M. del Carme; Blesa Aguilera, Maria Josep; Díaz Cort, Josep; Fernández Anta, Antonio; Serna Iglesias, María José (200304)
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 ...