A fair scheme will try to make sure that two applications submitted together take
the same time.
According to this criteria,
time sharing is less fair than space sharing,
since an application gets not only processors during
its time quantum but also during the time quantum of the application
in front of it.
Depending on who is in front of it,
an application may get more or less cycles than another similar application
submitted at the same time.
Space sharing tries to be more fair,
but it cannot be perfectly fair because the extra processors found in the
last iteration
are assigned to some and not others.
The Dynamic version of it is more fair because it does more frequent reallocations
and also because it reduces a process's priority if it does not yield
enough processors.