This　paper　investigates　the　asymmetric　marking　games　on　line　graphs.　Suppose　G　is　a　graph　with　maximum　degree　Δ　and　G　has　an　orientation　with　maximum　outdegree　k,　we　show　that　the　(a,　1)-game　coloring　number　of　the　line　graph　of　G　is　at　most　Δ　+　2　k　+　⌈　frac(k,　a)　⌉　-　1.　When　a　=　1,　this　improves　some　known　results　of　the　game　coloring　number　of　the　line　graphs.　©　2007　Elsevier　B.V.　All　rights　reserved.