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 |
0 |
30 |
0 |
0 |
0 |
50 |
A Class of Solidarity Allocation Rules for TU-games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
32 |
A Core-Partition Ranking Solution to Coalitional Ranking Problems |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
A Core-partition solution for coalitional rankings with a variable population domain |
1 |
1 |
2 |
16 |
2 |
2 |
8 |
35 |
A Decomposition of the Space of TU-games Using Addition and Transfer Invariance |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
37 |
A Decomposition of the Space of TU-games Using Addition and Transfer Invariance |
0 |
0 |
0 |
17 |
0 |
0 |
1 |
86 |
A Geometric Examination of Majorities Based on Difference in Support |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
14 |
A characterization of the family of Weighted priority values |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
A characterization of the family of Weighted priority values |
0 |
0 |
0 |
13 |
0 |
0 |
2 |
26 |
A class of solidarity allocation rules for TU-games |
0 |
0 |
0 |
7 |
0 |
0 |
2 |
31 |
A geometric examination of majorities based on difference in support |
0 |
0 |
0 |
17 |
0 |
0 |
0 |
26 |
A geometric examination of majorities based on difference in support |
0 |
0 |
0 |
3 |
0 |
0 |
0 |
22 |
A note on control costs and logit rules for strategic games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
A strategic implementation of the sequential equal surplus division rule for digraph cooperative games |
0 |
0 |
0 |
14 |
1 |
1 |
3 |
42 |
A strategic implementation of the sequential equal surplus division rule for digraph cooperative games |
0 |
0 |
0 |
18 |
1 |
1 |
1 |
23 |
A strategic implementation of the sequential equal surplus division rule for digraph cooperative games |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
24 |
Accessibility and stability of the coalition structure core |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
21 |
Adaptive learning and p-best response sets |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
27 |
Adaptive learning and p-best response sets |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
11 |
Adaptive play with spatial sampling |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
6 |
Algorithme de fictitious play et cycles |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
4 |
Algorythme de fictitious play et cycles |
0 |
0 |
0 |
10 |
0 |
0 |
1 |
67 |
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 |
3 |
7 |
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 |
3 |
3 |
Allocation rules for museum pass programs |
0 |
0 |
1 |
34 |
0 |
0 |
2 |
92 |
An Optimal Bound to Access the Core in TU-Games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
34 |
An axiomatization of the iterated h-index and applications to sport rankings |
0 |
0 |
0 |
28 |
0 |
0 |
1 |
52 |
An axiomatization of the iterated h-index and applications to sport rankings |
0 |
0 |
1 |
42 |
2 |
2 |
7 |
92 |
An optimal bound to acces the core of TU-games |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
23 |
An optimal bound to access the core in TU-games |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
30 |
An optimal bound to access the core in TU-games |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
32 |
An optimal bound to access the core in TU-games |
0 |
0 |
0 |
31 |
0 |
0 |
0 |
81 |
An optimal bound to access the core in TU-games |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
34 |
Approval voting versus proportional threshold methods: so far and yet so near |
0 |
0 |
2 |
6 |
0 |
0 |
4 |
14 |
Average Tree Solutions and the Distribution of Harsanyi Dividends |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
33 |
Average Tree Solutions and the Distribution of Harsanyi Dividends |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
22 |
Average Tree Solutions and the Distribution of Harsanyi Dividends |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
43 |
Average tree solution for graph games |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
33 |
Average tree solutions and the distribution of Harsanyi dividends |
0 |
0 |
0 |
33 |
0 |
0 |
0 |
94 |
Average tree solutions for graph games |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
25 |
Average tree solutions for graph games |
0 |
0 |
0 |
54 |
0 |
0 |
0 |
297 |
Axiomatic and bargaining foundation of an allocation rule for ordered tree TU-games |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
35 |
Axiomatic and bargaining foundation of an allocation rule for ordered tree TU-games |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
25 |
Axiomatic and bargaining foundations of an allocation rule for ordered tree TU-games |
0 |
0 |
0 |
26 |
1 |
1 |
2 |
56 |
Axiomatic characterizations of the core without consistency |
0 |
0 |
0 |
14 |
0 |
0 |
1 |
20 |
Axiomatic characterizations of the core without consistency |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
Axiomatic characterizations of the core without consistency |
0 |
0 |
0 |
9 |
0 |
0 |
4 |
23 |
Axiomatic characterizations of the core without consistency |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
Axiomatic characterizations of the family of Weighted priority values |
0 |
0 |
0 |
0 |
0 |
2 |
5 |
8 |
Axiomatic characterizations under players nullification |
0 |
0 |
0 |
8 |
0 |
0 |
0 |
29 |
Axiomatic characterizations under players nullification |
0 |
0 |
0 |
25 |
0 |
0 |
0 |
61 |
Axiomatic characterizations under players nullification |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
38 |
Axiomatization and implementation of a class of solidarity values for TU-games |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
35 |
Axiomatization of an allocation rule for ordered tree TU-games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
40 |
Axioms of Invariance for TU-games |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
36 |
Axioms of Invariance for TU-games |
0 |
0 |
1 |
52 |
0 |
0 |
1 |
152 |
Axioms of invariance for TU-games |
0 |
0 |
0 |
25 |
0 |
0 |
0 |
70 |
Balanced collective contributions, the equal allocation of non-separable costs and application to data sharing games |
0 |
0 |
0 |
1 |
2 |
2 |
2 |
28 |
Balanced collective contributions, the equal allocation of non-separable costs and application to data sharing games |
0 |
0 |
0 |
35 |
1 |
1 |
3 |
64 |
Characterization of the Average Tree solution and its kernel |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
26 |
Characterization of the Average Tree solution and its kernel |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
21 |
Characterization of the Average Tree solution and its kernel |
0 |
0 |
0 |
8 |
0 |
0 |
1 |
43 |
Characterization of the Average Tree solution and its kernel |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
28 |
Characterizations of Weighted and Equal Division Values |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
43 |
Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form |
0 |
0 |
0 |
7 |
1 |
1 |
1 |
17 |
Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form |
0 |
0 |
0 |
19 |
1 |
1 |
1 |
58 |
Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
28 |
Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
24 |
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 |
28 |
Coalitional desirability and the equal division value |
0 |
0 |
0 |
31 |
0 |
0 |
3 |
58 |
Coalitional desirability and the equal division value |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
37 |
Cohesive efficiency in TU-games: Two extensions of the Shapley value |
0 |
0 |
1 |
24 |
0 |
0 |
2 |
86 |
Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations |
0 |
0 |
0 |
0 |
1 |
1 |
3 |
3 |
Comparable Axiomatizations of Two Allocation Rules for Cooperative Games with Transferable Utility and their Subclass of Data Games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
37 |
Compensations in the Shapley Value and the Compensation Solutions for Graph Games |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
23 |
Compensations in the Shapley value and the compensation solutions for graph games |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
27 |
Compensations in the Shapley value and the compensation solutions for graph games |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
27 |
Compensations in the Shapley value and the compensation solutions for graph games |
0 |
0 |
0 |
43 |
0 |
0 |
1 |
122 |
Compensations in the Shapley value and the compensation solutions for graph games |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
28 |
Constitution et propriété dans l’œuvre de Sismondi |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
Constitution, souveraineté nationale et représentation dans l’œuvre de Sismondi |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
12 |
Contagion |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
7 |
Contagion |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
23 |
Contagion and dominating sets |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
17 |
Control costs and potential functions for spatial games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
Control costs and potential functions for spatial games |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
Cooperative games on intersection closed systems and the Shapley value |
0 |
0 |
0 |
16 |
0 |
0 |
1 |
38 |
Cooperative games on intersection closed systems and the Shapley value |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
16 |
Decomposition of the space of TU-games, Strong Transfer Invariance and the Banzhaf value |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
13 |
Decomposition of the space of TU-games, Strong Transfer Invariance and the Banzhaf value |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
26 |
Decomposition of the space of TU-games, Strong Transfer Invariance and the Banzhaf value |
0 |
0 |
0 |
44 |
0 |
1 |
1 |
46 |
Dilemma with approval and disapproval rules |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
16 |
Dilemma with approval and disapproval votes |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
23 |
Discounted Tree Solutions |
0 |
0 |
0 |
17 |
0 |
0 |
0 |
61 |
Discounted Tree Solutions |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
24 |
Discounted Tree Solutions |
0 |
0 |
0 |
8 |
0 |
0 |
1 |
25 |
Discounted Tree Solutions |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
24 |
Discounted Tree Solutions |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
28 |
Economie, républicanisme et république |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
14 |
Fairness and Fairness for Neighbors: The Difference between the Myerson Value and Component-Wise Egalitarian Solutions |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
29 |
Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions |
0 |
0 |
0 |
13 |
0 |
0 |
0 |
61 |
Farsighted Coalitional Stability in TU-Games |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
31 |
Farsighted Coalitional Stability in TU-Games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
31 |
Farsighted Coalitional Stability in TU-Games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
31 |
Farsighted Coalitional Stability in TU-games |
0 |
0 |
0 |
59 |
0 |
0 |
0 |
349 |
Farsighted Coalitional Stability in TU-games |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
41 |
Farsighted coalitional stability in TU-games |
0 |
0 |
1 |
2 |
0 |
0 |
1 |
47 |
Farsighted coalitional stability in TU-games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
Finding a Nash Equilibrium in Spatial Games is an NP-Complete Problem |
0 |
0 |
0 |
252 |
0 |
0 |
0 |
885 |
Finding a Nash equilibrium in spatial games is an NP-complete problem |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
GAMES WITH IDENTICAL SHAPLEY VALUES |
0 |
0 |
1 |
64 |
0 |
0 |
3 |
90 |
Games with Identical Shapley Values |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
Good neighbors are hard to find: computational complexity of network formation |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
19 |
Harsanyi Power Solutions for Cooperative Games on Voting Structures |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
25 |
Harsanyi power solutions for cooperative games on voting structures |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
8 |
Harsanyi power solutions for cooperative games on voting structures |
0 |
0 |
0 |
21 |
0 |
1 |
1 |
68 |
Infinite-population approval voting: A proposal |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
5 |
Interaction on Hypergraphs |
0 |
0 |
0 |
101 |
0 |
0 |
0 |
267 |
Interaction on Hypergraphs |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
16 |
Interaction on hypergraphs |
0 |
0 |
0 |
11 |
0 |
0 |
2 |
36 |
La notion de propriété chez Sismondi - Un premier positionnement à partir des Nouveaux Principes |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
8 |
La notion de propriété chez Sismondi - Un premier positionnement à partir des Nouveaux Principes |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |
Le critère de stabilité stochastique en théorie des jeux évolutionnaires |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
Lexicographic solutions for coalitional rankings based on individual and collective performances |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
1 |
Lexicographic solutions for coalitional rankings based on individual and collective performances |
0 |
0 |
1 |
3 |
1 |
1 |
3 |
19 |
Lexicographic solutions for coalitional rankings based on individual and collective performances |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
2 |
Local interactions and p-best response set |
0 |
0 |
0 |
3 |
1 |
1 |
1 |
25 |
Modeling medical material shortage using Markov processes |
0 |
0 |
3 |
7 |
0 |
0 |
10 |
18 |
Models of adaptive learning in game theory |
0 |
0 |
0 |
0 |
0 |
2 |
2 |
44 |
Métaphores, analogies et comportements: la position d'Edith T. Penrose |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
Neutral candidates in approval and disapproval vote |
0 |
0 |
0 |
19 |
2 |
2 |
5 |
142 |
Nonspecific Networking |
0 |
0 |
0 |
124 |
0 |
0 |
0 |
393 |
Nonspecific networking |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
30 |
On the Number of Blocks Required to Access the Core |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
42 |
On the number of blocks required to access the coalition structure core |
0 |
0 |
0 |
19 |
0 |
0 |
1 |
53 |
On the number of blocks required to access the core |
0 |
0 |
0 |
28 |
0 |
0 |
3 |
135 |
On the number of blocks required to access the core |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
32 |
Ordinal Games |
0 |
1 |
3 |
74 |
0 |
2 |
13 |
524 |
Ordinal Games |
0 |
0 |
3 |
21 |
0 |
0 |
3 |
158 |
Ordre naturel, raison et catallactique: l'approche de F. Bastiat |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
Partial Cooperative Equilibria: Existence and Characterization |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
27 |
Preserving or removing special players: What keeps your payoff unchanged in TU-games? |
0 |
0 |
0 |
1 |
4 |
5 |
14 |
52 |
Preserving or removing special players: what keeps your payoff unchanged in TU-games? |
0 |
0 |
0 |
23 |
1 |
2 |
3 |
126 |
Processus de contagion et interactions stratégiques |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
Processus de contagion et interactions stratégiques |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
10 |
Procédure de découverte, sélection naturelle et coordination des activités industrielles |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
3 |
REACH legislation |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
66 |
Recension de l'ouvrage: Von Neumann, Morgenstern, and the Creation of Game Theory From Chess to Social Science, 1900–1960 par Robert Leonard |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
6 |
Rooted-tree Solutions for Tree Games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
36 |
Règles d'allocation pour les programmes de pass culturels |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
24 |
Sharing the cost of hazardous transportation networks and the Priority Shapley value |
0 |
0 |
1 |
5 |
0 |
1 |
8 |
13 |
Sharing the cost of hazardous transportation networks and the Priority Shapley value |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
Solidarity within a Fixed Community |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
33 |
Stochastic Evolutionary Game Theory |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
7 |
Système national d'innovation, division du travail et territoire: un retour à F. List et H.C. Harvey |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
The Average Tree Solution for Multi-Choice Forest Games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
41 |
The Average Tree Solution for Multi-choice Forest Games |
0 |
0 |
0 |
31 |
0 |
0 |
0 |
98 |
The Average Tree Solution for Multi-choice Forest Games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
34 |
The Notion of Property in Sismondi's Work |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
13 |
The Priority Value for Cooperative Games with a Priority Structure |
1 |
1 |
1 |
50 |
1 |
1 |
8 |
122 |
The Priority Value for Cooperative Games with a Priority Structure |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
The River Sharing Problem: a Survey |
0 |
0 |
0 |
0 |
0 |
0 |
4 |
101 |
The Sequential Equal Surplus Division for Rooted Forest Games and an Application to Sharing a River with Bifurcations |
0 |
0 |
0 |
25 |
0 |
0 |
1 |
59 |
The Sequential Equal Surplus Division for Sharing International Rivers with Bifurcations |
0 |
0 |
0 |
58 |
0 |
0 |
0 |
179 |
The priority value for cooperative games with a priority structure |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
7 |
The proportional Shapley value and an application |
0 |
0 |
0 |
9 |
0 |
0 |
2 |
30 |
The proportional Shapley value and an application |
0 |
0 |
0 |
40 |
0 |
0 |
4 |
104 |
The proportional Shapley value and applications |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
32 |
The proportional Shapley value and applications |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
23 |
The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations |
0 |
0 |
0 |
20 |
1 |
1 |
3 |
36 |
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 |
62 |
The sequential equal surplus division for sharing a river |
0 |
0 |
0 |
29 |
0 |
0 |
1 |
83 |
The sequential surplus division for sharing a river with bifurcations |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
24 |
The social cost problem, rights and the (non)empty core |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
17 |
The social cost problem, rights and the (non)empty core |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
14 |
The social cost problem, rights and the (non)empty core |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
10 |
The social cost problem, rights and the (non)empty core |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
18 |
The social cost problem, rights and the (non)empty core |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
18 |
The social cost problem, rights and the (non)empty core |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
12 |
The social cost problem, rights, and the (non)empty core |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
2 |
Théorie des jeux coopératifs: applications en sciences économiques et politiques. Introduction |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
18 |
Théorie des jeux et applications |
0 |
0 |
0 |
0 |
1 |
1 |
3 |
65 |
Two-step values for games with two-level communication structure |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
29 |
Two-step values for games with two-level communication structure |
0 |
0 |
0 |
16 |
1 |
1 |
2 |
49 |
Veto players, the kernel of the Shapley value and its characterization |
0 |
0 |
1 |
20 |
1 |
1 |
2 |
38 |
Veto players, the kernel of the Shapley value and its characterization |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
16 |
Weighted Component Fairness for Forest Games |
0 |
0 |
0 |
19 |
0 |
0 |
0 |
87 |
Weighted component fairness for forest games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
24 |
Total Working Papers |
2 |
3 |
23 |
1,956 |
59 |
81 |
258 |
9,079 |