Davidson et al.,[2] after surveying several approaches to handle the problem, classify them as either optimistic or pessimistic.
The optimistic approaches simply let the partitioned nodes work as usual; this provides a greater level of availability, at the cost of sacrificing correctness.
Once the problem has ended, automatic or manual reconciliation might be required in order to have the cluster in a consistent state.
One current implementation for this approach is Hazelcast, which does automatic reconciliation of its key-value store.
Once a network partitioning has been detected, access to the sub-partitions is limited in order to guarantee consistency.