Access Statistics for Jordi Masso

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
A Maximal Domain of Preferences for Tops-only Rules in the Division Problem 0 0 0 50 1 9 10 629
AN ALGORITHM TO COMPUTE THE SET OF MANY-TO-MANY STABLE MATCHINGS 0 0 0 76 0 3 4 245
All Sequential Allotment Rules Are Obviously Strategy-Proof 0 0 0 18 0 5 8 68
All Sequential Allotment Rules Are Obviously Strategy-proof 0 0 0 28 0 3 5 76
All sequential allotment rules are obviously strategy-proof 0 0 0 3 0 2 6 18
Bribe-proof Rules in the Division Problem 0 0 0 72 2 12 12 642
Comparing Generalized Median Voter Schemes According to their Manipulability 0 0 0 25 0 10 16 54
Comparing Generalized Median Voter Schemes According to their Manipulability 0 0 0 44 0 4 9 66
Efficient and Stable Collective Choices under Crowding Preferences 0 0 0 1 0 3 4 34
Efficient and Stable Collective Choices under Crowding Preferences 0 0 0 0 2 3 4 52
Efficient and Stable Collective Choices under Gregarious Preferences 0 0 0 97 4 10 11 216
Equilibrium Payoffs of Dynamic Games 0 0 0 0 0 10 11 141
False-name-proof and Strategy-proof Voting Rules under Separable Preferences 0 0 1 10 1 5 10 18
Group Obvious Strategy-proofness: Definition and Characterization 0 0 14 14 0 6 27 27
Group Obvious Strategy-proofness: Definition and Characterization 0 0 5 5 1 9 16 16
Incomplete Information and Small Cores in Matching Markets 0 0 0 12 1 3 8 68
Incomplete Information and Small Cores in Matching Markets 0 0 0 7 0 4 6 58
Individually Rational Rules for the Division Problem when the Number of Units to be Allotted is Endogenous 0 0 0 43 0 4 6 36
Individually Rational Rules for the Division Problem when the Number of Units to be Allotted is Endogenous 0 0 0 5 1 7 9 17
MAXIMAL DOMAIN OF PREFERENCES IN THE DIVISION PROBLEM 0 0 0 42 0 4 4 238
MEMORY STARTEGIES IN NONATOMIC REPEATED GAMES 0 0 0 0 0 4 6 197
Matching Markets under (In)complete Information 0 0 0 75 1 10 12 170
Matching Markets under (In)complete Information 0 0 0 14 0 4 5 82
Obvious Strategy-proofness with Respect to a Partition 0 0 0 7 0 4 10 12
Obvious Strategy-proofness with Respect to a Partition 0 0 0 3 0 4 6 15
On Cooperative Solutions of a Generalized Assignment Game: Limit Theorems to the Set of Competitive Equilibria 0 0 0 40 1 3 4 117
On Cooperative Solutions of a Generalized Assignment Game: Limit Theorems to the Set of Competitive Equilibria 0 0 0 3 2 7 8 44
On Equal Cost Sharing in the Provision of an Excludable Public Good 0 0 0 51 4 5 9 99
On Exiting after Voting 0 0 0 46 0 3 4 208
On Obvious Strategy-Proofness and Single-Peakedness 0 0 0 6 1 4 7 34
On Obvious Strategy-proofness and Single-peakedness 0 0 0 31 0 5 7 55
On Societies Choosing Social Outcomes, and their Memberships: Internal Stability and Consistency 0 0 0 7 1 4 5 40
On Strategy-Proofness and Semilattice Single-Peakedness 0 0 0 6 0 3 8 34
On Strategy-proofness and Symmetric Single-Peakedness 0 0 0 1 1 3 6 39
On Strategy-proofness and Symmetric Single-peakedness 0 0 0 34 0 5 8 106
On Strategy-proofness and the Salience of Single-peakedness 0 0 0 32 0 5 8 70
On Strategy-proofness and the Salience of Single-peakedness 0 0 0 6 1 3 7 46
On Strategy-proofness and the Salience of Single-peakedness in a Private Goods Economy 0 0 0 14 2 4 12 41
On group strategy-proof mechanisms for a many-to-one matching model 0 0 1 128 0 2 6 521
On strategy-proofness and semilattice single-peakedness 0 0 1 28 1 4 6 58
On the Invariance of the Set of Core Matchings with Respect to Preference Profiles 0 0 0 1 1 3 5 37
On the Invariance of the Set of Core Matchings with Respect to Preference Profiles 0 0 0 7 1 7 9 59
On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game 0 0 0 6 1 9 11 62
On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game 0 0 0 29 0 5 6 64
Preference Restrictions for Simple and Strategy-Proof Rules: Local and Weakly Single-Peaked Domains 0 0 0 5 1 15 24 32
Preference Restrictions for Simple and Strategy-Proof Rules: Local and Weakly Single-Peaked Domains 0 0 0 14 6 13 16 36
Preference restrictions for strategy-proof and simple rules: local and weakly single-peaked domains 0 0 0 2 0 1 3 5
Robust Design in Monotonic Matching Markets: A Case for Firm-Proposing Deferred-Acceptance 0 0 0 30 4 11 14 79
Robust design in monotonic matching markets: A case for firm-proposing deferred-acceptance 0 0 0 10 1 9 12 37
Some Things Couples always wanted to know about stable matchings (but were afraid to ask) 0 0 0 7 1 5 7 63
Stability of Matchings when Individuals Have Preferences Over Colleagues 0 0 0 0 0 4 9 483
Stable Partitions in Many Division Problems: The Proportional and the Sequential Dictator Solutions 0 0 0 16 2 7 10 77
Stable Partitions in Many Division Problems: The Proportional and the Sequential Dictator Solutions 0 0 0 5 0 13 16 66
Strategy-Proof Voting on Compact Ranges 0 0 0 0 1 8 13 1,065
Strategy-Proof Voting on Compact Ranges 0 0 0 0 1 7 11 335
THE CHI-COMPROMISE VALUE FOR NON-TRANSFERABLE UTILITY GAMES 0 0 0 38 2 12 15 222
The Division Problem under Constraints 0 0 0 14 0 3 4 50
The Division Problem under Constraints 0 0 0 10 0 4 11 43
The Division Problem with Voluntary Participation 0 0 0 36 1 8 9 117
The Multiple-partners Assignment Game with Heterogeneous Sales and Multi-unit Demands: Competitive Equilibria 0 0 0 30 0 2 4 122
The Multiple-partners Assignment Game with Heterogeneous Sells and Multi-unit Demands: Competitive Equilibria 0 0 0 15 0 3 6 88
Voting Under Constraints 0 0 0 0 0 5 7 156
Voting by Committees Under Constraints 0 0 0 59 0 5 8 259
Voting by Committees under Constraints 0 0 0 5 0 2 3 40
Voting by Committees under Constraints 0 0 0 6 1 6 8 52
Voting by Committees under Constraints 0 0 0 76 0 4 6 413
Voting by Committees with Exit 0 0 0 46 0 4 6 313
Weak Stability and a Bargaining Set for the Marriage Model 0 0 0 2 0 2 3 27
Weak Stability and a Bargaining Set for the Marriage Model 0 0 0 0 1 16 19 23
Weighted Approval Voting 0 0 1 77 3 12 20 309
Weighted approval voting 0 0 0 39 0 3 9 163
Total Working Papers 0 0 23 1,669 56 410 634 9,604
2 registered items for which data could not be found

