Simple Games : : Desirability Relations, Trading, Pseudoweightings / / Alan D. Taylor, William S. Zwicker.

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...

Full description

Saved in:
Bibliographic Details
Superior document:Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013
VerfasserIn:
Place / Publishing House:Princeton, NJ : : Princeton University Press, , [2022]
©2000
Year of Publication:2022
Language:English
Online Access:
Physical Description:1 online resource (263 p.) :; 47 line illus.
Tags: Add Tag
No Tags, Be the first to tag this record!
id 9780691223896
lccn 2021694896
ctrlnum (DE-B1597)574695
collection bib_alma
record_format marc
spelling Taylor, Alan D., author. aut http://id.loc.gov/vocabulary/relators/aut
Simple Games : Desirability Relations, Trading, Pseudoweightings / Alan D. Taylor, William S. Zwicker.
Princeton, NJ : Princeton University Press, [2022]
©2000
1 online resource (263 p.) : 47 line illus.
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
Frontmatter -- Contents -- Preface -- Acknowledgments -- Chapter 1 - Fundamentals -- Chapter 2 - General Trading: Weighted Games -- Chapter 3 - Pairwise Trading: Linear Games and Winder Games -- Chapter 4 - Cycle Trading: Weakly Acyclic Games and Strongly Acyclic Games -- Chapter 5 - Almost General Trading: Chow Games, Completely Acyclic Games, and Weighted Games -- Appendix I: Systems of Linear Inequalities -- Appendix II: Separating Hyperplanes -- Appendix III: Duality and Transitivity for Binary Relations -- References -- Index
restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star
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.
Mode of access: Internet via World Wide Web.
In English.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 29. Jul 2022)
Game theory http://id.loc.gov/authorities/subjects/sh85052941.
Game theory.
Threshold logic http://id.loc.gov/authorities/subjects/sh85135048.
Threshold logic.
MATHEMATICS / Game Theory. bisacsh
B-medium coalition.
Boolean function.
Boolean subgame.
Canadian system.
Chow games.
Chow parameters.
EL-sequence.
Gabelman game.
Hahn-Banach theorem.
Harvard Band.
Luxembourg.
abstention.
adiabatic computing.
adjacency of vertices.
alternating cycle.
antisymmetry.
augmented trading matrix.
automorphic coalitions.
balanced game.
basic class.
bicameral join.
bicameral meet.
characteristic function form.
classification of linear games.
classified coalition.
column union.
complement symmetric relation.
compound simple game.
constant-sum games.
count and account method.
direct market.
double appearance.
downward closure.
dual game.
dual property.
edge, of a graph.
fair division.
geometry of simple games.
grant of certiorari.
high failure.
homogeneous games.
hypergraph.
identification of variables.
interval game.
k-asuramability.
large coalition.
linear games.
linear graph.
losing coalition.
major player.
master player.
monotonicity.
multipartition.
multiweighting.
Zwicker, William S., author. aut http://id.loc.gov/vocabulary/relators/aut
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 9783110442502
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Gap Years 9783110784237
https://doi.org/10.1515/9780691223896?locatt=mode:legacy
https://www.degruyter.com/isbn/9780691223896
Cover https://www.degruyter.com/document/cover/isbn/9780691223896/original
language English
format eBook
author Taylor, Alan D.,
Taylor, Alan D.,
Zwicker, William S.,
spellingShingle Taylor, Alan D.,
Taylor, Alan D.,
Zwicker, William S.,
Simple Games : Desirability Relations, Trading, Pseudoweightings /
Frontmatter --
Contents --
Preface --
Acknowledgments --
Chapter 1 - Fundamentals --
Chapter 2 - General Trading: Weighted Games --
Chapter 3 - Pairwise Trading: Linear Games and Winder Games --
Chapter 4 - Cycle Trading: Weakly Acyclic Games and Strongly Acyclic Games --
Chapter 5 - Almost General Trading: Chow Games, Completely Acyclic Games, and Weighted Games --
Appendix I: Systems of Linear Inequalities --
Appendix II: Separating Hyperplanes --
Appendix III: Duality and Transitivity for Binary Relations --
References --
Index
author_facet Taylor, Alan D.,
Taylor, Alan D.,
Zwicker, William S.,
Zwicker, William S.,
Zwicker, William S.,
author_variant a d t ad adt
a d t ad adt
w s z ws wsz
author_role VerfasserIn
VerfasserIn
VerfasserIn
author2 Zwicker, William S.,
Zwicker, William S.,
author2_variant w s z ws wsz
author2_role VerfasserIn
VerfasserIn
author_sort Taylor, Alan D.,
title Simple Games : Desirability Relations, Trading, Pseudoweightings /
title_sub Desirability Relations, Trading, Pseudoweightings /
title_full Simple Games : Desirability Relations, Trading, Pseudoweightings / Alan D. Taylor, William S. Zwicker.
title_fullStr Simple Games : Desirability Relations, Trading, Pseudoweightings / Alan D. Taylor, William S. Zwicker.
title_full_unstemmed Simple Games : Desirability Relations, Trading, Pseudoweightings / Alan D. Taylor, William S. Zwicker.
title_auth Simple Games : Desirability Relations, Trading, Pseudoweightings /
title_alt Frontmatter --
Contents --
Preface --
Acknowledgments --
Chapter 1 - Fundamentals --
Chapter 2 - General Trading: Weighted Games --
Chapter 3 - Pairwise Trading: Linear Games and Winder Games --
Chapter 4 - Cycle Trading: Weakly Acyclic Games and Strongly Acyclic Games --
Chapter 5 - Almost General Trading: Chow Games, Completely Acyclic Games, and Weighted Games --
Appendix I: Systems of Linear Inequalities --
Appendix II: Separating Hyperplanes --
Appendix III: Duality and Transitivity for Binary Relations --
References --
Index
title_new Simple Games :
title_sort simple games : desirability relations, trading, pseudoweightings /
publisher Princeton University Press,
publishDate 2022
physical 1 online resource (263 p.) : 47 line illus.
contents Frontmatter --
Contents --
Preface --
Acknowledgments --
Chapter 1 - Fundamentals --
Chapter 2 - General Trading: Weighted Games --
Chapter 3 - Pairwise Trading: Linear Games and Winder Games --
Chapter 4 - Cycle Trading: Weakly Acyclic Games and Strongly Acyclic Games --
Chapter 5 - Almost General Trading: Chow Games, Completely Acyclic Games, and Weighted Games --
Appendix I: Systems of Linear Inequalities --
Appendix II: Separating Hyperplanes --
Appendix III: Duality and Transitivity for Binary Relations --
References --
Index
isbn 9780691223896
9783110442502
9783110784237
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA269
callnumber-sort QA 3269
url https://doi.org/10.1515/9780691223896?locatt=mode:legacy
https://www.degruyter.com/isbn/9780691223896
https://www.degruyter.com/document/cover/isbn/9780691223896/original
illustrated Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 519 - Probabilities & applied mathematics
dewey-full 519.3
dewey-sort 3519.3
dewey-raw 519.3
dewey-search 519.3
doi_str_mv 10.1515/9780691223896?locatt=mode:legacy
work_keys_str_mv AT tayloraland simplegamesdesirabilityrelationstradingpseudoweightings
AT zwickerwilliams simplegamesdesirabilityrelationstradingpseudoweightings
status_str n
ids_txt_mv (DE-B1597)574695
carrierType_str_mv cr
hierarchy_parent_title Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Gap Years
is_hierarchy_title Simple Games : Desirability Relations, Trading, Pseudoweightings /
container_title Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013
author2_original_writing_str_mv noLinkedField
noLinkedField
_version_ 1806143298929164288
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06885nam a22013815i 4500</leader><controlfield tag="001">9780691223896</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20220729113935.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">220729t20222000nju fo d z eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2021694896</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780691223896</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9780691223896</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)574695</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1="0" ind2="0"><subfield code="a">QA269</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA269</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT011000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">519.3</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Taylor, Alan D., </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Simple Games :</subfield><subfield code="b">Desirability Relations, Trading, Pseudoweightings /</subfield><subfield code="c">Alan D. Taylor, William S. Zwicker.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2022]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (263 p.) :</subfield><subfield code="b">47 line illus.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">Acknowledgments -- </subfield><subfield code="t">Chapter 1 - Fundamentals -- </subfield><subfield code="t">Chapter 2 - General Trading: Weighted Games -- </subfield><subfield code="t">Chapter 3 - Pairwise Trading: Linear Games and Winder Games -- </subfield><subfield code="t">Chapter 4 - Cycle Trading: Weakly Acyclic Games and Strongly Acyclic Games -- </subfield><subfield code="t">Chapter 5 - Almost General Trading: Chow Games, Completely Acyclic Games, and Weighted Games -- </subfield><subfield code="t">Appendix I: Systems of Linear Inequalities -- </subfield><subfield code="t">Appendix II: Separating Hyperplanes -- </subfield><subfield code="t">Appendix III: Duality and Transitivity for Binary Relations -- </subfield><subfield code="t">References -- </subfield><subfield code="t">Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 29. Jul 2022)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Game theory</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85052941.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Game theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Threshold logic</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85135048.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Threshold logic.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Game Theory.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">B-medium coalition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Boolean function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Boolean subgame.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Canadian system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Chow games.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Chow parameters.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">EL-sequence.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Gabelman game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Hahn-Banach theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Harvard Band.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Luxembourg.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">abstention.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">adiabatic computing.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">adjacency of vertices.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">alternating cycle.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">antisymmetry.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">augmented trading matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">automorphic coalitions.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">balanced game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">basic class.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">bicameral join.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">bicameral meet.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">characteristic function form.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">classification of linear games.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">classified coalition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">column union.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">complement symmetric relation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">compound simple game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">constant-sum games.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">count and account method.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">direct market.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">double appearance.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">downward closure.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">dual game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">dual property.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">edge, of a graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">fair division.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">geometry of simple games.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">grant of certiorari.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">high failure.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">homogeneous games.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">hypergraph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">identification of variables.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">interval game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">k-asuramability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">large coalition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">linear games.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">linear graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">losing coalition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">major player.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">master player.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">monotonicity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">multipartition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">multiweighting.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zwicker, William S., </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="z">9783110442502</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press eBook-Package Gap Years</subfield><subfield code="z">9783110784237</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9780691223896?locatt=mode:legacy</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9780691223896</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9780691223896/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-044250-2 Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="c">2000</subfield><subfield code="d">2013</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-078423-7 Princeton University Press eBook-Package Gap Years</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield></record></collection>