Rank Maximal Matching

a matching in a bipartite graph with sides X,Y.
It maximizes the number of vertices in X that are linked to their first priority;
subject to that, the number of vertices linked to their second priority; etc

article GitHub-fork
  1. Create a new Google Spreadsheet. You can see an example here
    important:
    please make sure that the data stored in worksheet named "input",
    and the cell at the left corner in your spreadsheet says "agent/item"

    In this example, each agent is an applicant and each item is a company.
    The applicants rank the companies they are interested of.
    For example, Amiel is interested of Intel,Ebay and Hp, and ranks them in this order.
    Note: the minimal rank can be any non-negative rank.


  2. Share the spreadsheet with the following email address:
    rmm-996@rank-maximal-matching.iam.gserviceaccount.com
  3. Enter the URL of the spreadsheet here: