| Journal Article |
File Downloads |
Abstract Views |
| Last month |
3 months |
12 months |
Total |
Last month |
3 months |
12 months |
Total |
| A Core Selection for Regulating a Single-Output Monopoly |
0 |
0 |
0 |
14 |
0 |
4 |
7 |
126 |
| A New Solution to the Random Assignment Problem |
1 |
2 |
8 |
645 |
2 |
12 |
38 |
1,672 |
| A simple random assignment problem with a unique solution |
0 |
0 |
1 |
104 |
3 |
16 |
19 |
591 |
| Almost budget-balanced VCG mechanisms to assign multiple objects |
0 |
1 |
3 |
102 |
2 |
6 |
13 |
253 |
| An Application of the Shapley Value to Fair Division with Money |
0 |
0 |
0 |
229 |
0 |
1 |
3 |
816 |
| An advocate of cooperative theory |
0 |
0 |
1 |
27 |
1 |
5 |
9 |
90 |
| An efficient and almost budget balanced cost sharing method |
0 |
0 |
0 |
20 |
1 |
5 |
8 |
92 |
| Auctioning or assigning an object: some remarkable VCG mechanisms |
0 |
0 |
0 |
19 |
0 |
2 |
7 |
64 |
| Average Cost Pricing versus Serial Cost Sharing: An Axiomatic Comparison |
0 |
1 |
1 |
149 |
1 |
6 |
9 |
432 |
| Balancing supply and demand under bilateral constraints |
0 |
0 |
0 |
18 |
2 |
14 |
18 |
151 |
| Bargaining among groups: an axiomatic viewpoint |
0 |
0 |
0 |
15 |
0 |
4 |
7 |
76 |
| COST SHARING IN NETWORKS: SOME OPEN QUESTIONS |
0 |
1 |
1 |
7 |
0 |
6 |
10 |
38 |
| Can everyone benefit from growth?: Two difficulties |
0 |
0 |
2 |
178 |
1 |
3 |
8 |
325 |
| Characterization of additive cost sharing methods |
0 |
0 |
0 |
16 |
0 |
4 |
8 |
68 |
| Characterizations of the pivotal mechanism |
0 |
1 |
2 |
128 |
3 |
5 |
8 |
388 |
| Collective choice under dichotomous preferences |
0 |
0 |
0 |
56 |
2 |
10 |
13 |
192 |
| Commons with increasing marginal costs: random priority versus average cost |
0 |
0 |
0 |
26 |
3 |
5 |
8 |
529 |
| Competitive Division of a Mixed Manna |
1 |
1 |
1 |
7 |
2 |
5 |
10 |
62 |
| Comportement stratégique et communication conflictuelle: le cas non coopératif |
0 |
0 |
0 |
6 |
0 |
4 |
5 |
108 |
| Condorcet's principle implies the no show paradox |
0 |
1 |
1 |
252 |
1 |
7 |
8 |
704 |
| Consistent bilateral assignment |
0 |
0 |
0 |
2 |
1 |
6 |
10 |
36 |
| Cores and Large Cores When Population Varies |
0 |
0 |
0 |
0 |
2 |
3 |
9 |
83 |
| Cores of effectivity functions and implementation theory |
0 |
0 |
1 |
149 |
1 |
4 |
7 |
341 |
| Correlation and duopoly |
0 |
0 |
0 |
49 |
2 |
6 |
9 |
117 |
| Cost Sharing under Increasing Returns: A Comparison of Simple Mechanisms |
0 |
0 |
0 |
25 |
1 |
9 |
11 |
75 |
| Decentralized pricing in minimum cost spanning trees |
0 |
0 |
0 |
12 |
3 |
11 |
15 |
71 |
| Deterrence and cooperation: A classification of two-person games |
0 |
0 |
0 |
22 |
0 |
4 |
6 |
65 |
| Distributive and Additive Costsharing of an Homogeneous Good |
0 |
0 |
0 |
20 |
3 |
9 |
11 |
123 |
| Dividing bads under additive utilities |
0 |
1 |
1 |
7 |
3 |
13 |
15 |
46 |
| Dominance Solvable Voting Schemes |
0 |
1 |
1 |
201 |
3 |
16 |
21 |
480 |
| Dominance solvability and cournot stability |
0 |
0 |
2 |
213 |
1 |
5 |
10 |
395 |
| Editorial |
0 |
0 |
0 |
3 |
0 |
3 |
3 |
33 |
| Egalitarian-Equivalent Cost Sharing of a Public Good |
0 |
0 |
1 |
92 |
0 |
3 |
5 |
381 |
| Egalitarianism and Utilitarianism in Quasi-linear Bargaining |
0 |
0 |
0 |
55 |
3 |
8 |
10 |
222 |
| Egalitarianism under earmark constraints |
0 |
0 |
0 |
8 |
0 |
7 |
12 |
115 |
| Entropy, desegregation, and proportional rationing |
0 |
0 |
0 |
13 |
0 |
4 |
9 |
74 |
| Equal-need sharing of a network under connectivity constraints |
0 |
0 |
0 |
27 |
0 |
2 |
4 |
103 |
| Equilibrium design in an n-player quadratic game |
0 |
0 |
0 |
0 |
1 |
5 |
10 |
13 |
| Fair Division in the Internet Age |
0 |
0 |
2 |
15 |
2 |
8 |
11 |
48 |
| Fair allocation of production externalities: recent results |
0 |
0 |
0 |
24 |
0 |
3 |
4 |
107 |
| Fair division with money and prices: bid & sell versus divide & choose |
0 |
0 |
0 |
0 |
1 |
2 |
4 |
4 |
| Filling a multicolor urn: an axiomatic analysis |
0 |
0 |
0 |
12 |
3 |
5 |
7 |
88 |
| From social welfare ordering to acyclic aggregation of preferences |
0 |
0 |
0 |
11 |
0 |
4 |
8 |
71 |
| Guarantees in Fair Division: General or Monotone Preferences |
0 |
0 |
0 |
1 |
1 |
4 |
6 |
11 |
| Impartial Nominations for a Prize |
0 |
1 |
1 |
28 |
1 |
5 |
6 |
146 |
| Impartial division of a dollar |
0 |
0 |
0 |
74 |
4 |
9 |
13 |
250 |
| Implementing a public project and distributing its cost |
0 |
0 |
0 |
7 |
0 |
5 |
14 |
108 |
| Implementing efficient, anonymous and neutral social choice functions |
0 |
0 |
0 |
75 |
1 |
3 |
6 |
144 |
| Implementing just and efficient decision-making |
0 |
0 |
0 |
30 |
1 |
8 |
9 |
109 |
| Implementing the Kalai-Smorodinsky bargaining solution |
0 |
1 |
3 |
219 |
3 |
7 |
11 |
418 |
| Improving Nash by coarse correlation |
0 |
0 |
0 |
34 |
2 |
8 |
12 |
131 |
| In memory of Victoria Kreps (3 September 1945–3 March 2021) |
0 |
0 |
0 |
4 |
0 |
2 |
3 |
24 |
| Incremental cost sharing: Characterization by coalition strategy-proofness |
0 |
0 |
1 |
202 |
1 |
7 |
9 |
596 |
| Introduction |
0 |
0 |
0 |
7 |
2 |
7 |
8 |
50 |
| Joint Ownership of a Convex Technology: Comparison of Three Solutions |
0 |
0 |
0 |
29 |
2 |
7 |
12 |
164 |
| Minimizing the Worst Slowdown: Offline, Online |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
11 |
| Monotonic surplus sharing: Characterization results |
0 |
0 |
0 |
13 |
1 |
6 |
6 |
49 |
| Non-cooperative implementation: A survey of recent results |
0 |
0 |
0 |
18 |
0 |
2 |
4 |
51 |
| ON ADDITIVE METHODS TO SHARE JOINT COSTS |
0 |
0 |
1 |
12 |
1 |
4 |
7 |
46 |
| On Additive Methods to Share Joint Costs |
0 |
0 |
0 |
105 |
1 |
3 |
4 |
237 |
| On demand responsiveness in additive cost sharing |
0 |
0 |
0 |
34 |
1 |
6 |
8 |
146 |
| On guarantees, vetoes and random dictators |
0 |
0 |
0 |
1 |
0 |
6 |
12 |
14 |
| On strategy-proofness and single peakedness |
4 |
7 |
21 |
148 |
11 |
31 |
69 |
402 |
| On the Fair Division of a Random Object |
0 |
1 |
1 |
1 |
0 |
7 |
10 |
13 |
| One dimensional mechanism design |
0 |
0 |
0 |
6 |
5 |
9 |
12 |
80 |
| Pricing traffic in a spanning network |
0 |
0 |
0 |
7 |
3 |
10 |
11 |
62 |
| Priority Rules and Other Asymmetric Rationing Methods |
0 |
0 |
0 |
0 |
0 |
4 |
14 |
428 |
| Professor Peter Sudhölter (1957–2024) |
0 |
0 |
0 |
2 |
1 |
22 |
27 |
29 |
| Proportional scheduling, split-proofness, and merge-proofness |
0 |
0 |
0 |
39 |
0 |
6 |
12 |
167 |
| Prudence versus sophistication in voting strategy |
0 |
0 |
0 |
34 |
0 |
4 |
8 |
118 |
| Public Ownership of the External World and Private Ownership of Self |
0 |
0 |
1 |
133 |
0 |
2 |
8 |
529 |
| Random Matching Under Dichotomous Preferences |
0 |
0 |
0 |
206 |
1 |
7 |
16 |
673 |
| Random Matching and assignment under dichotomous preferences |
0 |
0 |
0 |
19 |
1 |
10 |
10 |
105 |
| Rationing a Commodity along Fixed Paths |
0 |
0 |
0 |
21 |
0 |
6 |
9 |
90 |
| Responsibility and cross-subsidization in cost sharing |
0 |
0 |
0 |
34 |
0 |
4 |
6 |
199 |
| Scheduling with Opting Out: Improving upon Random Priority |
0 |
0 |
0 |
4 |
4 |
10 |
12 |
32 |
| Self-enforcing cooperation via strategic investment |
0 |
0 |
0 |
2 |
1 |
6 |
9 |
24 |
| Serial Cost Sharing |
1 |
3 |
4 |
355 |
3 |
14 |
20 |
982 |
| Serial Cost-Sharing of Excludable Public Goods |
0 |
0 |
2 |
129 |
1 |
6 |
19 |
372 |
| Sharing a minimal cost spanning tree: Beyond the Folk solution |
0 |
0 |
0 |
33 |
1 |
6 |
9 |
119 |
| Sharing the cost of redundant items |
0 |
0 |
1 |
10 |
3 |
7 |
15 |
70 |
| Sharing the cost of risky projects |
0 |
0 |
0 |
3 |
0 |
1 |
2 |
31 |
| Size versus fairness in the assignment problem |
0 |
0 |
0 |
9 |
0 |
4 |
9 |
73 |
| Strategyproof sharing of submodular costs:budget balance versus efficiency |
0 |
0 |
1 |
191 |
4 |
8 |
12 |
622 |
| The Bipartite Rationing Problem |
0 |
0 |
0 |
3 |
1 |
6 |
6 |
25 |
| The Conditional Auction Mechanism for Sharing a Surplus |
0 |
0 |
0 |
31 |
1 |
2 |
5 |
159 |
| The Proportional Veto Principle |
0 |
0 |
1 |
21 |
1 |
5 |
20 |
107 |
| The Pure Compensation Problem: Egalitarianism Versus Laissez-Fairism |
0 |
0 |
0 |
55 |
3 |
6 |
8 |
575 |
| The price of anarchy of serial, average and incremental cost sharing |
0 |
0 |
1 |
45 |
7 |
10 |
12 |
192 |
| The price of imperfect competition for a spanning network |
0 |
0 |
0 |
7 |
0 |
5 |
9 |
58 |
| The proportional random allocation of indivisible units |
0 |
0 |
0 |
49 |
2 |
6 |
10 |
330 |
| The separability axiom and equal-sharing methods |
0 |
0 |
0 |
96 |
3 |
5 |
9 |
245 |
| The solidarity axiom in parametric surplus-sharing problems |
0 |
0 |
0 |
17 |
1 |
5 |
5 |
65 |
| Three Methods to Share Joint Costs or Surplus |
0 |
0 |
0 |
116 |
7 |
18 |
25 |
385 |
| Traffic-Based Cost Allocation in a Network |
0 |
0 |
0 |
84 |
1 |
4 |
6 |
381 |
| Two versions of the tragedy of the commons |
0 |
0 |
0 |
29 |
2 |
5 |
7 |
102 |
| Uniform externalities: Two axioms for fair allocation |
0 |
0 |
0 |
59 |
2 |
7 |
9 |
160 |
| Voting with Proportional Veto Power |
0 |
0 |
1 |
38 |
0 |
4 |
9 |
159 |
| Welfare bounds in the cooperative production problem |
0 |
0 |
0 |
20 |
1 |
5 |
7 |
72 |
| Welfare bounds in the fair division problem |
0 |
0 |
0 |
61 |
3 |
6 |
10 |
127 |
| Total Journal Articles |
7 |
23 |
69 |
5,988 |
150 |
647 |
1,056 |
20,935 |