Rational　secret　sharing　was　first　introduced　by　Halpern　and　Teague　(STOC,　2004).　Since　then,　a　series　of　works　have　focused　on　designing　rational　secret　sharing　protocols.　However,　most　existing　solutions　can　share　only　one　secret　at　one　secret　sharing　process.　To　share　multiple　secrets　such　as　m　secrets,　the　dealer　must　redistribute　shares　for　m　times.　In　addition,　previous　works　assume　existence　of　broadcast　channel　which　is　not　realistic.　Motivated　by　those　problems,　this　paper　proposes　a　rational　multi-secret　sharing　scheme,　which　combines　the　secret　sharing　scheme　with　game　theory.　In　the　protocol,　the　problem　of　sharing　multiple　secrets　is　addressed,　and　there　are　multiple　secrets　to　be　shared　during　one　secret　sharing　process.　Furthermore,　this　work　starts　off　by　constructing　a　protocol　in　simultaneous　broadcast　networks,　and　then　we　emulate　the　broadcast　channel　over　point-to-point　networks.　Based　on　a　computational　assumption,　we　show　that　rational　players　have　no　incentive　to　deviate　from　the　protocol　and　every　player　can　obtain　multi　secret　fairly.