In this article we explore multiple change operators, that is, operators in which the epistemic input is a set of sentences instead of a single sentence. We propose two types of change: prioritized change, in which the input set is fully accepted, and symmetric change, in which both the epistemic state and the epistemic input are equally treated. In both kinds of operators we propose a set of postulates and we present different constructions: kernel changes and partial meet changes.