As the first multilateral development bank (MDB) initiated by China, the Asian Infrastructure Investment Bank (AIIB) has been growing rapidly, and within three years of its establishment, has become the second largest multilateral development bank after the World Bank. With the assistance of the supercomputer (Weiming‐1) and combing the method of generating functions, we measured precisely the voting power of each member of the AIIB (analysis which has been done for the first time for an organization with more than 80 members and more than 1 million distributed votes). We find that a host of member countries other than China have outsized power to prevent action on significant matters, but their power to initiate action are quite modest and closely distributed. Furthermore, the power structures in the AIIB are relatively even or ‘democratic’ on substantive matters when compared to procedural matters. More interestingly, we analyzed the dynamics of voting power of major members like China, India, Russia, Germany, the UK and France with the admission of new members. While the voting weights of all existing members decreased monotonously and proportionally, the voting power of some members in some cases even increased. We find that the requirements of voting rules, and the size of new and existing members, all affect how members’ power evolve. Lastly, we measured the balance of power and the decision‐making efficiency of the AIIB as a whole organization beyond individual members and discussed relationships between them. Our analysis aims to provide insights into the allocation of voting weights, the design of voting rules and importantly, the choice of membership expansions for growing multilateral development banks.
Abstract. We consider settings where a collection of agents express preferences over a set of candidates with a combinatorial structure via the use of CP-nets, and we need to exploit the information contained in the CP-nets to choose one of the candidates. Moreover, there is a set of constraints which defines the unfeasible candidates, which cannot be the result of the preference aggregation. We propose a method to achieve this which is based on voting, and considers one variable at a time in a sequence. This method has been studied in the literature to aggregate non-constrained CP-nets. Here we generalise it to work with constrained CP-nets, and we study its properties. The constraints are used to leave in the variable domains only the admissible values. This allows the voting steps to return only feasible values. We find conditions of coherence between the preference expressed in the CP nets and the constraints, in order to guarantee that the classical sequential aggregation method always returns a feasible candidate. Even when such conditions are not met, but the constraints defining the unfeasible candidates have a tree structure (or a structure with bounded tree-width), and the collection of CP-nets is O-legal (that is, the dependency graphs of the CP-nets are compatible), we show that our more general voting procedure can be used, and that it is polynomial in the number of features describing the candidates and in the number of voters.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.