DEAF
发表于 2025-3-27 00:21:14
Uwe H. Bittlingmayer,Zeynep Islertas,Elias Sahrai,Stefanie Harsch,Isabella Bertschi,Diana Sahraibility..For each of these approaches, we analyse the computational complexity involved in finding a desired assignment. Particular focus is laid on two natural special cases of agents? preferences which allow for positive complexity results.
Lumbar-Spine
发表于 2025-3-27 02:59:17
http://reply.papertrans.cn/43/4248/424728/424728_32.png
袖章
发表于 2025-3-27 08:39:48
http://reply.papertrans.cn/43/4248/424728/424728_33.png
finale
发表于 2025-3-27 11:20:58
http://reply.papertrans.cn/43/4248/424728/424728_34.png
Coterminous
发表于 2025-3-27 15:20:49
http://reply.papertrans.cn/43/4248/424728/424728_35.png
GLIDE
发表于 2025-3-27 19:28:27
http://reply.papertrans.cn/43/4248/424728/424728_36.png
arsenal
发表于 2025-3-27 22:17:32
http://reply.papertrans.cn/43/4248/424728/424728_37.png
DUST
发表于 2025-3-28 02:25:39
http://reply.papertrans.cn/43/4248/424728/424728_38.png
伤心
发表于 2025-3-28 07:01:31
Uwe H. Bittlingmayer,Zeynep Islertas,Elias Sahrai,Stefanie Harsch,Isabella Bertschi,Diana Sahrai possibilistic logic theories. Finally, we study reasoning with P-trees and establish computational complexity results for the key reasoning tasks of comparing outcomes with respect to orders defined by P-trees, and of finding optimal outcomes.
使混合
发表于 2025-3-28 13:02:52
Uwe H. Bittlingmayer,Zeynep Islertas,Elias Sahrai,Stefanie Harsch,Isabella Bertschi,Diana Sahraiics, enables us to model decision-making problems where probabilistic ignorance and default reasoning plays an important role. We provide several decision functions using the notions of expected utility and probability intervals, and study their properties.