Working Paper |
File Downloads |
Abstract Views |

Last month |
3 months |
12 months |
Total |
Last month |
3 months |
12 months |
Total |

A Focal-Point Solution for Bargaining Problems with Coalition Structure |
0 |
0 |
1 |
201 |
1 |
2 |
7 |
801 |

A New Rule for the Problem of Sharing the Revenue from Museum Passes |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
7 |

A fair rule in minimum cost spanning tree problems |
1 |
1 |
1 |
201 |
2 |
3 |
5 |
846 |

A family of rules to share the revenues from broadcasting sport events |
0 |
0 |
2 |
23 |
0 |
1 |
11 |
20 |

A family of rules to share the revenues from broadcasting sport events |
0 |
1 |
6 |
40 |
2 |
6 |
27 |
146 |

A new rule for the problem of sharing the revenue from museum passes |
0 |
1 |
3 |
30 |
0 |
2 |
8 |
64 |

Additive rules in bankruptcy problems and other related problems |
0 |
1 |
12 |
314 |
8 |
18 |
47 |
1,317 |

Additivity in cost spanning tree problems |
0 |
0 |
1 |
70 |
0 |
0 |
2 |
390 |

Allocating costs in set covering problems |
0 |
0 |
1 |
16 |
0 |
1 |
9 |
18 |

Allocating extra revenues from broadcasting sports leagues |
0 |
0 |
14 |
14 |
5 |
12 |
23 |
23 |

Allocating extra revenues from broadcasting sports leagues |
0 |
2 |
43 |
44 |
3 |
8 |
44 |
45 |

Characterization of monotonic rules in minimum cost spanning tree problems |
0 |
0 |
0 |
14 |
0 |
0 |
1 |
52 |

Characterization of the painting rule for multi-source minimal cost spanning tree problems |
0 |
1 |
4 |
17 |
0 |
1 |
9 |
14 |

Consistency in PERT problems |
0 |
0 |
0 |
14 |
0 |
0 |
8 |
43 |

Cooperative and axiomatic approaches to the knapsack allocation problem |
0 |
0 |
2 |
22 |
0 |
0 |
7 |
20 |

Cooperative approach to a location problem with agglomeration economies |
0 |
2 |
33 |
33 |
1 |
3 |
21 |
21 |

Cost additive rules in minimum cost spanning tree problems with multiple sources |
0 |
0 |
1 |
10 |
1 |
4 |
5 |
8 |

Defining Rules in Cost Spanning Tree Problems Through the Canonical Form |
0 |
0 |
0 |
51 |
1 |
1 |
3 |
347 |

Defining rules in cost spanning tree problems through the canonical form |
0 |
0 |
0 |
118 |
1 |
3 |
7 |
797 |

How to apply penalties to avoid delays in projects |
4 |
4 |
5 |
35 |
5 |
5 |
10 |
21 |

How to apply penalties to avoid delays in projects |
1 |
2 |
36 |
36 |
21 |
51 |
125 |
128 |

Individually Rational Rules for the Division Problem when the Number of Units to be Allotted is Endogenous |
0 |
0 |
1 |
42 |
3 |
4 |
7 |
22 |

Mixed rules in multi-issue allocation situations |
0 |
0 |
0 |
5 |
0 |
0 |
1 |
4 |

Mixed rules in multi-issue allocation situations |
0 |
0 |
0 |
7 |
0 |
0 |
2 |
6 |

OBLIGATION RULES |
0 |
0 |
0 |
18 |
0 |
0 |
1 |
131 |

Obligation Rules |
0 |
0 |
0 |
4 |
0 |
2 |
3 |
35 |

On Exiting after Voting |
0 |
0 |
0 |
46 |
1 |
1 |
8 |
199 |

On Societies Choosing Social Outcomes, and their Memberships: Internal Stability and Consistency |
0 |
0 |
0 |
6 |
1 |
2 |
8 |
29 |

On the Shapley value of a minimum cost spanning tree problem |
0 |
0 |
1 |
176 |
0 |
3 |
6 |
445 |

On the axiomatic approach to sharing the revenues from broadcasting sports leagues |
0 |
17 |
17 |
17 |
5 |
25 |
25 |
25 |

One-way and two-way cost allocation in hub network problems |
0 |
0 |
1 |
27 |
0 |
1 |
9 |
27 |

One-way and two-way cost allocation in hub network problems |
0 |
0 |
12 |
12 |
1 |
2 |
7 |
7 |

Optimization of tuna shing logistic routes through information sharing policies: A game theory-based approach |
0 |
0 |
2 |
15 |
1 |
1 |
4 |
9 |

Realizing efficient outcomes in cost spanning problems |
0 |
0 |
0 |
78 |
2 |
2 |
3 |
337 |

Sharing the revenues from broadcasting sport events |
1 |
2 |
10 |
153 |
3 |
13 |
58 |
373 |

Sharing the revenues from broadcasting sport events |
0 |
2 |
5 |
21 |
0 |
6 |
19 |
35 |

Stable Partitions in Many Division Problems: The Proportional and the Sequential Dictator Solutions |
0 |
0 |
0 |
15 |
1 |
1 |
7 |
58 |

Stable Partitions in Many Division Problems: The Proportional and the Sequential Dictator Solutions |
0 |
0 |
0 |
5 |
1 |
2 |
5 |
44 |

THE CHI-COMPROMISE VALUE FOR NON-TRANSFERABLE UTILITY GAMES |
0 |
0 |
0 |
38 |
0 |
1 |
4 |
197 |

The Division Problem under Constraints |
0 |
0 |
0 |
10 |
1 |
1 |
3 |
29 |

The Division Problem under Constraints |
0 |
0 |
0 |
14 |
1 |
2 |
6 |
43 |

The Division Problem with Voluntary Participation |
0 |
0 |
0 |
36 |
1 |
2 |
5 |
106 |

The Division Problem with Voluntary Participation |
0 |
0 |
0 |
2 |
1 |
1 |
2 |
20 |

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources |
0 |
0 |
1 |
1 |
0 |
0 |
4 |
9 |

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources |
0 |
0 |
9 |
9 |
0 |
1 |
7 |
8 |

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources |
0 |
0 |
1 |
10 |
0 |
0 |
7 |
16 |

The NTU consistent coalitional value |
0 |
0 |
0 |
96 |
0 |
1 |
4 |
236 |

The axiomatic approach to the problem of sharing the revenue from bundled pricing |
0 |
0 |
0 |
29 |
1 |
4 |
4 |
101 |

The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources |
0 |
0 |
3 |
12 |
0 |
1 |
10 |
16 |

The folk solution and Boruvka's algorithm in minimum cost spanning tree problems |
0 |
0 |
0 |
41 |
2 |
3 |
8 |
208 |

Voting by Committees with Exit |
0 |
0 |
0 |
45 |
1 |
1 |
5 |
303 |

Total Working Papers |
7 |
36 |
228 |
2,293 |
78 |
205 |
623 |
8,206 |