| 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 |
2 |
3 |
10 |
233 |
| An impossibility in sequencing problems |
0 |
0 |
0 |
35 |
2 |
2 |
6 |
133 |
| Asymmetrically Fair Rules for an Indivisible Good Problem with a Budget Constraint |
0 |
0 |
0 |
14 |
1 |
4 |
9 |
110 |
| Asymmetrically Fair Rules for an Indivisible Good Problem with a Budget Constraint |
0 |
0 |
0 |
16 |
4 |
4 |
4 |
64 |
| Asymmetrically fair rules for an indivisible good problem with a budget constraint |
0 |
0 |
0 |
59 |
3 |
6 |
12 |
223 |
| Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems |
0 |
0 |
0 |
5 |
1 |
2 |
6 |
58 |
| Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems |
0 |
0 |
1 |
55 |
4 |
5 |
14 |
318 |
| Consistency and the sequential equal contributions rule for airport problems |
0 |
0 |
2 |
55 |
2 |
3 |
12 |
229 |
| Equilibria under Deferred Acceptance: Dropping Strategies, Filled Positions, and Welfare |
0 |
0 |
0 |
24 |
2 |
14 |
25 |
111 |
| Equilibria under Deferred Acceptance: Dropping Strategies, Filled Positions, and Welfare |
0 |
0 |
0 |
27 |
2 |
3 |
17 |
77 |
| Equilibria under deferred acceptance: Dropping strategies, filled positions, and welfare |
0 |
0 |
0 |
1 |
2 |
4 |
7 |
21 |
| On the Exhaustiveness of Truncation and Dropping Strategies in Many-to-Many Matching Markets |
0 |
0 |
0 |
25 |
1 |
2 |
14 |
131 |
| On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets |
0 |
0 |
0 |
17 |
0 |
1 |
10 |
135 |
| Rank Gaps and the Size of the Core for Roommate Problems |
0 |
0 |
0 |
8 |
2 |
3 |
8 |
54 |
| Rank Gaps and the Size of the Core for Roommate Problems |
0 |
0 |
0 |
24 |
2 |
2 |
10 |
85 |
| Rank Gaps and the Size of the Core for Roommate Problems |
0 |
0 |
0 |
17 |
4 |
7 |
13 |
52 |
| School Choice: Nash Implementation of Stable Matchings through Rank-Priority Mechanisms |
0 |
0 |
0 |
27 |
3 |
3 |
11 |
66 |
| School Choice: Nash Implementation of Stable Matchings through Rank-Priority Mechanisms |
0 |
0 |
0 |
26 |
1 |
5 |
10 |
91 |
| School Choice: Nash Implementation of Stable Matchings through Rank-Priority Mechanisms |
0 |
0 |
0 |
6 |
3 |
6 |
11 |
59 |
| Total Working Papers |
0 |
0 |
3 |
506 |
41 |
79 |
209 |
2,250 |