My Account | Help Desk | Market Place Shopping Cart
No items in cart.
Total: $0.00
Textbooks Sell Textbooks Books Supplies Medical Books College Apparel Movies Clearance
Search  Advanced >>
Related Topics: Technology >> Mathematical Analysis
Welcome Coahoma Community College Students!
Navigate: (use the links to quickly navigate your virtual bookstore)
Cooperative Game Theory and Applications: Cooperative Games Arising from Combinatorial Optimization Problems,9780792344766
Other versions by this Author

Cooperative Game Theory and Applications: Cooperative Games Arising from Combinatorial Optimization Problems


Author(s): Curiel, Imma
ISBN10:  0792344766
ISBN13:  9780792344766
Format:  Hardcover
Pub. Date:  6/1/1997
Publisher(s): Kluwer Academic Print on Demand


Share |
New Price  N/A
List Price $179.00
eVIP Price  N/A
New Copy:  Currently Not Available
add remove
SummaryTable of Contents
In this book applications of cooperative game theory that arise from combinatorial optimization problems are described. It is well known that the mathematical modeling of various real-world decision-making situations gives rise to combinatorial optimization problems. For situations where more than one decision-maker is involved classical combinatorial optimization theory does not suffice and it is here that cooperative game theory can make an important contribution. If a group of decision-makers decide to undertake a project together in order to increase the total revenue or decrease the total costs, they face two problems. The first one is how to execute the project in an optimal way so as to increase revenue. The second one is how to divide the revenue attained among the participants. It is with this second problem that cooperative game theory can help. The solution concepts from cooperative game theory can be applied to arrive at revenue allocation schemes. In this book the type of problems described above are examined. Although the choice of topics is application-driven, it also discusses theoretical questions that arise from the situations that are studied. For all the games described attention will be paid to the appropriateness of several game-theoretic solution concepts in the particular contexts that are considered. The computation complexity of the game-theoretic solution concepts in the situation at hand will also be considered.

Describes applications of cooperative theory that arise from combinatorial optimization. Discusses linear programming games and extensions and deals with Sequencing games, Travelling Salesman Games and Routing Games.
PREFACE vii
1 COOPERATIVE GAMES AND SOLUTION CONCEPTS
1(18)
1.1 Introduction
1(1)
1.2 Cooperative Games in Characteristic Function Form
2(3)
1.3 The Core and the Weber Set
5(2)
1.4 Convex Games and the Minimarg and Maximarg Operators
7(1)
1.5 The Shapley-value
8(2)
1.6 The Bargaining Set
10(1)
1.7 The (Pre-)Kernel and the (Pre-)Nucleolus
11(1)
1.8 The XXX-value
12(2)
1.9 Semiconvex and 1-Convex Games
14(1)
1.10 Simple Games
15(1)
1.11 Cost Games
16(3)
2 LINEAR PROGRAMMING GAMES
19(34)
2.1 Introduction
19(3)
2.2 Linear Programming Games
22(9)
2.3 Linear Programming Games with Committee Control
31(6)
2.4 Non-Balanced Linear Programming Games
37(3)
2.5 Linear Programming Games with Claims
40(5)
2.6 Simple Flow Games
45(8)
ASSIGNMENT GAMES AND PERMUTATION GAMES
53(26)
3.1 Introduction
53(2)
3.2 Assignment Games and Permutation Games
55(5)
3.3 Multi-Assignment Games and Multi-Permutation Games
60(9)
3.4 Economies with Indivisibilities
69(3)
3.5 Ordinal Matching Situations
72(7)
4 SEQUENCING GAMES AND GENERALIZATIONS
79(32)
4.1 Introduction
79(1)
4.2 Sequencing Games
80(23)
4.3 XXX-Pairing Games and XXX-Component Additive Games
103(8)
5 TRAVELLING SALESMAN GAMES AND ROUTING GAMES
111(18)
5.1 Introduction
111(2)
5.2 Travelling Salesman Games
113(8)
5.3 Routing Games
121(8)
6 MINIMUM COST SPANNING TREE GAMES
129(20)
6.1 Introduction
129(2)
6.2 Minimum Cost Spanning Tree Games
131(5)
6.3 The Irreducible Core
136(6)
6.4 The Restricted Weighted Shapley-value and Permutationally Concave Games
142(4)
6.5 Generalizations, Variations, and Special Cases
146(3)
7 LOCATION GAMES
149(24)
7.1 Introduction
149(2)
7.2 Location Games with Equal Setup Costs
151(3)
7.3 1-Concave and Semiconcave Location Games
154(4)
7.4 Simple Plant Location Games
158(4)
7.5 Median Games with Budget Constraints
162(5)
7.6 Center Games with Budget Constraints
167(6)
REFERENCES 173(14)
INDEX 187

Check Out These Items!
eCampus.com Portfolio eCampus.com Portfolio
Retail Price $12.99
Our Price $5.00
eCampus.com T-Shirt eCampus.com T-Shirt
Retail Price $14.99
Our Price $2.00
eCampus.com 4GB USB Drive eCampus.com 4GB USB Drive
Retail Price $32.95
Our Price $25.00
eCampus.com Pen eCampus.com Pen
Retail Price $2.99
Our Price $0.50
For support, contact our Virtual Bookstore Program Customer Service at:
877.284.6744 or bookstore@ecampus.com
  Buy Textbooks
  Sell Textbooks
  College Apparel
  Shop by School
  Virtual Bookstores
  Order Status
  Shipping Rates
  Return Policy
  Marketplace Info
  F.A.S.T.
  Contact Us
  Privacy Policy
  Legal Notices
  Site Security
  Employment
  Help Desk
  eCampus Blog
  Affiliate Program
  Bulk Orders
  College Marketing
HACKER SAFE certified sites prevent over 99.9% of hacker crime.
eCampus.com blog follow eCampus.com on twitter find eCampus.com on facebook RSS Need Help? bookstore@ecampus.com   Copyright© 1999-2010     
.