{"entities":{"Q6996973":{"pageid":21484827,"ns":120,"title":"Item:Q6996973","lastrevid":76423962,"modified":"2026-04-24T01:30:43Z","type":"item","id":"Q6996973","labels":{"en":{"language":"en","value":"Graph pursuit games and new algorithms for Nash equilibrium computation"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8027422"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6996973$ADF04807-FE94-4FAB-81E6-9FB9BCCAD82F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"202242eb3880ae1e7d019f949a890ed67621911a","datavalue":{"value":{"text":"Graph pursuit games and new algorithms for Nash equilibrium computation","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6996973$1F5630A7-E180-44B6-8C6A-FA4C84FCB3E5","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"3432ba55fe8dc7c4c715264cca59670cbac86d28","datavalue":{"value":"1564.91021","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6996973$CBA2CF8A-B539-4DAF-800D-F125DCCA585C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"6a17049c3792d0a845c43db4fd88f4f81ae0c7f7","datavalue":{"value":"10.1142/9789811261572_0018","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6996973$CCC2420E-7CAE-4687-8804-5581D340F6C8","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0c06050e1dfb73b9d31bc9755593629a5982efee","datavalue":{"value":{"entity-type":"item","numeric-id":385063,"id":"Q385063"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6996973$4A226DBD-1C16-4D01-AA90-1496F3D1E791","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"28e2c9e510147e8d03e2b4b8d318003432b0ad8b","datavalue":{"value":{"entity-type":"item","numeric-id":6996972,"id":"Q6996972"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6996973$89BBB2DA-F0A1-4AA7-B461-8D0F1891CD28","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9d296e3c732d676478f818c71f378b3e266e34da","datavalue":{"value":{"time":"+2025-04-15T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6996973$DB2FA024-FB64-42FD-B825-DB080013DED3","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"51140ae2bebd38d405ad1731d3b61ebf4b26c4ac","datavalue":{"value":"91A43","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6996973$C4E0DA9B-A6C7-409E-B362-411CC19A9368","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5fbd0918ba2c4a1aeddd30d9d3d146d9773f1239","datavalue":{"value":"91A24","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6996973$61932449-A694-4969-AD5C-66823D81014C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"54aeb167f340633281a9d7b3b52ca287ce6b8d74","datavalue":{"value":"91A68","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6996973$BE200011-F03B-4C6E-892B-0C2F89582894","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2aae8acaec1ac1e7548f5b50ab7219c14450e73f","datavalue":{"value":"8027422","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6996973$D6C6CB17-C1FF-4BAB-8456-7493E0A18511","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6996973$2B77B84B-AA36-462D-82DE-6A0AAF1B3E1E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Graph pursuit games and new algorithms for Nash equilibrium computation","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Graph_pursuit_games_and_new_algorithms_for_Nash_equilibrium_computation"}}}}}