logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Complete games with minimum

delete1998-01-01
delete8
PRE
AI
J
Josep Freixas *
M
Marı́a Albina Puente
DOI：10.1023/A:1018905407647delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Some real-world examples of simple games, like the procedure to amend the Canadian Constitution, are complete simple games with minimum. Using characteristic invariants for this class of games, we study different types of solution concepts. For an arbitrary number of players we get the nucleolus by means of a determinate compatible system of equations, characterize the maximality of the kernel and give a method to calculate semivalues. Several applications are found at the end of the paper.
Keywords:
simple games
completeness
solution concepts
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Annals of Operations Research cover
Annals of Operations Research
IF:
4.5
Papers:
8.0K
Citations:
2.1W

Organization

No organization information available