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 |
50 |
0 |
0 |
1 |
618 |

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

All Sequential Allotment Rules Are Obviously Strategy-Proof |
0 |
0 |
0 |
18 |
0 |
0 |
0 |
59 |

All Sequential Allotment Rules Are Obviously Strategy-proof |
0 |
0 |
1 |
28 |
0 |
1 |
3 |
71 |

All sequential allotment rules are obviously strategy-proof |
0 |
0 |
1 |
3 |
0 |
1 |
3 |
11 |

Bribe-proof Rules in the Division Problem |
0 |
0 |
1 |
72 |
0 |
0 |
1 |
629 |

Comparing Generalized Median Voter Schemes According to their Manipulability |
0 |
0 |
0 |
44 |
0 |
1 |
2 |
57 |

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

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

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

Efficient and Stable Collective Choices under Gregarious Preferences |
0 |
0 |
0 |
97 |
0 |
0 |
0 |
205 |

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

False-name-proof and Strategy-proof Voting Rules under Separable Preferences |
0 |
1 |
1 |
9 |
0 |
1 |
2 |
6 |

Incomplete Information and Small Cores in Matching Markets |
0 |
0 |
0 |
12 |
0 |
0 |
0 |
60 |

Incomplete Information and Small Cores in Matching Markets |
0 |
0 |
0 |
7 |
0 |
0 |
0 |
52 |

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

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

MAXIMAL DOMAIN OF PREFERENCES IN THE DIVISION PROBLEM |
0 |
0 |
0 |
42 |
0 |
0 |
0 |
234 |

MEMORY STARTEGIES IN NONATOMIC REPEATED GAMES |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
191 |

Matching Markets under (In)complete Information |
0 |
0 |
0 |
14 |
0 |
0 |
0 |
76 |

Matching Markets under (In)complete Information |
0 |
0 |
0 |
75 |
0 |
0 |
1 |
158 |

Obvious Strategy-proofness with Respect to a Partition |
0 |
0 |
3 |
3 |
0 |
0 |
6 |
6 |

On Cooperative Solutions of a Generalized Assignment Game: Limit Theorems to the Set of Competitive Equilibria |
0 |
0 |
0 |
3 |
1 |
1 |
1 |
36 |

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

On Equal Cost Sharing in the Provision of an Excludable Public Good |
1 |
1 |
1 |
51 |
1 |
2 |
3 |
89 |

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

On Obvious Strategy-Proofness and Single-Peakedness |
0 |
0 |
0 |
6 |
0 |
1 |
4 |
26 |

On Obvious Strategy-proofness and Single-peakedness |
0 |
0 |
0 |
31 |
0 |
1 |
3 |
45 |

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

On Strategy-Proofness and Semilattice Single-Peakedness |
0 |
0 |
0 |
6 |
0 |
0 |
2 |
26 |

On Strategy-proofness and Symmetric Single-Peakedness |
0 |
0 |
0 |
1 |
0 |
1 |
1 |
33 |

On Strategy-proofness and Symmetric Single-peakedness |
0 |
1 |
2 |
33 |
0 |
2 |
3 |
95 |

On Strategy-proofness and the Salience of Single-peakedness |
0 |
0 |
0 |
6 |
0 |
0 |
1 |
38 |

On Strategy-proofness and the Salience of Single-peakedness |
0 |
0 |
2 |
32 |
0 |
1 |
4 |
62 |

On Strategy-proofness and the Salience of Single-peakedness in a Private Goods Economy |
0 |
0 |
0 |
14 |
0 |
0 |
2 |
29 |

On group strategy-proof mechanisms for a many-to-one matching model |
0 |
0 |
0 |
127 |
0 |
2 |
2 |
515 |

On strategy-proofness and semilattice single-peakedness |
0 |
0 |
1 |
27 |
0 |
1 |
3 |
52 |

On the Invariance of the Set of Core Matchings with Respect to Preference Profiles |
0 |
0 |
0 |
7 |
0 |
1 |
2 |
50 |

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

On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game |
0 |
0 |
0 |
6 |
0 |
1 |
1 |
50 |

On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game |
0 |
0 |
0 |
29 |
0 |
0 |
1 |
58 |

Preference Restrictions for Simple and Strategy-Proof Rules: Local and Weakly Single-Peaked Domains |
0 |
0 |
0 |
14 |
0 |
0 |
3 |
20 |

Preference Restrictions for Simple and Strategy-Proof Rules: Local and Weakly Single-Peaked Domains |
0 |
0 |
1 |
5 |
1 |
1 |
2 |
7 |

Preference restrictions for strategy-proof and simple rules: local and weakly single-peaked domains |
0 |
0 |
2 |
2 |
0 |
0 |
2 |
2 |

Robust Design in Monotonic Matching Markets: A Case for Firm-Proposing Deferred-Acceptance |
0 |
0 |
1 |
30 |
0 |
0 |
4 |
63 |

Robust design in monotonic matching markets: A case for firm-proposing deferred-acceptance |
0 |
0 |
0 |
10 |
1 |
1 |
1 |
24 |

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

Stability of Matchings when Individuals Have Preferences Over Colleagues |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
474 |

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

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

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

Strategy-Proof Voting on Compact Ranges |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1,050 |

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 |
1 |
1 |
45 |

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

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

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

The Multiple-partners Assignment Game with Heterogeneous Sales and Multi-unit Demands: Competitive Equilibria |
0 |
0 |
0 |
30 |
0 |
1 |
2 |
118 |

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

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

Voting Under Constraints |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
149 |

Voting by Committees Under Constraints |
0 |
0 |
0 |
59 |
0 |
0 |
0 |
251 |

Voting by Committees under Constraints |
0 |
0 |
0 |
5 |
0 |
0 |
0 |
36 |

Voting by Committees under Constraints |
0 |
0 |
0 |
76 |
0 |
0 |
0 |
407 |

Voting by Committees under Constraints |
0 |
0 |
0 |
6 |
0 |
0 |
0 |
44 |

Voting by Committees with Exit |
0 |
0 |
1 |
46 |
0 |
0 |
1 |
306 |

Weak Stability and a Bargaining Set for the Marriage Model |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
3 |

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

Weighted Approval Voting |
0 |
0 |
0 |
76 |
0 |
0 |
0 |
289 |

Weighted approval voting |
0 |
0 |
0 |
39 |
0 |
0 |
2 |
154 |

Total Working Papers |
1 |
3 |
19 |
1,648 |
4 |
29 |
85 |
9,017 |