Access Statistics for Alejandro Neme

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 0 0 1 619
AN ALGORITHM TO COMPUTE THE SET OF MANY-TO-MANY STABLE MATCHINGS 0 0 0 76 0 0 0 241
All Sequential Allotment Rules Are Obviously Strategy-Proof 0 0 0 18 0 1 3 62
All Sequential Allotment Rules Are Obviously Strategy-proof 0 0 0 28 0 1 1 72
All sequential allotment rules are obviously strategy-proof 0 0 0 3 0 0 2 13
Bribe-proof Rules in the Division Problem 0 0 0 72 0 0 1 630
Equilibrium Payoffs of Dynamic Games 0 0 0 0 0 0 0 130
Equilibrium of Repeated Games With Cost of Implementation 0 0 0 17 1 1 2 97
Individually Rational Rules for the Division Problem when the Number of Units to be Allotted is Endogenous 0 0 0 5 2 2 3 10
Individually Rational Rules for the Division Problem when the Number of Units to be Allotted is Endogenous 0 0 0 43 0 0 1 31
Little Perfection and Complexity 0 0 0 0 0 0 0 79
MAXIMAL DOMAIN OF PREFERENCES IN THE DIVISION PROBLEM 0 0 0 42 0 0 0 234
On Cooperative Solutions of a Generalized Assignment Game: Limit Theorems to the Set of Competitive Equilibria 0 0 0 3 0 0 0 36
On Cooperative Solutions of a Generalized Assignment Game: Limit Theorems to the Set of Competitive Equilibria 0 0 0 40 0 0 0 113
On Exiting after Voting 0 0 0 46 0 0 0 204
On Obvious Strategy-Proofness and Single-Peakedness 0 0 0 6 0 2 4 30
On Obvious Strategy-proofness and Single-peakedness 0 0 0 31 0 1 4 49
On Societies Choosing Social Outcomes, and their Memberships: Internal Stability and Consistency 0 0 0 7 0 1 1 36
On group strategy-proof mechanisms for a many-to-one matching model 1 1 1 128 1 1 1 516
On the Invariance of the Set of Core Matchings with Respect to Preference Profiles 0 0 0 7 1 1 1 51
On the Invariance of the Set of Core Matchings with Respect to Preference Profiles 0 0 0 1 0 1 1 33
On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game 0 0 0 29 0 0 1 59
On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game 0 0 0 6 0 0 1 51
Order-k Rationality 0 1 1 2 0 1 2 9
Order-k Rationality 0 0 1 11 0 0 1 8
Order-k Rationality 0 0 0 5 0 0 2 43
Ordinal Relative Satisficing Behavior: Theory and Experiments 0 0 0 28 0 0 3 106
Stable Partitions in Many Division Problems: The Proportional and the Sequential Dictator Solutions 0 0 0 16 0 0 2 68
Stable Partitions in Many Division Problems: The Proportional and the Sequential Dictator Solutions 0 0 0 5 0 0 0 50
Subgame Perfect Equilibrium of Repeated Games with Cost of Implementation 0 0 0 0 0 0 1 190
The Division Problem under Constraints 0 0 0 14 0 0 1 46
The Division Problem under Constraints 0 0 0 10 0 0 2 34
The Division Problem with Voluntary Participation 0 0 0 36 1 1 1 109
The Multiple-partners Assignment Game with Heterogeneous Sales and Multi-unit Demands: Competitive Equilibria 0 0 0 30 0 0 0 118
The Multiple-partners Assignment Game with Heterogeneous Sells and Multi-unit Demands: Competitive Equilibria 0 0 0 15 0 0 1 82
The Strength of a Little Perfection 0 0 0 43 0 1 1 256
Voting Under Constraints 0 0 0 0 1 2 2 151
Voting by Committees Under Constraints 0 0 0 59 0 0 0 251
Voting by Committees under Constraints 0 0 0 6 1 1 1 45
Voting by Committees under Constraints 0 0 0 76 0 0 0 407
Voting by Committees under Constraints 0 0 0 5 0 0 1 37
Voting by Committees with Exit 0 0 0 46 0 0 1 307
Total Working Papers 1 2 3 1,065 8 18 50 5,713
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 maximal domain of preferences for strategy-proof, efficient, and simple rules in the division problem 0 0 0 13 0 0 2 92
A nash type equilibrium in games without transitive preferences 0 0 0 4 0 0 0 25
An algorithm to compute the full set of many-to-many stable matchings 0 0 0 58 0 1 2 251
An undominated Nash equilibrium for voting by committees with exit 0 0 0 24 0 0 1 85
Bribe-proof rules in the division problem 0 0 0 11 1 1 4 103
Effort of rugby teams according to the bonus point system: a theoretical and empirical analysis 0 0 0 3 1 2 4 20
Equilibrium Payoffs of Dynamic Games 0 0 0 0 0 0 1 148
Equilibrium of repeated games with cost of implementation 0 0 0 3 2 3 3 32
Individually rational rules for the division problem when the number of units to be allotted is endogenous 0 0 0 1 0 1 1 15
Little Perfection and Complexity 0 0 0 0 0 1 2 54
Maximal Domain of Preferences in the Division Problem 0 0 0 9 1 2 2 87
Maximal domains of preferences preserving strategy-proofness for generalized median voter schemes 0 0 0 31 0 1 2 246
On Exiting After Voting 0 0 0 12 0 0 1 104
On cooperative solutions of a generalized assignment game: Limit theorems to the set of competitive equilibria 0 0 0 4 0 1 1 37
On exiting after voting 0 0 0 2 0 1 2 68
On group strategy-proof mechanisms for a many-to-one matching model 0 0 0 27 1 1 4 187
On obvious strategy-proofness and single-peakedness 0 0 0 7 0 2 3 28
On societies choosing social outcomes, and their memberships: internal stability and consistency 0 0 0 2 0 1 1 23
On societies choosing social outcomes, and their memberships: strategy-proofness 0 0 0 0 0 1 5 17
On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game 0 0 0 0 0 0 3 10
On the invariance of the set of Core matchings with respect to preference profiles 0 0 0 3 0 1 2 42
On the invariance of the set of stable matchings with respect to substitutable preference profiles 0 0 0 14 0 2 4 64
On two basic properties of equilibria of voting with exit 0 0 0 4 0 0 0 28
STABLE SOLUTIONS ON MATCHING MODELS WITH QUOTA RESTRICTION 0 0 0 1 0 0 1 14
Single Agents and the Set of Many-to-One Stable Matchings 0 0 0 73 1 2 3 227
Stability and voting by committees with exit 0 0 0 8 0 0 0 66
Stable partitions in many division problems: the proportional and the sequential dictator solutions 0 0 0 0 0 2 2 17
Strategy-Proof Allotment Rules 0 0 2 39 0 1 6 218
Subgame Perfect Equilibrium of Repeated Games with Implementation Costs 0 0 0 18 0 1 3 58
The Blocking Lemma for a many-to-one matching model 0 0 0 9 1 3 8 83
The Strength of a Little Perfection 0 0 0 0 0 1 3 164
The division problem under constraints 0 0 0 5 0 1 2 36
The division problem with maximal capacity constraints 0 0 0 3 0 0 1 39
The division problem with voluntary participation 0 0 0 7 0 0 0 30
The multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria 0 0 0 1 0 1 2 30
The network of concepts in written texts 0 0 1 8 0 0 2 25
Voting by committees under constraints 0 0 0 21 1 1 1 125
Voting under Constraints 0 1 1 26 1 2 5 118
Total Journal Articles 0 1 4 451 10 37 89 3,016


Statistics updated 2025-09-05