Access Statistics for R. Pablo Arribillaga

Author contact details at EconPapers.

Working Paper File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
All Sequential Allotment Rules Are Obviously Strategy-Proof 0 0 0 18 1 1 4 63
All Sequential Allotment Rules Are Obviously Strategy-proof 0 0 0 28 1 1 2 73
All sequential allotment rules are obviously strategy-proof 0 0 0 3 2 3 5 16
Comparing Generalized Median Voter Schemes According to their Manipulability 0 0 0 25 1 4 6 44
Comparing Generalized Median Voter Schemes According to their Manipulability 0 0 0 44 2 4 5 62
Cooperative and axiomatic approaches to the knapsack allocation problem 0 0 0 26 3 7 8 46
Identifying and Quantifying (Un)Improvable Students 0 0 0 8 1 3 6 8
Not obviously manipulable allotment rules 0 0 0 5 0 1 6 8
Obvious Manipulations in Matching without and with Contracts 0 0 0 1 1 1 3 5
Obvious Manipulations of tops-only Voting Rules 0 0 0 12 1 2 4 14
Obvious Strategy-proofness with Respect to a Partition 0 0 0 1 0 1 3 4
Obvious Strategy-proofness with Respect to a Partition 0 0 0 7 1 1 7 8
Obvious manipulations of tops-only voting rules 0 0 0 14 1 1 1 6
Obvious manipulations, consistency, and the uniform rule 0 0 5 5 2 2 3 3
On Obvious Strategy-Proofness and Single-Peakedness 0 0 0 6 0 0 4 30
On Obvious Strategy-proofness and Single-peakedness 0 0 0 31 1 1 4 50
On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game 0 0 0 6 0 2 3 53
On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game 0 0 0 29 0 0 1 59
Regret-Free Truth-Telling Voting Rules 0 0 1 10 1 4 10 26
Regret-free truth-telling voting rules 1 1 1 7 2 3 4 9
Regret-free truth-telling voting rules 0 0 0 8 0 0 3 10
Unimprovable Students and Inequality in School Choice 0 0 0 6 1 1 4 8
Total Working Papers 1 1 7 300 22 43 96 605

Journal Article File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
All sequential allotment rules are obviously strategy-proof 0 0 0 0 2 4 6 9
Comparing Voting by Committees According to Their Manipulability 0 0 0 5 3 3 7 42
Comparing generalized median voter schemes according to their manipulability 0 0 0 4 0 4 6 38
Convergence of the approximate cores to the aspiration core in partitioning games 0 0 0 1 5 5 5 23
Cooperative and axiomatic approaches to the knapsack allocation problem 0 0 0 2 1 1 5 14
Obvious manipulations of tops-only voting rules 0 0 0 0 1 1 3 9
On obvious strategy-proofness and single-peakedness 0 0 0 7 1 2 5 30
On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game 0 0 0 0 0 1 5 5
On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game 0 0 0 0 0 0 3 10
Total Journal Articles 0 0 0 19 13 21 45 180

logo

LogEc Home

Top Working Papers
Top Journal Articles
Top Books
Top Chapters
Top Software Items

Top Authors

Top Working Paper series and Journals

About LogEc

Authors with papers registered in the RePEc Author Service.

Register yourself as an author or register more papers in the RePEc Author Service.

Authors with no registered papers

RePEc
LogEc provides access and usage statistics for services based on the RePEc data set.

Örebro UniversityLogEc is hosted by the Örebro University School of Business.

Questions or comments? Please see our explanation of how the statistics are collected or e-mail

Statistics updated 2025-12-06