… Thus the mixed matching P is popular in the instance above. … instance admits a popular
mixed matching by establishing a … for computing a popular mixed matching. Our technique …

… points out the connection to popular mixed matchings, which we will discuss in Section 6.3.
2. … common relaxations, namely least unpopular matchings and popular mixed matchings. …

… Thus the mixed matching P is popular in the instance above. … instance admits a popular
mixed matching by establishing a … for computing a popular mixed matching. Our technique …

… a popular mixed matching could have a much higher utility than all popular matchings, we
study the popular fractional matching … where a stable matching in G is a perfect matching, this …

… It is known that it is NP-hard to compute a max-utility popular matching. So we consider
mixed matchings: a mixed matching is a probability distribution or a lottery over matchings. Our …

… Moreover, finding a max-weight or min-cost popular mixed matching in … popular mixed
matching Pi with a simple structure: Pi = {(M_0,1/2),(M_1,1/2)} where M_0 and M_1 are matchings …

… We will use popular mixed matchings to define a natural … = {matchings undefeated by
popular mixed matchings}, we have a natural strengthening of the above notion of mild popularity. …

… Thus we can find a min-cost popular mixed matching in polynomial time. ▶ A drawback of
generalizing to mixed matchings is that the solution has become more complex to describe …

… matching that defeats a fairly popular matching does not occur in the support of any popular
mixed matching… A fractional matching x is popular if Π is a popular mixed matching, where Π …

… a pairwise-stable matching (one with no … a popular matching in G – a matching M is
popular if M cannot lose an election to any matching where vertices cast votes for one matching …