{"entities":{"Q4186116":{"pageid":6215717,"ns":120,"title":"Item:Q4186116","lastrevid":81512660,"modified":"2026-05-06T18:41:37Z","type":"item","id":"Q4186116","labels":{"en":{"language":"en","value":"Sensitive Optimality Criteria in Countable State Dynamic Programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3623332"}},"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":"Q4186116$5325BE4C-1D72-4F2E-AD7E-5187CE6EC648","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"611e7125e50ee87e1220823062df3a99cb582ea1","datavalue":{"value":{"text":"Sensitive Optimality Criteria in Countable State Dynamic Programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4186116$B4FF8884-C85D-41F5-A026-27B3A508D430","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"7900801859fd06556f26768959710ffa030e2029","datavalue":{"value":"0401.90103","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4186116$9EAEBCCA-66D2-4320-ADCF-3420560AFA52","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"52a1ee9157e22110d0cc895147e16d3c043fbf07","datavalue":{"value":{"entity-type":"item","numeric-id":182604,"id":"Q182604"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4186116$D643DC75-76A3-4BD1-841F-6F3C9CB47056","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f979b76c927c315d8f25cc8c02c76a60990d1af2","datavalue":{"value":{"entity-type":"item","numeric-id":481786,"id":"Q481786"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4186116$FD184472-16A2-4C20-B47C-9E2A523B0B71","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"cccce4a4205b51ff587d222bc7a07ed4bfa86d8f","datavalue":{"value":{"entity-type":"item","numeric-id":103831,"id":"Q103831"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4186116$A7C11D7B-2AE3-4A51-AEE3-63D78263919E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a49472451190faf858f564fafd4bcba399999753","datavalue":{"value":{"time":"+1977-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4186116$59B299E2-3939-4331-B216-A6E356573CEC","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"377d3ab03372cff12915e0de0374438ff70c3716","datavalue":{"value":"90C40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4186116$0BB9CFA0-7840-40C5-B324-ABAAAC3246AE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"aa3ca91474fff28e420d9cace433f8447ec799b0","datavalue":{"value":"90C39","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4186116$1054B83B-0514-4CB1-B717-279381A946BB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"158ee6905da3ad2e131f84a74abb50239f9888df","datavalue":{"value":"3623332","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4186116$3A349E53-FF33-4DDF-A70B-9D9DEA575FF5","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"767ed686e28395c25ba867b8edc8d1c5db0b9aee","datavalue":{"value":"Sensitive Optimality Criteria","type":"string"},"datatype":"string"},"type":"statement","id":"Q4186116$20B0EA6C-7FBE-45A6-AB40-A2D206A3A2EA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f76b0642c5bd16dd0f80b7e95cc1d204d421c7e9","datavalue":{"value":"Discrete Time Markovian Decision Processes","type":"string"},"datatype":"string"},"type":"statement","id":"Q4186116$A95A3C61-8888-4D34-80B3-196D8552FE8B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7ae28ecb9d62ec47f1e4d4a4cdc2343b285dc072","datavalue":{"value":"Countable State Space","type":"string"},"datatype":"string"},"type":"statement","id":"Q4186116$86283854-37FB-45A7-AEB8-FBC66A41C986","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"48f840729f55709d84b32e932483d091cbfda8bc","datavalue":{"value":"Arbitrary Decision Sets","type":"string"},"datatype":"string"},"type":"statement","id":"Q4186116$641F1A1F-CB78-4FB5-8B14-FE2DAD027F26","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"121bdfb7182b15531604b56cf8de129898d979ef","datavalue":{"value":"Liapunov Function Type Criterion","type":"string"},"datatype":"string"},"type":"statement","id":"Q4186116$D2CDB244-B2B5-4066-BCA8-F272545B40AD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cf2603489c060a3267fc7761fc771610101a628b","datavalue":{"value":"Existence of Stationary N-Discount Optimal Policies","type":"string"},"datatype":"string"},"type":"statement","id":"Q4186116$30AF827B-3216-4660-BE7C-A67E8CDE67AD","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":"Q4186116$C2C818B6-A1FE-40C9-9496-6D038EA50F95","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"5acb81ff183a724e7199c17e03e8288e32d2296f","datavalue":{"value":"https://doi.org/10.1287/moor.2.1.1","type":"string"},"datatype":"url"},"type":"statement","id":"Q4186116$2346E5E1-3EBF-48D2-BBCC-4C2B75D1E56A","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"4a97e26a9950044753e0e2342261181168274e2f","datavalue":{"value":"W2119695355","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4186116$F4A02BB4-1672-48E2-ADB9-D777A45D7C4B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"5e00eb98c1f4aa4cdaa1189c64d5d76544b77ba5","datavalue":{"value":"10.1287/MOOR.2.1.1","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4186116$584FFFA2-D857-43E6-9153-7CEA9966CB3F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Sensitive Optimality Criteria in Countable State Dynamic Programming","badges":[]}}}}}