Error minimization methods in biproportional apportionment View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2012-10

AUTHORS

Federica Ricca, Andrea Scozzari, Paolo Serafini, Bruno Simeone

ABSTRACT

One of the most active research lines in the area of electoral systems to date deals with the Biproportional Apportionment Problem, which arises in those proportional systems where seats must be allocated to parties within territorial constituencies. A matrix of the vote counts of the parties within the constituencies is given, and one has to convert the vote matrix into an integer matrix of seats “as proportional as possible” to it, subject to the constraints that each constituency be granted its pre-specified number of seats, each party be allotted the total number of seats it is entitled to on the basis of its national vote count, and a zero-vote zero-seat condition be satisfied. The matrix of seats must simultaneously meet the integrality and the proportionality requirement, and this not infrequently gives rise to self-contradictory procedures in the electoral laws of some countries. Here we discuss a class of methods for Biproportional Apportionment characterized by an “error minimization” approach. If the integrality requirement is relaxed, fractional seat allocations (target shares) can be obtained so as to achieve proportionality at least in theory. In order to restore integrality, one then looks for integral apportionments that are as close as possible to the ideal ones in a suitable metric. This leads to the formulation of constrained optimization problems called “best approximation problems” which are solvable in polynomial time through the use of network flow techniques. These error minimization methods can be viewed as an alternative to the classical axiomatic approach introduced by Balinski and Demange (in Math Oper Res 14:700–719, 1989a; Math Program 45:193–210, 1989b). We provide an empirical comparison between these two approaches with a real example from the Italian Elections and a theoretical discussion about the axioms that are not necessarily satisfied by the error minimization methods. More... »

PAGES

547-577

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s11750-012-0252-x

DOI

