Simple games are mathematical structures inspired by voting systems in which a single alternative, such as a bill, is pitted against the status quo. The first in-depth mathematical study of the subject as a coherent subfield of finite combinatorics--one with its own organized body of techniques and results--this book blends new theorems with some of the striking results from threshold logic, making all of it accessible to game theorists. Introductory material receives a fresh treatment, with an emphasis on Boolean subgames and the Rudin-Keisler order as unifying concepts. Advanced material focuses on the surprisingly wide variety of properties related to the weightedness of a game.
A desirability relation orders the individuals or coalitions of a game according to their influence in the corresponding voting system. As Taylor and Zwicker show, acyclicity of such a relation approximates weightedness--the more sensitive the relation, the closer the approximation. A trade is an exchange of players among coalitions, and robustness under such trades is equivalent to weightedness of the game. Robustness under trades that fit some restrictive exchange pattern typically characterizes a wider class of simple games--for example, games for which some particular desirability order is acyclic. Finally, one can often describe these wider classes of simple games by weakening the total additivity of a weighting to obtain what is called a pseudoweighting. In providing such uniform explanations for many of the structural properties of simple games, this book showcases numerous new techniques and results.Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Alan D. Taylor is the Marie Louise Bailey Professor of Mathematics at Union College. William S. Zwicker is Professor of Mathematics at Union College. Both have taught at Union for twenty-four years; their research has been in the areas of combinatorial set theory and applications of mathematics to political science, including social choice theory, fair division, and game theory.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur WP-9780691001203
Quantité disponible : 2 disponible(s)
Vendeur : Rarewaves USA, OSWEGO, IL, Etats-Unis
Hardback. Etat : New. Simple games are mathematical structures inspired by voting systems in which a single alternative, such as a bill, is pitted against the status quo. The first in-depth mathematical study of the subject as a coherent subfield of finite combinatorics--one with its own organized body of techniques and results--this book blends new theorems with some of the striking results from threshold logic, making all of it accessible to game theorists. Introductory material receives a fresh treatment, with an emphasis on Boolean subgames and the Rudin-Keisler order as unifying concepts. Advanced material focuses on the surprisingly wide variety of properties related to the weightedness of a game. A desirability relation orders the individuals or coalitions of a game according to their influence in the corresponding voting system. As Taylor and Zwicker show, acyclicity of such a relation approximates weightedness--the more sensitive the relation, the closer the approximation. A trade is an exchange of players among coalitions, and robustness under such trades is equivalent to weightedness of the game.Robustness under trades that fit some restrictive exchange pattern typically characterizes a wider class of simple games--for example, games for which some particular desirability order is acyclic. Finally, one can often describe these wider classes of simple games by weakening the total additivity of a weighting to obtain what is called a pseudoweighting. In providing such uniform explanations for many of the structural properties of simple games, this book showcases numerous new techniques and results. N° de réf. du vendeur LU-9780691001203
Quantité disponible : Plus de 20 disponibles
Vendeur : BennettBooksLtd, Los Angeles, CA, Etats-Unis
hardcover. Etat : New. In shrink wrap. Looks like an interesting title! N° de réf. du vendeur Q-0691001200
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 403118
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 403118-n
Quantité disponible : 1 disponible(s)
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. Simple games are mathematical structures inspired by voting systems in which a single alternative. The mathematical study of the subject as a coherent subfield of finite combinatorics, this book includes introductory material, with an emphasis on Boolean subgames and the Rudin-Keisler order as unifying concepts. Num Pages: 264 pages, 47 line illus. BIC Classification: PBUD. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 229 x 152 x 19. Weight in Grams: 514. . 1999. Hardcover. . . . . N° de réf. du vendeur V9780691001203
Quantité disponible : 1 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur WP-9780691001203
Quantité disponible : 2 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 403118-n
Quantité disponible : 1 disponible(s)
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
Hardback. Etat : New. Simple games are mathematical structures inspired by voting systems in which a single alternative, such as a bill, is pitted against the status quo. The first in-depth mathematical study of the subject as a coherent subfield of finite combinatorics--one with its own organized body of techniques and results--this book blends new theorems with some of the striking results from threshold logic, making all of it accessible to game theorists. Introductory material receives a fresh treatment, with an emphasis on Boolean subgames and the Rudin-Keisler order as unifying concepts. Advanced material focuses on the surprisingly wide variety of properties related to the weightedness of a game. A desirability relation orders the individuals or coalitions of a game according to their influence in the corresponding voting system. As Taylor and Zwicker show, acyclicity of such a relation approximates weightedness--the more sensitive the relation, the closer the approximation. A trade is an exchange of players among coalitions, and robustness under such trades is equivalent to weightedness of the game.Robustness under trades that fit some restrictive exchange pattern typically characterizes a wider class of simple games--for example, games for which some particular desirability order is acyclic. Finally, one can often describe these wider classes of simple games by weakening the total additivity of a weighting to obtain what is called a pseudoweighting. In providing such uniform explanations for many of the structural properties of simple games, this book showcases numerous new techniques and results. N° de réf. du vendeur LU-9780691001203
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Simple games are mathematical structures inspired by voting systems in which a single alternative. The mathematical study of the subject as a coherent subfield of finite combinatorics, this book includes introductory material, with an emphasis on Boolean su. N° de réf. du vendeur 594880848
Quantité disponible : Plus de 20 disponibles