{"entities":{"Q1231344":{"pageid":1242094,"ns":120,"title":"Item:Q1231344","lastrevid":66398793,"modified":"2026-04-12T09:49:20Z","type":"item","id":"Q1231344","labels":{"en":{"language":"en","value":"A successive approximation algorithm for an undiscounted Markov decision process"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3530763"}},"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":"Q1231344$FE6CCE89-B024-4A5C-968A-ED4CB29A4596","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a827415d70ac477c019026d02a3057fa0a5bafd2","datavalue":{"value":{"text":"A successive approximation algorithm for an undiscounted Markov decision process","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1231344$93311F4F-94BD-4D50-AA36-51C33361FCD1","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"ade2ea436a54c6f33004e62919019dbb4f3bee93","datavalue":{"value":"0339.60069","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1231344$E7D86424-656D-494D-A505-D7AF8FE6E8EE","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"de43a0710f260fcfe94b7c6c30fbbf0cbd72256f","datavalue":{"value":"10.1007/BF02276760","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1231344$D7A8A7AE-25F4-45FC-8299-64F115C3B9C1","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9e47d94cb50e8bff7e07db91cf2e29b89383adf9","datavalue":{"value":{"entity-type":"item","numeric-id":1223001,"id":"Q1223001"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1231344$0651E6BD-B076-4DDE-92C2-25634697E4F1","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"b79ece58f33b59758a066cb6b9ee149bab3a2c9a","datavalue":{"value":{"entity-type":"item","numeric-id":167642,"id":"Q167642"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1231344$E930A355-48A8-4326-9393-56CA44473E11","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"974fa8a46aa40326fb3113b279589eb02559bb73","datavalue":{"value":{"time":"+1976-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":"Q1231344$FEA67EC3-C445-42C5-BC61-B6E67E1AC626","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6a9ff1a146ff44dca747e334413377c148d2df3d","datavalue":{"value":"60J20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1231344$DAB02B7B-5C07-43FA-B7E1-C7144BED5202","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"e3bc6c7cda8279d6ad2b578e7a7e4967447c3cc4","datavalue":{"value":"93E20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1231344$EF9C09F4-B1C5-4CA6-AD25-E9DCB2453CE7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"526dca70089a50c26701067fb4318031fe99c9c2","datavalue":{"value":"3530763","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1231344$149A98C0-3FEC-4B4C-828C-40232FF07851","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":"Q1231344$DEAB9C68-03A7-4352-BD29-E1C4DCB17CFF","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"0330a95c4b58fb4eee1cae1787d09cfe629b2f10","datavalue":{"value":{"entity-type":"item","numeric-id":5576132,"id":"Q5576132"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1231344$F1533AA7-0D27-4E58-BE30-5D83A0A77E18","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d923b48aec96c909b1c8b0679e6042c3fab058c4","datavalue":{"value":{"entity-type":"item","numeric-id":1844078,"id":"Q1844078"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1231344$E4D323E7-AFA8-46A5-B0D7-03617D5AD6AC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e473dba1d8e98bef59d322eaf8f0b7b4bd633308","datavalue":{"value":{"entity-type":"item","numeric-id":4133441,"id":"Q4133441"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1231344$BAA8A21E-2A5F-468B-918D-71EDCDA51845","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"78f14459f67d301da6c539c2f758151b1da5d94a","datavalue":{"value":{"entity-type":"item","numeric-id":5822308,"id":"Q5822308"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1231344$904510E3-799B-47F8-B359-5D3BD2CEBE4A","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"899a461a300400b7d68921d151ca1c9ddb9b94a8","datavalue":{"value":"https://doi.org/10.1007/bf02276760","type":"string"},"datatype":"url"},"type":"statement","id":"Q1231344$21858FF3-1DCA-4BDD-BB5D-80C3361AE6BA","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"ba02ed18241ab0b2c355ebc311c0f4a3177cbf63","datavalue":{"value":"W2163408601","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1231344$612D7691-C167-4523-9620-ADC702F3BDB4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A successive approximation algorithm for an undiscounted Markov decision process","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_successive_approximation_algorithm_for_an_undiscounted_Markov_decision_process"}}}}}