http://dx.doi.org/10.1007/s11750-012-0252-x

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1031599178


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Sapienza University of Rome", 
          "id": "https://www.grid.ac/institutes/grid.7841.a", 
          "name": [
            "Dipartimento di Scienze Statistiche, Sapienza Universit\u00e0 di Roma, Piazzale Aldo Moro 5, 00185, Roma, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Ricca", 
        "givenName": "Federica", 
        "id": "sg:person.016420256135.86", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016420256135.86"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "name": [
            "Universit\u00e0 degli Studi Niccol\u00f2 Cusano\u2014Telematica, Via Casalmonferrato 2, 00182, Roma, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Scozzari", 
        "givenName": "Andrea", 
        "id": "sg:person.010616115443.54", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010616115443.54"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Udine", 
          "id": "https://www.grid.ac/institutes/grid.5390.f", 
          "name": [
            "Dipartimento di Matematica e Informatica, Universit\u00e0 di Udine, Via delle Scienze 206, 33100, Udine, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Serafini", 
        "givenName": "Paolo", 
        "id": "sg:person.012613244077.89", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012613244077.89"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Sapienza University of Rome", 
          "id": "https://www.grid.ac/institutes/grid.7841.a", 
          "name": [
            "Dipartimento di Scienze Statistiche, Sapienza Universit\u00e0 di Roma, Piazzale Aldo Moro 5, 00185, Roma, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Simeone", 
        "givenName": "Bruno", 
        "id": "sg:person.012600006066.78", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012600006066.78"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/bf01589103", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1003890771", 
          "https://doi.org/10.1007/bf01589103"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-83943-6_22", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1005309990", 
          "https://doi.org/10.1007/978-3-642-83943-6_22"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00355-010-0528-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1008592628", 
          "https://doi.org/10.1007/s00355-010-0528-8"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1080/03155986.1982.11731877", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1015238205"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/net.20434", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1016455221"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.mathsocsci.2008.01.004", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1019178560"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00186-007-0184-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1031947199", 
          "https://doi.org/10.1007/s00186-007-0184-7"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00186-007-0184-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1031947199", 
          "https://doi.org/10.1007/s00186-007-0184-7"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0377-2217(84)90160-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1035643081"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0377-2217(84)90160-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1035643081"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/net.20480", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1036699625"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bfb0121104", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1039728850", 
          "https://doi.org/10.1007/bfb0121104"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bfb0121104", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1039728850", 
          "https://doi.org/10.1007/bfb0121104"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s10288-005-0078-6", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1039890974", 
          "https://doi.org/10.1007/s10288-005-0078-6"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1080/01621459.1985.10478201", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1058303178"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1287/moor.14.4.700", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1064723413"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.2307/2525582", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1069971752"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2012-10", 
    "datePublishedReg": "2012-10-01", 
    "description": "One of the most active research lines in the area of electoral systems to date deals with the Biproportional Apportionment Problem, which arises in those proportional systems where seats must be allocated to parties within territorial constituencies. A matrix of the vote counts of the parties within the constituencies is given, and one has to convert the vote matrix into an integer matrix of seats \u201cas proportional as possible\u201d to it, subject to the constraints that each constituency be granted its pre-specified number of seats, each party be allotted the total number of seats it is entitled to on the basis of its national vote count, and a zero-vote zero-seat condition be satisfied. The matrix of seats must simultaneously meet the integrality and the proportionality requirement, and this not infrequently gives rise to self-contradictory procedures in the electoral laws of some countries. Here we discuss a class of methods for Biproportional Apportionment characterized by an \u201cerror minimization\u201d approach. If the integrality requirement is relaxed, fractional seat allocations (target shares) can be obtained so as to achieve proportionality at least in theory. In order to restore integrality, one then looks for integral apportionments that are as close as possible to the ideal ones in a suitable metric. This leads to the formulation of constrained optimization problems called \u201cbest approximation problems\u201d which are solvable in polynomial time through the use of network flow techniques. These error minimization methods can be viewed as an alternative to the classical axiomatic approach introduced by Balinski and Demange (in Math Oper Res 14:700\u2013719, 1989a; Math Program 45:193\u2013210, 1989b). We provide an empirical comparison between these two approaches with a real example from the Italian Elections and a theoretical discussion about the axioms that are not necessarily satisfied by the error minimization methods.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s11750-012-0252-x", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1136537", 
        "issn": [
          "1134-5764", 
          "1863-8279"
        ], 
        "name": "TOP", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "3", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "20"
      }
    ], 
    "name": "Error minimization methods in biproportional apportionment", 
    "pagination": "547-577", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "96882e6023d0c1fbd55a1e23c10b624213d0994f06d716de5053851ddc353ef4"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s11750-012-0252-x"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1031599178"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s11750-012-0252-x", 
      "https://app.dimensions.ai/details/publication/pub.1031599178"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T19:59", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8681_00000522.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007%2Fs11750-012-0252-x"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s11750-012-0252-x'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s11750-012-0252-x'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s11750-012-0252-x'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s11750-012-0252-x'


 

This table displays all metadata directly associated to this object as RDF triples.

135 TRIPLES      21 PREDICATES      41 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s11750-012-0252-x schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N635137e402f64123bc8361c7dc4cef66
4 schema:citation sg:pub.10.1007/978-3-642-83943-6_22
5 sg:pub.10.1007/bf01589103
6 sg:pub.10.1007/bfb0121104
7 sg:pub.10.1007/s00186-007-0184-7
8 sg:pub.10.1007/s00355-010-0528-8
9 sg:pub.10.1007/s10288-005-0078-6
10 https://doi.org/10.1002/net.20434
11 https://doi.org/10.1002/net.20480
12 https://doi.org/10.1016/0377-2217(84)90160-7
13 https://doi.org/10.1016/j.mathsocsci.2008.01.004
14 https://doi.org/10.1080/01621459.1985.10478201
15 https://doi.org/10.1080/03155986.1982.11731877
16 https://doi.org/10.1287/moor.14.4.700
17 https://doi.org/10.2307/2525582
18 schema:datePublished 2012-10
19 schema:datePublishedReg 2012-10-01
20 schema:description One of the most active research lines in the area of electoral systems to date deals with the Biproportional Apportionment Problem, which arises in those proportional systems where seats must be allocated to parties within territorial constituencies. A matrix of the vote counts of the parties within the constituencies is given, and one has to convert the vote matrix into an integer matrix of seats “as proportional as possible” to it, subject to the constraints that each constituency be granted its pre-specified number of seats, each party be allotted the total number of seats it is entitled to on the basis of its national vote count, and a zero-vote zero-seat condition be satisfied. The matrix of seats must simultaneously meet the integrality and the proportionality requirement, and this not infrequently gives rise to self-contradictory procedures in the electoral laws of some countries. Here we discuss a class of methods for Biproportional Apportionment characterized by an “error minimization” approach. If the integrality requirement is relaxed, fractional seat allocations (target shares) can be obtained so as to achieve proportionality at least in theory. In order to restore integrality, one then looks for integral apportionments that are as close as possible to the ideal ones in a suitable metric. This leads to the formulation of constrained optimization problems called “best approximation problems” which are solvable in polynomial time through the use of network flow techniques. These error minimization methods can be viewed as an alternative to the classical axiomatic approach introduced by Balinski and Demange (in Math Oper Res 14:700–719, 1989a; Math Program 45:193–210, 1989b). We provide an empirical comparison between these two approaches with a real example from the Italian Elections and a theoretical discussion about the axioms that are not necessarily satisfied by the error minimization methods.
21 schema:genre research_article
22 schema:inLanguage en
23 schema:isAccessibleForFree false
24 schema:isPartOf N9a5a64cf343843e2b7b1edd6f88bf270
25 Na5c8e6b6ac654b3db35c88c2ee59cb63
26 sg:journal.1136537
27 schema:name Error minimization methods in biproportional apportionment
28 schema:pagination 547-577
29 schema:productId N1ff6ae37f9e648c4bba554921d966312
30 N31ed0f5bf0ed4686be0f82e079c320fa
31 Ne007b9450ccd4059a2751b1d5faa1393
32 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031599178
33 https://doi.org/10.1007/s11750-012-0252-x
34 schema:sdDatePublished 2019-04-10T19:59
35 schema:sdLicense https://scigraph.springernature.com/explorer/license/
36 schema:sdPublisher N2ac0fc1a28354492a8e3bb5324e1d37c
37 schema:url http://link.springer.com/10.1007%2Fs11750-012-0252-x
38 sgo:license sg:explorer/license/
39 sgo:sdDataset articles
40 rdf:type schema:ScholarlyArticle
41 N1ff6ae37f9e648c4bba554921d966312 schema:name readcube_id
42 schema:value 96882e6023d0c1fbd55a1e23c10b624213d0994f06d716de5053851ddc353ef4
43 rdf:type schema:PropertyValue
44 N2ac0fc1a28354492a8e3bb5324e1d37c schema:name Springer Nature - SN SciGraph project
45 rdf:type schema:Organization
46 N31ed0f5bf0ed4686be0f82e079c320fa schema:name dimensions_id
47 schema:value pub.1031599178
48 rdf:type schema:PropertyValue
49 N635137e402f64123bc8361c7dc4cef66 rdf:first sg:person.016420256135.86
50 rdf:rest Nc5b2b77d4b174df1a3e5f9a783e1d7c4
51 N66ae72721e884e918aed7f2fab16b43a rdf:first sg:person.012600006066.78
52 rdf:rest rdf:nil
53 N9a5a64cf343843e2b7b1edd6f88bf270 schema:volumeNumber 20
54 rdf:type schema:PublicationVolume
55 N9ac44d0c32794f819ef54afcab732a7b schema:name Università degli Studi Niccolò Cusano—Telematica, Via Casalmonferrato 2, 00182, Roma, Italy
56 rdf:type schema:Organization
57 N9e49f9df437b4c1bb490b375d38ce9ec rdf:first sg:person.012613244077.89
58 rdf:rest N66ae72721e884e918aed7f2fab16b43a
59 Na5c8e6b6ac654b3db35c88c2ee59cb63 schema:issueNumber 3
60 rdf:type schema:PublicationIssue
61 Nc5b2b77d4b174df1a3e5f9a783e1d7c4 rdf:first sg:person.010616115443.54
62 rdf:rest N9e49f9df437b4c1bb490b375d38ce9ec
63 Ne007b9450ccd4059a2751b1d5faa1393 schema:name doi
64 schema:value 10.1007/s11750-012-0252-x
65 rdf:type schema:PropertyValue
66 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
67 schema:name Information and Computing Sciences
68 rdf:type schema:DefinedTerm
69 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
70 schema:name Computation Theory and Mathematics
71 rdf:type schema:DefinedTerm
72 sg:journal.1136537 schema:issn 1134-5764
73 1863-8279
74 schema:name TOP
75 rdf:type schema:Periodical
76 sg:person.010616115443.54 schema:affiliation N9ac44d0c32794f819ef54afcab732a7b
77 schema:familyName Scozzari
78 schema:givenName Andrea
79 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010616115443.54
80 rdf:type schema:Person
81 sg:person.012600006066.78 schema:affiliation https://www.grid.ac/institutes/grid.7841.a
82 schema:familyName Simeone
83 schema:givenName Bruno
84 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012600006066.78
85 rdf:type schema:Person
86 sg:person.012613244077.89 schema:affiliation https://www.grid.ac/institutes/grid.5390.f
87 schema:familyName Serafini
88 schema:givenName Paolo
89 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012613244077.89
90 rdf:type schema:Person
91 sg:person.016420256135.86 schema:affiliation https://www.grid.ac/institutes/grid.7841.a
92 schema:familyName Ricca
93 schema:givenName Federica
94 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016420256135.86
95 rdf:type schema:Person
96 sg:pub.10.1007/978-3-642-83943-6_22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005309990
97 https://doi.org/10.1007/978-3-642-83943-6_22
98 rdf:type schema:CreativeWork
99 sg:pub.10.1007/bf01589103 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003890771
100 https://doi.org/10.1007/bf01589103
101 rdf:type schema:CreativeWork
102 sg:pub.10.1007/bfb0121104 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039728850
103 https://doi.org/10.1007/bfb0121104
104 rdf:type schema:CreativeWork
105 sg:pub.10.1007/s00186-007-0184-7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031947199
106 https://doi.org/10.1007/s00186-007-0184-7
107 rdf:type schema:CreativeWork
108 sg:pub.10.1007/s00355-010-0528-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008592628
109 https://doi.org/10.1007/s00355-010-0528-8
110 rdf:type schema:CreativeWork
111 sg:pub.10.1007/s10288-005-0078-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039890974
112 https://doi.org/10.1007/s10288-005-0078-6
113 rdf:type schema:CreativeWork
114 https://doi.org/10.1002/net.20434 schema:sameAs https://app.dimensions.ai/details/publication/pub.1016455221
115 rdf:type schema:CreativeWork
116 https://doi.org/10.1002/net.20480 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036699625
117 rdf:type schema:CreativeWork
118 https://doi.org/10.1016/0377-2217(84)90160-7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035643081
119 rdf:type schema:CreativeWork
120 https://doi.org/10.1016/j.mathsocsci.2008.01.004 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019178560
121 rdf:type schema:CreativeWork
122 https://doi.org/10.1080/01621459.1985.10478201 schema:sameAs https://app.dimensions.ai/details/publication/pub.1058303178
123 rdf:type schema:CreativeWork
124 https://doi.org/10.1080/03155986.1982.11731877 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015238205
125 rdf:type schema:CreativeWork
126 https://doi.org/10.1287/moor.14.4.700 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064723413
127 rdf:type schema:CreativeWork
128 https://doi.org/10.2307/2525582 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069971752
129 rdf:type schema:CreativeWork
130 https://www.grid.ac/institutes/grid.5390.f schema:alternateName University of Udine
131 schema:name Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100, Udine, Italy
132 rdf:type schema:Organization
133 https://www.grid.ac/institutes/grid.7841.a schema:alternateName Sapienza University of Rome
134 schema:name Dipartimento di Scienze Statistiche, Sapienza Università di Roma, Piazzale Aldo Moro 5, 00185, Roma, Italy
135 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...