Journal Article File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A Note on Reputation: More on the Chain-Store Paradox 0 0 0 59 1 4 6 225
A maximal domain of preferences for strategy-proof, efficient, and simple rules in the division problem 0 0 0 13 0 4 5 97
All sequential allotment rules are obviously strategy-proof 0 0 0 0 0 1 6 10
An algorithm to compute the full set of many-to-many stable matchings 0 0 0 58 0 4 5 255
An undominated Nash equilibrium for voting by committees with exit 0 0 0 24 0 5 7 91
Bribe-proof rules in the division problem 0 0 0 11 0 3 7 107
Comparing Voting by Committees According to Their Manipulability 0 0 0 5 0 4 9 46
Comparing generalized median voter schemes according to their manipulability 0 0 0 4 0 2 7 40
Corrigendum to "On strategy-proofness and semilattice single-peakedness" [Games Econ. Behav. 124 (2020) 219–238] 0 0 0 3 0 9 13 20
Efficient and stable collective choices under gregarious preferences 0 0 0 8 5 6 9 85
Equilibrium Payoffs of Dynamic Games 0 0 0 0 0 3 5 153
False-name-proof and strategy-proof voting rules under separable preferences 0 0 0 0 0 5 6 10
Incomplete information and singleton cores in matching markets 0 0 0 77 1 6 9 184
Individually rational rules for the division problem when the number of units to be allotted is endogenous 0 0 0 1 1 5 6 20
Matching markets under (in)complete information 0 0 0 21 1 5 10 102
Maximal Domain of Preferences in the Division Problem 0 0 0 9 0 3 5 90
Maximal domains of preferences preserving strategy-proofness for generalized median voter schemes 0 0 0 31 3 8 10 255
More on the "anti-folk theorem" 0 0 0 15 0 3 3 127
ON STRATEGY†PROOFNESS AND THE SALIENCE OF SINGLE†PEAKEDNESS 0 0 0 0 0 1 4 16
On Exiting After Voting 0 0 0 12 0 3 3 107
On cooperative solutions of a generalized assignment game: Limit theorems to the set of competitive equilibria 0 0 0 4 0 2 4 40
On cost sharing in the provision of a binary and excludable public good 0 0 0 17 2 3 7 109
On group strategy-proof mechanisms for a many-to-one matching model 0 0 0 27 1 2 3 189
On obvious strategy-proofness and single-peakedness 0 0 0 7 0 1 6 31
On societies choosing social outcomes, and their memberships: internal stability and consistency 0 0 0 2 0 2 5 27
On societies choosing social outcomes, and their memberships: strategy-proofness 0 0 0 0 1 4 7 21
On strategy-proofness and semilattice single-peakedness 0 0 0 2 3 8 12 26
On strategy-proofness and symmetric single-peakedness 0 0 0 15 0 3 6 97
On strategy-proofness and the salience of single-peakedness in a private goods allotment problem 0 0 1 1 1 5 21 21
On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game 0 0 0 0 0 3 3 13
On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game 0 0 0 0 1 1 6 6
On the invariance of the set of Core matchings with respect to preference profiles 0 0 0 3 2 3 5 46
On the invariance of the set of stable matchings with respect to substitutable preference profiles 0 0 0 14 4 5 9 71
On two basic properties of equilibria of voting with exit 0 0 0 4 0 1 3 31
Preference restrictions for simple and strategy-proof rules: Local and weakly single-peaked domains 0 0 0 0 1 5 8 9
Single Agents and the Set of Many-to-One Stable Matchings 0 0 0 73 2 9 11 236
Some things couples always wanted to know about stable matchings (but were afraid to ask) 0 0 0 13 1 5 7 98
Stability and voting by committees with exit 0 0 0 8 0 3 5 71
Stability of Matchings When Individuals Have Preferences over Colleagues 0 0 0 94 2 5 8 230
Stable partitions in many division problems: the proportional and the sequential dictator solutions 0 0 0 0 0 6 8 23
Strategy-Proof Voting on Compact Ranges 0 0 1 31 1 5 13 114
The Blocking Lemma for a many-to-one matching model 0 0 0 9 0 2 8 87
The Chi-compromise value for non-transferable utility games 0 0 0 0 0 2 3 22
The division problem under constraints 0 0 0 5 1 5 8 42
The division problem with maximal capacity constraints 0 0 0 3 2 7 8 47
The division problem with voluntary participation 0 0 0 7 2 7 9 39
The multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria 0 0 0 1 0 0 2 31
Undiscounted equilibrium payoffs of repeated games with a continuum of players 0 0 0 9 0 1 4 62
Voting by committees under constraints 0 0 0 21 1 7 13 137
Voting under Constraints 1 1 2 27 1 8 12 128
Weak stability and a bargaining set for the marriage model 0 0 0 28 0 2 6 141
Weighted approval voting 0 0 0 31 0 5 8 159
Total Journal Articles 1 1 4 807 41 211 373 4,444

Chapter File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
Salvador Barberà 0 0 0 0 1 4 5 15
Total Chapters 0 0 0 0 1 4 5 15

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

Since October 2025, abstract view statistics are potentially heavily influenced by traffic from AI bots and tools that we could not eliminate despite our best efforts.

Statistics updated 2026-03-04