| Working Paper |
File Downloads |
Abstract Views |
| Last month |
3 months |
12 months |
Total |
Last month |
3 months |
12 months |
Total |
| A Class of Solidarity Allocation Rules for TU-games |
0 |
0 |
1 |
31 |
2 |
2 |
5 |
55 |
| A Class of Solidarity Allocation Rules for TU-games |
0 |
0 |
0 |
0 |
3 |
3 |
5 |
38 |
| A Core-Partition Ranking Solution to Coalitional Ranking Problems |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
5 |
| A Core-partition solution for coalitional rankings with a variable population domain |
0 |
0 |
0 |
16 |
0 |
0 |
1 |
36 |
| A Decomposition of the Space of TU-games Using Addition and Transfer Invariance |
0 |
0 |
0 |
0 |
2 |
2 |
3 |
40 |
| A Decomposition of the Space of TU-games Using Addition and Transfer Invariance |
0 |
0 |
1 |
18 |
0 |
0 |
2 |
88 |
| A characterization of the family of Weighted priority values |
0 |
0 |
2 |
15 |
3 |
3 |
6 |
32 |
| A characterization of the family of Weighted priority values |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
2 |
| A class of solidarity allocation rules for TU-games |
0 |
0 |
0 |
7 |
1 |
2 |
4 |
35 |
| A strategic implementation of the sequential equal surplus division rule for digraph cooperative games |
0 |
0 |
0 |
18 |
1 |
2 |
2 |
26 |
| A strategic implementation of the sequential equal surplus division rule for digraph cooperative games |
0 |
0 |
0 |
14 |
1 |
1 |
3 |
45 |
| A strategic implementation of the sequential equal surplus division rule for digraph cooperative games |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
25 |
| Accessibility and stability of the coalition structure core |
0 |
0 |
0 |
0 |
0 |
1 |
5 |
26 |
| Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
5 |
| Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution |
0 |
0 |
0 |
0 |
1 |
1 |
6 |
13 |
| Allocation rules for museum pass programs |
0 |
0 |
0 |
34 |
1 |
1 |
3 |
95 |
| An Optimal Bound to Access the Core in TU-Games |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
36 |
| An axiomatization of the iterated h-index and applications to sport rankings |
0 |
0 |
0 |
42 |
0 |
1 |
3 |
95 |
| An axiomatization of the iterated h-index and applications to sport rankings |
0 |
0 |
0 |
28 |
0 |
1 |
2 |
54 |
| An optimal bound to acces the core of TU-games |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
26 |
| An optimal bound to access the core in TU-games |
0 |
0 |
0 |
0 |
1 |
2 |
3 |
35 |
| An optimal bound to access the core in TU-games |
0 |
0 |
0 |
31 |
2 |
3 |
6 |
87 |
| An optimal bound to access the core in TU-games |
0 |
0 |
0 |
0 |
1 |
2 |
5 |
39 |
| An optimal bound to access the core in TU-games |
0 |
0 |
0 |
0 |
1 |
3 |
3 |
34 |
| Average Tree Solutions and the Distribution of Harsanyi Dividends |
0 |
0 |
0 |
0 |
2 |
2 |
3 |
46 |
| Average Tree Solutions and the Distribution of Harsanyi Dividends |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
25 |
| Average Tree Solutions and the Distribution of Harsanyi Dividends |
0 |
0 |
0 |
0 |
3 |
3 |
3 |
37 |
| Average tree solution for graph games |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
35 |
| Average tree solutions and the distribution of Harsanyi dividends |
0 |
0 |
0 |
33 |
0 |
0 |
1 |
95 |
| Average tree solutions for graph games |
0 |
0 |
0 |
0 |
3 |
4 |
5 |
30 |
| Average tree solutions for graph games |
0 |
0 |
0 |
54 |
1 |
2 |
5 |
302 |
| Axiomatic and bargaining foundation of an allocation rule for ordered tree TU-games |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
27 |
| Axiomatic and bargaining foundation of an allocation rule for ordered tree TU-games |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
38 |
| Axiomatic and bargaining foundations of an allocation rule for ordered tree TU-games |
0 |
0 |
1 |
27 |
4 |
4 |
7 |
63 |
| Axiomatic characterizations of the core without consistency |
0 |
0 |
0 |
14 |
1 |
1 |
3 |
24 |
| Axiomatic characterizations of the core without consistency |
0 |
0 |
0 |
0 |
1 |
1 |
4 |
4 |
| Axiomatic characterizations of the core without consistency |
0 |
0 |
0 |
9 |
0 |
0 |
3 |
26 |
| Axiomatic characterizations of the core without consistency |
0 |
0 |
0 |
0 |
0 |
2 |
3 |
4 |
| Axiomatic characterizations of the family of Weighted priority values |
0 |
0 |
0 |
0 |
1 |
2 |
3 |
11 |
| Axiomatic characterizations under players nullification |
0 |
0 |
0 |
25 |
1 |
2 |
4 |
65 |
| Axiomatic characterizations under players nullification |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
39 |
| Axiomatic characterizations under players nullification |
0 |
0 |
0 |
8 |
0 |
0 |
3 |
32 |
| Axiomatization and implementation of a class of solidarity values for TU-games |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
38 |
| Axiomatization of an allocation rule for ordered tree TU-games |
0 |
0 |
0 |
0 |
2 |
2 |
4 |
44 |
| Axioms of Invariance for TU-games |
0 |
0 |
2 |
54 |
1 |
1 |
5 |
157 |
| Axioms of Invariance for TU-games |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
39 |
| Axioms of invariance for TU-games |
0 |
0 |
0 |
25 |
1 |
1 |
3 |
73 |
| Balanced collective contributions, the equal allocation of non-separable costs and application to data sharing games |
0 |
0 |
0 |
1 |
0 |
1 |
3 |
31 |
| Balanced collective contributions, the equal allocation of non-separable costs and application to data sharing games |
0 |
0 |
1 |
36 |
1 |
1 |
3 |
67 |
| Bounded Rationality and Repeated Network Formation |
0 |
0 |
0 |
68 |
2 |
3 |
5 |
275 |
| Bounded Rationality and Repeated Network Formation |
0 |
0 |
0 |
1 |
1 |
2 |
5 |
26 |
| Bounded rationality and repeated network formation |
0 |
0 |
0 |
0 |
1 |
4 |
5 |
33 |
| Characterization of the Average Tree solution and its kernel |
0 |
0 |
0 |
8 |
3 |
7 |
10 |
53 |
| Characterization of the Average Tree solution and its kernel |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
28 |
| Characterization of the Average Tree solution and its kernel |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
30 |
| Characterization of the Average Tree solution and its kernel |
0 |
0 |
0 |
0 |
5 |
5 |
8 |
29 |
| Characterizations of Weighted and Equal Division Values |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
45 |
| Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
30 |
| Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
30 |
| Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form |
0 |
0 |
0 |
7 |
2 |
3 |
5 |
22 |
| Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form |
0 |
0 |
0 |
19 |
1 |
2 |
3 |
61 |
| Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
26 |
| Coalitional desirability and the equal division value |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
40 |
| Coalitional desirability and the equal division value |
0 |
0 |
0 |
31 |
0 |
0 |
4 |
62 |
| Cohesive efficiency in TU-games: Two extensions of the Shapley value |
0 |
0 |
0 |
24 |
6 |
7 |
9 |
95 |
| Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations |
0 |
0 |
0 |
0 |
3 |
4 |
7 |
10 |
| Comparable Axiomatizations of Two Allocation Rules for Cooperative Games with Transferable Utility and their Subclass of Data Games |
0 |
0 |
0 |
0 |
1 |
3 |
4 |
41 |
| Compensations in the Shapley Value and the Compensation Solutions for Graph Games |
0 |
0 |
0 |
0 |
2 |
2 |
6 |
29 |
| Compensations in the Shapley value and the compensation solutions for graph games |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
30 |
| Compensations in the Shapley value and the compensation solutions for graph games |
0 |
0 |
0 |
43 |
0 |
0 |
2 |
124 |
| Compensations in the Shapley value and the compensation solutions for graph games |
0 |
0 |
0 |
0 |
1 |
1 |
3 |
30 |
| Compensations in the Shapley value and the compensation solutions for graph games |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
30 |
| Cooperative games on intersection closed systems and the Shapley value |
0 |
0 |
0 |
0 |
4 |
5 |
7 |
23 |
| Cooperative games on intersection closed systems and the Shapley value |
0 |
0 |
2 |
18 |
2 |
2 |
5 |
43 |
| Cooperative games with diversity constraints |
0 |
0 |
0 |
4 |
0 |
3 |
8 |
14 |
| Cooperative games with diversity constraints |
0 |
0 |
0 |
0 |
0 |
3 |
6 |
6 |
| Cooperative games with diversity constraints |
0 |
0 |
2 |
2 |
2 |
2 |
4 |
6 |
| Cooperative games with unpaid players |
1 |
14 |
14 |
14 |
6 |
15 |
15 |
15 |
| Decomposition of the space of TU-games, Strong Transfer Invariance and the Banzhaf value |
0 |
0 |
0 |
44 |
0 |
0 |
3 |
49 |
| Decomposition of the space of TU-games, Strong Transfer Invariance and the Banzhaf value |
0 |
0 |
0 |
0 |
4 |
4 |
6 |
19 |
| Decomposition of the space of TU-games, Strong Transfer Invariance and the Banzhaf value |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
28 |
| Discounted Tree Solutions |
0 |
0 |
0 |
0 |
0 |
0 |
4 |
28 |
| Discounted Tree Solutions |
0 |
0 |
0 |
0 |
1 |
1 |
3 |
27 |
| Discounted Tree Solutions |
0 |
0 |
0 |
8 |
1 |
2 |
3 |
28 |
| Discounted Tree Solutions |
0 |
1 |
1 |
18 |
2 |
4 |
7 |
68 |
| Discounted Tree Solutions |
0 |
0 |
0 |
0 |
0 |
2 |
3 |
31 |
| Early contributors, cooperation and fair rewards in crowdfunding |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
5 |
| Early contributors, cooperation and fair rewards in crowdfunding |
1 |
1 |
4 |
29 |
1 |
1 |
10 |
86 |
| Efficient extension of the Myerson value |
1 |
1 |
1 |
14 |
1 |
1 |
4 |
18 |
| Efficient extensions of communication values |
0 |
0 |
0 |
12 |
0 |
0 |
1 |
26 |
| Efficient extensions of communication values |
0 |
0 |
0 |
14 |
0 |
2 |
7 |
39 |
| Efficient extensions of the Myerson value |
0 |
0 |
0 |
32 |
2 |
3 |
4 |
67 |
| Examination design: an axiomatic approach |
0 |
0 |
0 |
11 |
0 |
2 |
7 |
51 |
| Examination design: an axiomatic approach |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
| Fairness and Fairness for Neighbors: The Difference between the Myerson Value and Component-Wise Egalitarian Solutions |
0 |
0 |
0 |
0 |
1 |
1 |
4 |
33 |
| Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions |
0 |
0 |
0 |
13 |
2 |
3 |
4 |
65 |
| Farsighted Coalitional Stability in TU-Games |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
32 |
| Farsighted Coalitional Stability in TU-Games |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
33 |
| Farsighted Coalitional Stability in TU-Games |
0 |
0 |
0 |
0 |
1 |
1 |
4 |
35 |
| Farsighted Coalitional Stability in TU-games |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
42 |
| Farsighted Coalitional Stability in TU-games |
0 |
0 |
0 |
59 |
0 |
2 |
3 |
352 |
| Farsighted coalitional stability in TU-games |
0 |
0 |
0 |
2 |
0 |
1 |
2 |
49 |
| Farsighted coalitional stability in TU-games |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
| Freezeout, Compensation Rules and Voting Equilibria |
0 |
0 |
0 |
27 |
0 |
1 |
3 |
107 |
| Freezeout, Compensation Rules, and Voting Equilibria |
0 |
0 |
0 |
0 |
1 |
1 |
3 |
28 |
| GAMES WITH IDENTICAL SHAPLEY VALUES |
0 |
0 |
0 |
64 |
1 |
2 |
4 |
94 |
| Games with Identical Shapley Values |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
| Harsanyi Power Solutions for Cooperative Games on Voting Structures |
0 |
0 |
1 |
1 |
0 |
0 |
3 |
28 |
| Harsanyi power solutions for cooperative games on voting structures |
0 |
0 |
0 |
21 |
1 |
2 |
6 |
74 |
| Harsanyi power solutions for cooperative games on voting structures |
0 |
0 |
0 |
0 |
1 |
1 |
4 |
12 |
| Inconsistent weighting in weighted voting games |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
1 |
| Inconsistent weighting in weighted voting games |
0 |
0 |
0 |
0 |
0 |
3 |
3 |
5 |
| Inconsistent weighting in weighted voting games |
0 |
0 |
1 |
27 |
4 |
5 |
7 |
73 |
| Informational Advantage and Influence of Communicating Central Banks |
0 |
0 |
0 |
27 |
1 |
1 |
4 |
106 |
| La mise en place de la législation européenne REACH: Une analyse des effets anticoncurrentiels |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
50 |
| Les effets d'une réglementation sur la concurrence et l'innovation: première analyse de la réglementation européenne REACH |
0 |
0 |
0 |
0 |
1 |
2 |
6 |
42 |
| Les informations exigées par la législation REACH: analyse du partage des coûts |
0 |
0 |
0 |
0 |
1 |
2 |
4 |
26 |
| Lexicographic solutions for coalitional rankings based on individual and collective performances |
0 |
0 |
0 |
3 |
1 |
1 |
3 |
22 |
| Lexicographic solutions for coalitional rankings based on individual and collective performances |
0 |
0 |
0 |
0 |
1 |
3 |
3 |
5 |
| Lexicographic solutions for coalitional rankings based on individual and collective performances |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
| Multiwinner Elections with Diversity Constraints on Individual Preferences |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
2 |
| Multiwinner elections with diversity constraints on individual preferences |
0 |
0 |
1 |
1 |
0 |
0 |
3 |
12 |
| Multiwinner elections with diversity constraints on individual preferences |
0 |
0 |
1 |
4 |
2 |
2 |
3 |
21 |
| Necessary versus equal players in axiomatic studies |
0 |
0 |
0 |
1 |
1 |
1 |
3 |
8 |
| Necessary versus equal players in axiomatic studies |
0 |
0 |
0 |
12 |
0 |
0 |
4 |
46 |
| New axiomatisations of the Diversity Owen and Shapley values |
0 |
0 |
0 |
0 |
2 |
3 |
7 |
8 |
| New axiomatizations of the Diversity Owen and Shapley values |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
| New axiomatizations of the Diversity Owen and Shapley values |
0 |
0 |
0 |
3 |
0 |
0 |
5 |
6 |
| On compensation schemes for data sharing within the European REACH legislation |
0 |
0 |
0 |
1 |
2 |
4 |
4 |
39 |
| On compensation schemes for data sharing within the european REACH legislation |
0 |
0 |
0 |
31 |
3 |
5 |
8 |
105 |
| On the Number of Blocks Required to Access the Core |
0 |
0 |
0 |
0 |
3 |
3 |
4 |
46 |
| On the number of blocks required to access the coalition structure core |
0 |
0 |
0 |
19 |
0 |
1 |
2 |
55 |
| On the number of blocks required to access the core |
0 |
0 |
0 |
28 |
0 |
0 |
2 |
137 |
| On the number of blocks required to access the core |
0 |
0 |
0 |
0 |
2 |
2 |
3 |
35 |
| PERCEPTRON VERSUS AUTOMATON∗ |
0 |
0 |
0 |
18 |
1 |
3 |
4 |
122 |
| Partial Cooperative Equilibria: Existence and Characterization |
0 |
0 |
0 |
0 |
4 |
4 |
6 |
33 |
| Perceptron versus Automaton |
0 |
0 |
0 |
0 |
0 |
0 |
5 |
18 |
| Perceptron versus Automaton |
0 |
0 |
0 |
0 |
1 |
1 |
3 |
21 |
| Perceptron versus Automaton in the Finitely Repeated Prisoner's Dilemma |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
20 |
| Perceptron versus automaton |
0 |
0 |
0 |
2 |
1 |
1 |
2 |
29 |
| Preserving or removing special players: What keeps your payoff unchanged in TU-games? |
0 |
0 |
0 |
1 |
0 |
0 |
2 |
55 |
| Preserving or removing special players: what keeps your payoff unchanged in TU-games? |
0 |
0 |
0 |
23 |
0 |
2 |
4 |
131 |
| REACH legislation |
0 |
0 |
0 |
0 |
0 |
2 |
3 |
69 |
| Rationalité limitée et jeux de machines |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
19 |
| Relationship between labeled network games and museum pass games |
0 |
0 |
0 |
14 |
0 |
0 |
2 |
54 |
| Relationship between labeled network games and other cooperative games arising from attributes situations |
0 |
0 |
0 |
0 |
1 |
1 |
3 |
5 |
| Rooted-tree Solutions for Tree Games |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
38 |
| Règles d'allocation pour les programmes de pass culturel |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
| Règles d'allocation pour les programmes de pass culturels |
0 |
0 |
0 |
0 |
1 |
2 |
5 |
29 |
| Sharing the cost of cleaning up non-point source pollution |
0 |
0 |
1 |
1 |
0 |
0 |
3 |
3 |
| Sharing the cost of cleaning up non-point source pollution |
0 |
0 |
1 |
2 |
1 |
1 |
4 |
11 |
| Sharing the cost of hazardous transportation networks and the Priority Shapley value |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
3 |
| Sharing the cost of hazardous transportation networks and the Priority Shapley value |
0 |
0 |
0 |
5 |
3 |
3 |
3 |
16 |
| Solidarity within a Fixed Community |
0 |
0 |
0 |
0 |
2 |
2 |
3 |
36 |
| Taxing congestion of the space commons |
0 |
0 |
1 |
1 |
0 |
1 |
2 |
3 |
| The Average Tree Solution for Multi-Choice Forest Games |
0 |
0 |
0 |
0 |
2 |
2 |
4 |
45 |
| The Average Tree Solution for Multi-choice Forest Games |
0 |
0 |
0 |
31 |
2 |
2 |
5 |
103 |
| The Average Tree Solution for Multi-choice Forest Games |
0 |
0 |
0 |
0 |
1 |
2 |
4 |
38 |
| The Priority Value for Cooperative Games with a Priority Structure |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
| The Priority Value for Cooperative Games with a Priority Structure |
0 |
0 |
0 |
50 |
0 |
1 |
9 |
131 |
| The River Sharing Problem: a Survey |
0 |
0 |
0 |
0 |
0 |
1 |
5 |
106 |
| The Sequential Equal Surplus Division for Rooted Forest Games and an Application to Sharing a River with Bifurcations |
0 |
0 |
0 |
25 |
2 |
4 |
4 |
64 |
| The Sequential Equal Surplus Division for Sharing International Rivers with Bifurcations |
0 |
0 |
2 |
60 |
3 |
4 |
9 |
188 |
| The neighborhood value for cooperative graph games |
0 |
0 |
0 |
11 |
1 |
2 |
12 |
24 |
| The neighborhood value for cooperative graph games |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
2 |
| The neighborhood value for cooperative graph games |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
5 |
| The priority value for cooperative games with a priority structure |
0 |
0 |
0 |
0 |
2 |
4 |
5 |
12 |
| The proportional Shapley value and an application |
0 |
0 |
0 |
9 |
1 |
2 |
5 |
35 |
| The proportional Shapley value and an application |
0 |
0 |
0 |
40 |
1 |
4 |
4 |
108 |
| The proportional Shapley value and applications |
0 |
0 |
0 |
1 |
0 |
1 |
4 |
36 |
| The proportional Shapley value and applications |
0 |
0 |
0 |
0 |
1 |
2 |
4 |
27 |
| The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
64 |
| The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations |
0 |
0 |
0 |
20 |
1 |
2 |
5 |
41 |
| The sequential equal surplus division for sharing a river |
0 |
0 |
0 |
29 |
1 |
2 |
5 |
88 |
| The sequential surplus division for sharing a river with bifurcations |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
26 |
| Théorie des jeux coopératifs et non-coopératifs |
0 |
0 |
0 |
0 |
1 |
4 |
8 |
9 |
| Two-step values for games with two-level communication structure |
0 |
0 |
0 |
16 |
1 |
1 |
3 |
52 |
| Two-step values for games with two-level communication structure |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
32 |
| Veto players, the kernel of the Shapley value and its characterization |
0 |
0 |
0 |
2 |
2 |
2 |
6 |
22 |
| Veto players, the kernel of the Shapley value and its characterization |
0 |
0 |
1 |
21 |
0 |
0 |
3 |
41 |
| Weighted Component Fairness for Forest Games |
0 |
0 |
0 |
19 |
6 |
7 |
9 |
96 |
| Weighted component fairness for forest games |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
25 |
| Total Working Papers |
3 |
17 |
42 |
1,707 |
182 |
299 |
684 |
8,157 |
LogEc is hosted by the
Örebro University School of Business.