Working Paper |
File Downloads |
Abstract Views |

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

A Maximal Domain of Preferences for Tops-only Rules in the Division Problem |
0 |
0 |
0 |
49 |
0 |
0 |
0 |
609 |

AN ALGORITHM TO COMPUTE THE SET OF MANY-TO-MANY STABLE MATCHINGS |
0 |
0 |
0 |
76 |
0 |
0 |
0 |
236 |

All Sequential Allotment Rules Are Obviously Strategy-Proof |
1 |
1 |
1 |
1 |
2 |
3 |
3 |
3 |

All Sequential Allotment Rules Are Obviously Strategy-proof |
1 |
12 |
12 |
12 |
3 |
14 |
14 |
14 |

Bribe-proof Rules in the Division Problem |
0 |
0 |
0 |
71 |
1 |
2 |
2 |
620 |

Comparing Generalized Median Voter Schemes According to their Manipulability |
0 |
0 |
0 |
25 |
0 |
0 |
1 |
33 |

Comparing Generalized Median Voter Schemes According to their Manipulability |
0 |
0 |
1 |
44 |
0 |
0 |
4 |
47 |

Efficient and Stable Collective Choices under Crowding Preferences |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
35 |

Efficient and Stable Collective Choices under Crowding Preferences |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
24 |

Efficient and Stable Collective Choices under Gregarious Preferences |
0 |
6 |
14 |
48 |
0 |
7 |
16 |
148 |

Equilibrium Payoffs of Dynamic Games |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
123 |

Incomplete Information and Small Cores in Matching Markets |
0 |
0 |
0 |
5 |
0 |
0 |
0 |
41 |

Incomplete Information and Small Cores in Matching Markets |
0 |
0 |
0 |
12 |
1 |
2 |
3 |
47 |

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

MAXIMAL DOMAIN OF PREFERENCES IN THE DIVISION PROBLEM |
0 |
0 |
0 |
42 |
1 |
1 |
2 |
219 |

MEMORY STARTEGIES IN NONATOMIC REPEATED GAMES |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
183 |

Matching Markets under (In)complete Information |
0 |
0 |
1 |
12 |
0 |
0 |
3 |
64 |

Matching Markets under (In)complete Information |
0 |
0 |
2 |
75 |
1 |
1 |
7 |
147 |

On Cooperative Solutions of a Generalized Assignment Game: Limit Theorems to the Set of Competitive Equilibria |
0 |
0 |
0 |
40 |
0 |
0 |
2 |
103 |

On Equal Cost Sharing in the Provision of an Excludable Public Good |
0 |
0 |
2 |
49 |
0 |
2 |
5 |
72 |

On Exiting after Voting |
0 |
0 |
0 |
46 |
2 |
2 |
4 |
189 |

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

On Strategy-Proofness and Semilattice Single-Peakedness |
0 |
0 |
4 |
4 |
0 |
1 |
7 |
7 |

On Strategy-proofness and Symmetric Single-peakedness |
0 |
0 |
0 |
31 |
0 |
0 |
3 |
85 |

On Strategy-proofness and the Salience of Single-peakedness |
0 |
0 |
0 |
5 |
0 |
0 |
0 |
29 |

On Strategy-proofness and the Salience of Single-peakedness |
0 |
0 |
1 |
28 |
0 |
1 |
3 |
43 |

On group strategy-proof mechanisms for a many-to-one matching model |
0 |
0 |
0 |
126 |
0 |
0 |
1 |
500 |

On strategy-proofness and semilattice single-peakedness |
0 |
1 |
17 |
17 |
0 |
1 |
16 |
16 |

On the Invariance of the Set of Core Matchings with Respect to Preference Profiles |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
21 |

On the Invariance of the Set of Core Matchings with Respect to Preference Profiles |
0 |
0 |
0 |
7 |
0 |
0 |
3 |
42 |

On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game |
0 |
0 |
0 |
5 |
0 |
0 |
0 |
28 |

On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game |
0 |
1 |
1 |
27 |
1 |
5 |
9 |
41 |

Robust Design in Monotonic Matching Markets: A Case for Firm-Proposing Deferred-Acceptance |
0 |
2 |
4 |
21 |
0 |
6 |
18 |
24 |

Robust design in monotonic matching markets: A case for firm-proposing deferred-acceptance |
0 |
0 |
3 |
10 |
0 |
2 |
9 |
13 |

Some Things Couples always wanted to know about stable matchings (but were afraid to ask) |
0 |
0 |
1 |
5 |
0 |
0 |
3 |
41 |

Stability of Matchings when Individuals Have Preferences Over Colleagues |
0 |
0 |
0 |
0 |
1 |
4 |
6 |
467 |

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

Stable Partitions in Many Division Problems: The Proportional and the Sequential Dictator Solutions |
0 |
0 |
1 |
15 |
2 |
3 |
6 |
45 |

Strategy-Proof Voting on Compact Ranges |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
1,038 |

Strategy-Proof Voting on Compact Ranges |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
308 |

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

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

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

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

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

The Multiple-partners Assignment Game with Heterogeneous Sales and Multi-unit Demands: Competitive Equilibria |
0 |
0 |
0 |
28 |
0 |
1 |
4 |
107 |

The Multiple-partners Assignment Game with Heterogeneous Sells and Multi-unit Demands: Competitive Equilibria |
0 |
0 |
0 |
8 |
0 |
1 |
7 |
47 |

The Multiple-partners Assignment Game with Heterogeneous Sells and Multi-unit Demands: Competitive Equilibria |
0 |
0 |
0 |
15 |
0 |
0 |
3 |
74 |

Voting Under Constraints |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
135 |

Voting by Committees Under Constraints |
0 |
0 |
0 |
57 |
1 |
1 |
3 |
233 |

Voting by Committees under Constraints |
0 |
0 |
0 |
4 |
1 |
1 |
3 |
27 |

Voting by Committees under Constraints |
0 |
0 |
0 |
75 |
1 |
1 |
3 |
397 |

Voting by Committees under Constraints |
0 |
0 |
0 |
6 |
1 |
1 |
3 |
31 |

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

Weak Stability and a Bargaining Set for the Marriage Model |
0 |
0 |
0 |
1 |
1 |
1 |
2 |
10 |

Weighted Approval Voting |
0 |
0 |
0 |
39 |
2 |
3 |
5 |
140 |

Weighted Approval Voting |
0 |
0 |
0 |
76 |
2 |
6 |
10 |
284 |

Total Working Papers |
2 |
25 |
111 |
1,414 |
32 |
87 |
236 |
7,918 |