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 |
200 |
0 |
0 |
8 |
793 |

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

A fair rule in minimum cost spanning tree problems |
0 |
0 |
1 |
200 |
0 |
1 |
4 |
838 |

A family of rules to share the revenues from broadcasting sport events |
2 |
11 |
28 |
28 |
12 |
56 |
87 |
87 |

A family of rules to share the revenues from broadcasting sport events |
4 |
21 |
21 |
21 |
2 |
2 |
2 |
2 |

A new rule for the problem of sharing the revenue from museum passes |
0 |
0 |
1 |
27 |
0 |
0 |
2 |
48 |

Additive rules in bankruptcy problems and other related problems |
0 |
3 |
8 |
296 |
3 |
17 |
49 |
1,250 |

Additivity in cost spanning tree problems |
0 |
0 |
0 |
69 |
0 |
2 |
7 |
388 |

Allocating costs in set covering problems |
0 |
3 |
15 |
15 |
0 |
4 |
8 |
8 |

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

Characterization of the painting rule for multi-source minimal cost spanning tree problems |
0 |
1 |
13 |
13 |
0 |
3 |
5 |
5 |

Consistency in PERT problems |
0 |
1 |
1 |
13 |
0 |
1 |
2 |
32 |

Cooperative and axiomatic approaches to the knapsack allocation problem |
0 |
3 |
19 |
19 |
1 |
5 |
8 |
8 |

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

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

How to apply penalties to avoid delays in projects |
0 |
1 |
28 |
28 |
0 |
1 |
7 |
7 |

Individually Rational Rules for the Division Problem when the Number of Units to be Allotted is Endogenous |
0 |
1 |
40 |
40 |
1 |
2 |
10 |
10 |

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

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

OBLIGATION RULES |
0 |
0 |
0 |
18 |
0 |
0 |
1 |
129 |

Obligation Rules |
0 |
0 |
0 |
4 |
0 |
0 |
2 |
31 |

On Exiting after Voting |
0 |
0 |
0 |
46 |
0 |
0 |
2 |
187 |

On Societies Choosing Social Outcomes, and their Memberships: Internal Stability and Consistency |
0 |
1 |
6 |
6 |
0 |
4 |
13 |
13 |

On the Shapley value of a minimum cost spanning tree problem |
1 |
2 |
2 |
175 |
1 |
4 |
9 |
438 |

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

Realizing efficient outcomes in cost spanning problems |
0 |
0 |
0 |
78 |
0 |
0 |
1 |
334 |

Sharing the revenues from broadcasting sport events |
1 |
15 |
54 |
118 |
4 |
42 |
154 |
234 |

Sharing the revenues from broadcasting sport events |
6 |
12 |
12 |
12 |
7 |
8 |
8 |
8 |

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

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

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

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

The Division Problem under Constraints |
0 |
0 |
0 |
10 |
0 |
1 |
2 |
25 |

The Division Problem with Voluntary Participation |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
15 |

The Division Problem with Voluntary Participation |
0 |
0 |
0 |
36 |
1 |
1 |
2 |
98 |

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

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

The NTU consistent coalitional value |
0 |
1 |
1 |
96 |
0 |
1 |
3 |
232 |

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

The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources |
0 |
2 |
8 |
8 |
0 |
3 |
4 |
4 |

The folk solution and Boruvka's algorithm in minimum cost spanning tree problems |
0 |
0 |
0 |
41 |
0 |
1 |
3 |
197 |

Voting by Committees with Exit |
0 |
0 |
0 |
45 |
0 |
0 |
0 |
296 |

Total Working Papers |
15 |
87 |
282 |
1,992 |
33 |
168 |
426 |
7,326 |