Working Paper |
File Downloads |
Abstract Views |
Last month |
3 months |
12 months |
Total |
Last month |
3 months |
12 months |
Total |
Allocation rules on networks |
0 |
0 |
0 |
65 |
0 |
0 |
3 |
223 |
An impossibility in sequencing problems |
0 |
0 |
0 |
35 |
0 |
1 |
1 |
127 |
Asymmetrically Fair Rules for an Indivisible Good Problem with a Budget Constraint |
0 |
0 |
0 |
16 |
0 |
0 |
0 |
60 |
Asymmetrically Fair Rules for an Indivisible Good Problem with a Budget Constraint |
0 |
0 |
0 |
14 |
0 |
1 |
1 |
101 |
Asymmetrically fair rules for an indivisible good problem with a budget constraint |
0 |
0 |
0 |
59 |
0 |
1 |
4 |
211 |
Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems |
0 |
0 |
0 |
5 |
1 |
2 |
3 |
52 |
Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems |
0 |
0 |
0 |
54 |
5 |
5 |
8 |
304 |
Consistency and the sequential equal contributions rule for airport problems |
0 |
0 |
0 |
53 |
0 |
1 |
1 |
217 |
Equilibria under Deferred Acceptance: Dropping Strategies, Filled Positions, and Welfare |
0 |
0 |
0 |
24 |
0 |
1 |
2 |
86 |
Equilibria under Deferred Acceptance: Dropping Strategies, Filled Positions, and Welfare |
0 |
0 |
0 |
27 |
0 |
0 |
0 |
60 |
Equilibria under deferred acceptance: Dropping strategies, filled positions, and welfare |
0 |
0 |
0 |
1 |
0 |
1 |
1 |
14 |
On the Exhaustiveness of Truncation and Dropping Strategies in Many-to-Many Matching Markets |
0 |
0 |
0 |
25 |
0 |
1 |
1 |
117 |
On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets |
0 |
0 |
0 |
17 |
1 |
2 |
5 |
125 |
Rank Gaps and the Size of the Core for Roommate Problems |
0 |
0 |
1 |
24 |
0 |
1 |
3 |
75 |
Rank Gaps and the Size of the Core for Roommate Problems |
0 |
0 |
0 |
8 |
0 |
1 |
2 |
46 |
Rank Gaps and the Size of the Core for Roommate Problems |
0 |
0 |
0 |
17 |
1 |
1 |
1 |
39 |
School Choice: Nash Implementation of Stable Matchings through Rank-Priority Mechanisms |
0 |
0 |
1 |
26 |
0 |
0 |
2 |
81 |
School Choice: Nash Implementation of Stable Matchings through Rank-Priority Mechanisms |
0 |
0 |
0 |
27 |
1 |
2 |
2 |
55 |
School Choice: Nash Implementation of Stable Matchings through Rank-Priority Mechanisms |
0 |
0 |
0 |
6 |
1 |
3 |
4 |
48 |
Total Working Papers |
0 |
0 |
2 |
503 |
10 |
24 |
44 |
2,041 |