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 |
0 |
202 |
0 |
4 |
5 |
808 |

A New Rule for the Problem of Sharing the Revenue from Museum Passes |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
10 |

A fair rule in minimum cost spanning tree problems |
0 |
0 |
3 |
206 |
0 |
1 |
5 |
855 |

A family of rules to share the revenues from broadcasting sport events |
0 |
0 |
0 |
41 |
0 |
0 |
2 |
169 |

A family of rules to share the revenues from broadcasting sport events |
0 |
0 |
0 |
23 |
0 |
0 |
0 |
22 |

A new rule for the problem of sharing the revenue from museum passes |
0 |
0 |
0 |
31 |
0 |
0 |
0 |
70 |

Additive rules in bankruptcy problems and other related problems |
0 |
0 |
1 |
315 |
0 |
0 |
4 |
1,342 |

Additivity in cost spanning tree problems |
0 |
0 |
0 |
70 |
0 |
0 |
1 |
397 |

Allocating costs in set covering problems |
0 |
0 |
0 |
18 |
0 |
0 |
0 |
28 |

Allocating extra revenues from broadcasting sports leagues |
0 |
0 |
0 |
44 |
0 |
0 |
0 |
47 |

Allocating extra revenues from broadcasting sports leagues |
0 |
0 |
1 |
16 |
0 |
0 |
4 |
40 |

Broadcasting La Liga |
0 |
0 |
0 |
14 |
0 |
1 |
4 |
23 |

Broadcasting revenue sharing after cancelling sports competitions |
1 |
2 |
10 |
21 |
4 |
8 |
24 |
46 |

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

Characterization of the painting rule for multi-source minimal cost spanning tree problems |
0 |
0 |
1 |
18 |
1 |
1 |
2 |
22 |

Consistency in PERT problems |
0 |
0 |
0 |
15 |
1 |
2 |
2 |
52 |

Cooperative and axiomatic approaches to the knapsack allocation problem |
0 |
0 |
0 |
26 |
0 |
0 |
3 |
36 |

Cooperative approach to a location problem with agglomeration economies |
0 |
0 |
1 |
37 |
0 |
0 |
5 |
38 |

Cooperative games for minimum cost spanning tree problems |
0 |
0 |
2 |
9 |
0 |
2 |
7 |
16 |

Cost additive rules in minimum cost spanning tree problems with multiple sources |
0 |
0 |
0 |
11 |
0 |
0 |
0 |
12 |

Defining Rules in Cost Spanning Tree Problems Through the Canonical Form |
0 |
0 |
0 |
51 |
0 |
0 |
0 |
349 |

Defining rules in cost spanning tree problems through the canonical form |
0 |
0 |
1 |
119 |
0 |
0 |
2 |
802 |

How to apply penalties to avoid delays in projects |
1 |
1 |
1 |
39 |
4 |
9 |
69 |
375 |

How to apply penalties to avoid delays in projects |
0 |
0 |
1 |
36 |
0 |
0 |
3 |
31 |

Individually Rational Rules for the Division Problem when the Number of Units to be Allotted is Endogenous |
0 |
0 |
0 |
5 |
0 |
0 |
2 |
6 |

Individually Rational Rules for the Division Problem when the Number of Units to be Allotted is Endogenous |
0 |
0 |
0 |
43 |
0 |
0 |
0 |
29 |

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

Mixed rules in multi-issue allocation situations |
0 |
0 |
0 |
7 |
0 |
0 |
1 |
8 |

Monotonicity in sharing the revenues from broadcasting sports leagues |
0 |
0 |
0 |
4 |
0 |
0 |
2 |
27 |

Monotonicity in sharing the revenues from broadcasting sports leagues |
0 |
0 |
0 |
14 |
0 |
0 |
1 |
40 |

OBLIGATION RULES |
0 |
0 |
0 |
18 |
0 |
0 |
3 |
140 |

Obligation Rules |
0 |
0 |
0 |
4 |
0 |
0 |
1 |
38 |

On Exiting after Voting |
0 |
0 |
0 |
46 |
0 |
1 |
2 |
204 |

On Societies Choosing Social Outcomes, and their Memberships: Internal Stability and Consistency |
0 |
0 |
0 |
7 |
0 |
0 |
0 |
34 |

On the Shapley value of a minimum cost spanning tree problem |
0 |
0 |
1 |
177 |
0 |
0 |
2 |
452 |

On the axiomatic approach to sharing the revenues from broadcasting sports leagues |
0 |
0 |
1 |
12 |
1 |
3 |
6 |
35 |

On the axiomatic approach to sharing the revenues from broadcasting sports leagues |
0 |
0 |
0 |
28 |
0 |
0 |
1 |
60 |

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

One-way and two-way cost allocation in hub network problems |
0 |
0 |
0 |
12 |
0 |
0 |
0 |
13 |

Optimization of tuna shing logistic routes through information sharing policies: A game theory-based approach |
0 |
0 |
0 |
16 |
0 |
0 |
0 |
13 |

Realizing efficient outcomes in cost spanning problems |
0 |
0 |
0 |
78 |
0 |
0 |
0 |
339 |

Separable rules to share the revenues from broadcasting sports leagues |
0 |
0 |
2 |
6 |
0 |
2 |
12 |
22 |

Sharing the revenues from broadcasting sport events |
0 |
2 |
3 |
161 |
1 |
4 |
6 |
408 |

Sharing the revenues from broadcasting sport events |
0 |
0 |
2 |
26 |
0 |
1 |
5 |
48 |

Stable Partitions in Many Division Problems: The Proportional and the Sequential Dictator Solutions |
0 |
0 |
0 |
16 |
0 |
1 |
1 |
66 |

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

THE CHI-COMPROMISE VALUE FOR NON-TRANSFERABLE UTILITY GAMES |
0 |
0 |
0 |
38 |
0 |
0 |
0 |
207 |

The Division Problem under Constraints |
0 |
0 |
0 |
14 |
0 |
0 |
0 |
44 |

The Division Problem under Constraints |
0 |
0 |
0 |
10 |
0 |
0 |
0 |
32 |

The Division Problem with Voluntary Participation |
0 |
0 |
0 |
36 |
0 |
0 |
0 |
106 |

The Division Problem with Voluntary Participation |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
24 |

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

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

The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources |
0 |
1 |
1 |
11 |
0 |
1 |
2 |
27 |

The NTU consistent coalitional value |
0 |
0 |
0 |
98 |
0 |
0 |
0 |
243 |

The axiomatic approach to the problem of sharing the revenue from bundled pricing |
0 |
0 |
0 |
30 |
0 |
0 |
0 |
106 |

The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources |
0 |
0 |
0 |
12 |
0 |
0 |
0 |
24 |

The folk solution and Boruvka's algorithm in minimum cost spanning tree problems |
0 |
0 |
0 |
42 |
1 |
1 |
2 |
221 |

Voting by Committees with Exit |
0 |
0 |
0 |
45 |
0 |
0 |
1 |
305 |

Total Working Papers |
2 |
6 |
32 |
2,441 |
13 |
43 |
197 |
9,079 |