{"payload":{"header_redesign_enabled":false,"results":[{"id":"241737508","archived":false,"color":"#e34c26","followers":0,"has_funding_file":false,"hl_name":"fras3c/ag-shapley-mso","hl_trunc_description":"An implemetation for computing the Shapley value (in polynomial time) of matching games over bounded treewidth graphs. ","language":"HTML","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":241737508,"name":"ag-shapley-mso","owner_id":50948605,"owner_login":"fras3c","updated_at":"2023-11-08T11:19:35.580Z","has_issues":true}},"sponsorable":false,"topics":["game-theory","resource-allocation","cooperative-game","treewidth","treewidth-implementations","banzhaf-index","sequoia","shapley-value","treedecompositions"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":63,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253Afras3c%252Fag-shapley-mso%2B%2Blanguage%253AHTML","metadata":null,"csrf_tokens":{"/fras3c/ag-shapley-mso/star":{"post":"ZLE4E88poz9ODVn7l9ueLaqil2d70paBSM6I5I-9WQK4AcBlezaxqvUo2R8hCDAbmS3oqWuW6rY8Asg12MZf1A"},"/fras3c/ag-shapley-mso/unstar":{"post":"SzL-gv9klqgCQzp_7rpPPuGBRW5InnCsnAt3iuVThJAnYFMRdzZ2zxPlt1Z0FKyrDk8U7SYAiG2KLEVGFmy-Zg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"ktj3wD5KjfQYLQsdPUb3OykvrChUDZ2vs4AqwitIgMyNcvJTBQhkQZ6KU6PTsZ5ukLI4jfFyDl8TbwVSEErJ8Q"}}},"title":"Repository search results"}