What is shared-input for Multi Party Computation? I heard shared input.
For example, original values $x,y \in M$ are divided into pairs of shares $(x_1,x_2)$ and $(y_1, y_2)$ such that $x_1 + x_2 = x \text{ and } y_1 + y_2 = y$.
Each share is distributed to two parties $P_1$ (who obtains $x_1$ and $y_1$) and $P_2$ (who obtains $x_2$ and $y_2$).

When $M = \mathbb{Z}_2$, addition is just XOR computation.

With additive shared input, can any computations be evaluated??

If so, what is the method used for the evaluation??

Is garbled circuit applicable to this scenario??
With additive shared input, can any computations be evaluated??
If so, what is the method used for the evaluation??
Is garbled circuit applicable to this scenario??

Yes, any computation can be evaluated. This is achieved by representing the functionality to be computed as an arithmetic circuit (not a garbled circuit) that consists of addition and multiplication gates. The addition gate can be evaluated by the parties locally because the shares are additively homomorphic. The multiplication gates can be evaluated by the parties interactively.
If you want to know more about it, there is a book: Secure Multiparty Computation and Secret Sharing, by Ronald Cramer, Ivan Damgård, and Jesper Buus Nielsen.
There are also some relevant papers if you are interested:
Ronald Cramer, Ivan Damgård, Ueli M. Maurer:
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. EUROCRYPT 2000: 316-334
Dan Bogdanov, Sven Laur, Jan Willemson:
Sharemind: A Framework for Fast Privacy-Preserving Computations. ESORICS 2008: 192-206
Ivan Damgård, Valerio Pastro, Nigel P. Smart, Sarah Zakarias:
Multiparty Computation from Somewhat Homomorphic Encryption. CRYPTO 2012: 643-662