A graph with either positive or negative labels on the edge becomes a signed graph. Given a signed graph Σ=(V,E,σ), a subset D of V is said to be a double dominating set for Σ, if it satisfies the following conditions: (i) every vertex u of Σ is either in D and u has at least one neighbour in D or whenever u∈V\D, |N(u)∩D|≥2 (ii) Σ[D:V\D] is balanced where N(u) denotes the open neighbourhood of a vertex u and Σ[D:V\D] is the subgraph of the Σ induced by the edges between the vertices in D and V\D. In this paper, we initiate the discussion on the double domination in signed graphs.