设为首页收藏本站
开启辅助访问 切换到窄版

 找回密码
 To register

QQ登录

只需一步，快速开始

扫一扫，访问微社区

  • ALL
  • Journals
  • Books

派博传思国际中心 »期刊书目

› BOOKS
› BOOKS with Alphabet C (Ca, Cb,Cc, Cd, Ce…... )

12345下一页
返回列表

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

[复制链接]
查看: 47061|回复: 46
发表于 2025-3-21 16:24:50 | 显示全部楼层 |阅读模式
书目名称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
关键词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影响因子(影响力)学科排名




书目名称Cooperative Games on Combinatorial Structures网络公开度




书目名称Cooperative Games on Combinatorial Structures网络公开度学科排名




书目名称Cooperative Games on Combinatorial Structures被引频次




书目名称Cooperative Games on Combinatorial Structures被引频次学科排名




书目名称Cooperative Games on Combinatorial Structures年度引用




书目名称Cooperative Games on Combinatorial Structures年度引用学科排名




书目名称Cooperative Games on Combinatorial Structures读者反馈




书目名称Cooperative Games on Combinatorial Structures读者反馈学科排名




单选投票, 共有 0 人参与投票
1.jpg
 

0票 0%

Perfect with Aesthetics
2.jpg
 

0票 0%

Better Implies Difficulty
3.jpg
 

0票 0%

Good and Satisfactory
4.jpg
 

0票 0%

Adverse Performance
5.jpg
 

0票 0%

Disdainful Garbage
您所在的用户组没有投票权限
婉言
回复

举报

发表于 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.
贪婪性
回复

举报

发表于 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].
Ceramic
回复

举报

发表于 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.
抒情短诗
回复

举报

发表于 2025-3-22 09:42:15 | 显示全部楼层
investigate
回复

举报

发表于 2025-3-22 15:04:20 | 显示全部楼层
GLOOM
回复

举报

发表于 2025-3-22 20:05:06 | 显示全部楼层
GLOOM
回复

举报

发表于 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].
LEVER
回复

举报

发表于 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].
Grating
回复

举报

发表于 2025-3-23 06:00:38 | 显示全部楼层
记忆
回复

举报

下一页 »
12345下一页
返回列表
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-18 22:56
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表