找回密碼
 To register

QQ登錄

只需一步，快速開始

掃一掃，訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Cooperative Games on Combinatorial Structures; Jesús Mario Bilbao Book 2000 Springer Science+Business Media New York 2000 calculus.coopera

[復(fù)制鏈接]
查看: 47087|回復(fù): 46
樓主
發(fā)表于 2025-3-21 16:24:50 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Cooperative Games on Combinatorial Structures
編輯Jesús Mario Bilbao
視頻videohttp://file.papertrans.cn/238/237970/237970.mp4
叢書名稱Theory and Decision Library C
圖書封面Titlebook: Cooperative Games on Combinatorial Structures; Jesús Mario Bilbao Book 2000 Springer Science+Business Media New York 2000 calculus.coopera
描述The aim of .Cooperative Games on Combinatorial Structures.is to analyze conflict situations in which two or more players canmake coalitions and obtain prizes and penalties. This approach tosituations of competition and cooperation was given in the seminaltreatise by John von Neumann and Oskar Morgenstern, .Theory ofGames. .and Economic Behavior.. Cooperative game theory hassucceeded in providing many applications of game theory. .In this volume, games defined on combinatorial structures will beanalyzed, i.e. a set system over a set of players. In many situationsthe author will work in a .closure space.. Examples of closureoperators are the spanning operator of linear algebra and all convexhull operators. .Chapters 1-4 constitute a review of mathematical concepts from.Cooperative Game Theory, Graph Theory, Linear and Integer..Programming, Combinatorial Optimization, Discrete ConvexAnalysis. and .Computational Complexity.. The table of contentsis a short guide to the topics and methods covered in this book. InChapters 11 and 12, several notebooks are presented with the systemMathematica by Wolfram in the contexts of the packages.DiscreteMath. (Skiena) and .Cooperative. (Carter). Ther
出版日期Book 2000
關(guān)鍵詞calculus; cooperative games; economic theory; game theory; linear algebra; linear optimization; optimizati
版次1
doihttps://doi.org/10.1007/978-1-4615-4393-0
isbn_softcover978-1-4613-6976-9
isbn_ebook978-1-4615-4393-0Series ISSN 0924-6126 Series E-ISSN 2194-3044
issn_series 0924-6126
copyrightSpringer Science+Business Media New York 2000
The information of publication is updating

書目名稱Cooperative Games on Combinatorial Structures影響因子(影響力)




書目名稱Cooperative Games on Combinatorial Structures影響因子(影響力)學(xué)科排名




書目名稱Cooperative Games on Combinatorial Structures網(wǎng)絡(luò)公開度




書目名稱Cooperative Games on Combinatorial Structures網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Cooperative Games on Combinatorial Structures被引頻次




書目名稱Cooperative Games on Combinatorial Structures被引頻次學(xué)科排名




書目名稱Cooperative Games on Combinatorial Structures年度引用




書目名稱Cooperative Games on Combinatorial Structures年度引用學(xué)科排名




書目名稱Cooperative Games on Combinatorial Structures讀者反饋




書目名稱Cooperative Games on Combinatorial Structures讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics
 

0票 0%

Better Implies Difficulty
 

0票 0%

Good and Satisfactory
 

0票 0%

Adverse Performance
 

0票 0%

Disdainful Garbage
您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 20:54:03 | 只看該作者
Water and the Search for Life on Marsfor solving a computational problem. There are often several algorithms for solving a problem and we are interested in to analyze the computational resources required to solve a certain problem. The complexity of a problem is the order of computational resources which are necessary and sufficient to solve the problem.
板凳
發(fā)表于 2025-3-22 01:15:14 | 只看該作者
https://doi.org/10.1007/978-0-387-29372-1are supplied by local communities, social and sports clubs, labor unions, political parties, and other institutions. Situations like these were studied by Myerson [182] [183] and this line of research was continued by Owen [195], van den Nouweland and Borm [187], and Borm, Owen and Tijs [26].
地板
發(fā)表于 2025-3-22 05:37:16 | 只看該作者
Computational complexity,for solving a computational problem. There are often several algorithms for solving a problem and we are interested in to analyze the computational resources required to solve a certain problem. The complexity of a problem is the order of computational resources which are necessary and sufficient to solve the problem.
5#
發(fā)表于 2025-3-22 09:42:15 | 只看該作者
6#
發(fā)表于 2025-3-22 15:04:20 | 只看該作者
7#
發(fā)表于 2025-3-22 20:05:06 | 只看該作者
8#
發(fā)表于 2025-3-22 22:03:07 | 只看該作者
Simple games on closure spaces,ave a particular incidence in this chapter, and the work of Carreras [33], who studies the simple games restricted by cooperation graphs. The results were given by Jiménez Jiménez in her Ph. D. Thesis [134].
9#
發(fā)表于 2025-3-23 05:14:41 | 只看該作者
Voting power,mainly in law journals, and whose index has been used in arguments in various legal proceedings. For a comprehensive work on the problem of measuring voting power, see Felsenthal and Machover [87]. In this chapter, we present several results about generating functions and time complexity obtained by Fernández in his Ph. D. Thesis [89].
10#
發(fā)表于 2025-3-23 06:00:38 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-12 18:52
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
白银市| 青浦区| 顺义区| 铜陵市| 奉贤区| 利辛县| 启东市| 长泰县| 湖南省| 金川县| 蕉岭县| 桃源县| 炎陵县| 浑源县| 霍林郭勒市| 曲阜市| 专栏| 夹江县| 霞浦县| 新巴尔虎右旗| 苏尼特右旗| 雅江县| 疏附县| 曲松县| 永春县| 商南县| 潜山县| 炎陵县| 湘阴县| 布拖县| 新闻| 巢湖市| 商城县| 泽库县| 文成县| 郑州市| 柳江县| 腾冲县| 扎囊县| 桐梓县| 济阳县|