9780691001203 - simple games: desirability relations, trading, pseudoweightings di taylor, alan d.; zwicker, william s. (20 risultati)

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Hardback. Condizione: 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.…

hardcover. Condizione: New. In shrink wrap. Looks like an interesting title.

Condizione: 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. . . . .…

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Condizione: New.

Condizione: 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. . . . . Books ship from the US and Ireland.…

Hardback. Condizione: 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.…

Condizione: New. In English.

Hardback. Condizione: New. New copy - Usually dispatched within 4 working days.

Hardback. Condizione: 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.…

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Hardback. Condizione: 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.…

Hardcover. Condizione: Brand New. illustrated edition. 248 pages. 9.50x6.75x1.00 inches. In Stock.

Hardcover. Condizione: Brand New. illustrated edition. 248 pages. 9.50x6.75x1.00 inches. In Stock. This item is printed on demand.

Gebunden. Condizione: 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.…

Buch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…

Buch. Condizione: Neu. Simple Games | Desirability Relations, Trading, Pseudoweightings | Alan D. Taylor (u. a.) | Buch | Einband - fest (Hardcover) | Englisch | 1999 | Princeton University Press | EAN 9780691001203 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. …