{"entities":{"Q6946474":{"pageid":21182421,"ns":120,"title":"Item:Q6946474","lastrevid":75970212,"modified":"2026-04-22T08:46:12Z","type":"item","id":"Q6946474","labels":{"en":{"language":"en","value":"Settling the complexity of computing approximate two-player Nash equilibria"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8076534"}},"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":"Q6946474$EA932A86-8DBD-4C62-9FA4-E4CFD671A31E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"3db4c30b37217f23f927344ee1cedfd63e5c6a67","datavalue":{"value":{"text":"Settling the complexity of computing approximate two-player Nash equilibria","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6946474$25958738-8324-4371-90B7-FFB1F467FE0B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"29b1697d46261b719a950fbfb34f536363966432","datavalue":{"value":"10.1109/FOCS.2016.35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946474$3920D465-EA45-42DE-B2F1-C09F703C8679","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f2a2518a30dab95bb7298e1e50f487fec12e67ec","datavalue":{"value":{"entity-type":"item","numeric-id":1698393,"id":"Q1698393"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6946474$88B5082C-B2E1-4186-9C61-EB9C63DE4104","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"92e52dd11d4a4a87e99ca1dd58ff5812f369c9fa","datavalue":{"value":{"time":"+2025-08-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6946474$882BEA08-9DDB-48D3-9C16-E21C17F32F9B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946474$17C864BE-6C5E-458C-8D5D-A5B48604244E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1397c7d07b55282862d4db12cbe94becf8137559","datavalue":{"value":"68Rxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946474$700A8CBC-FDEE-4063-87BA-5C3FE7B232A3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946474$8D8B219F-2A73-4EB4-99D2-097704DCC67C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"759f106122ec5e83dd1e47c0b5ebcf18d8cb8115","datavalue":{"value":"8076534","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946474$9FCAFE9F-75C8-444E-B357-34F7DDC2D2DC","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":"Q6946474$EEE9CD23-1CEE-4366-80FC-CDD79216AE43","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Settling the complexity of computing approximate two-player Nash equilibria","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Settling_the_complexity_of_computing_approximate_two-player_Nash_equilibria"}}}}}