Access Statistics for Remzi Sanver

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 solution to the two-person implementation problem 0 0 0 0 0 1 7 10
A solution to the two-person implementation problem 1 1 1 1 2 5 8 12
A solution to the two-person implementation problem 0 0 0 0 2 2 6 14
A solution to the two-person implementation problem 1 1 1 37 2 6 8 97
A solution to the two-person implementation problem 0 0 0 17 1 2 3 17
Ability or motivation? Voter registration and turnout in Burkina Faso 0 0 2 6 0 5 11 19
Absolute Qualified Majoritarianism: How Does the Threshold Matter? 0 0 0 3 0 1 2 26
Absolute Qualified Majoritarianism: How Does the Threshold Matter? 0 0 0 8 0 5 7 53
Absolute qualified majoritarianism: how does the threshold matter? 0 0 0 0 0 1 4 7
An Arrovian impossibility in combining ranking and evaluation 0 0 0 3 1 6 12 19
Anonymous, neutral, and resolute social choice revisited 0 0 0 2 0 3 7 15
Anonymous, neutral, and resolute social choice revisited 0 0 0 3 1 2 5 24
Compromise Rules Revisited 0 0 0 9 2 5 7 33
Compromising as an equal loss principle 0 0 0 0 0 2 4 8
Evaluationwise strategy-proofness 0 0 0 0 1 2 2 19
Hyper-Stable Social Welfare Functions 0 0 0 33 1 2 5 101
Hyper-stable social welfare functions 0 0 0 0 0 4 4 19
Implementing Pareto Optimal and Individually Rational Outcomes by Veto 0 0 0 0 0 0 0 6
MONOTONICITY VIOLATIONS UNDER PLURALITY WITH A RUNOFF: THE CASE OF FRENCH PRESIDENTIAL ELECTIONS 0 0 3 13 2 10 21 57
Measuring consensus in a preference-approval context 0 0 0 14 0 3 7 92
Metrizable preferences over preferences 0 0 0 0 0 4 6 11
Monotonicity violations under plurality with a runoff: the case of French presidential elections 0 0 0 6 1 1 2 7
On Domains That Admit Well-behaved Strategy-proof Social Choice Functions 0 0 0 40 0 3 7 137
On the subgame perfect implementability of voting rules 0 1 1 3 0 5 7 13
Positively Responsive Collective Choice Rules and Majority Rule: A Generalization of May’s Theorem to Many Alternatives 0 0 0 11 0 1 4 37
Positively responsive collective choice rules and majority rule: A generalization of May's theorem to many alternatives 0 0 0 7 2 8 11 33
Positively responsive collective choice rules and majority rule: A generalization of May’s theorem to many alternatives 0 0 0 0 1 7 10 23
Positively responsive collective choice rules and majority rule: a generalization of May's theorem to many alternatives 0 0 0 0 1 4 7 113
Procedural versus Opportunity-Wise Equal Treatment of Alternatives: Neutrality Revisited 0 0 0 29 2 16 21 89
Procedural versus Opportunity-Wise Equal Treatment of Alternatives: Neutrality Revisited 0 0 0 4 6 11 13 31
REVISITING THE CONNECTION BETWEEN THE NO-SHOW PARADOX AND MONOTONICITY * 0 0 0 3 0 1 4 32
Recovering non-monotonicity problems of voting rules 0 0 0 0 2 4 6 19
Restricting the domain allows for weaker independence 0 0 0 0 0 1 2 9
Revisiting the connection between the no-show paradox and monotonicity 0 0 0 0 0 1 4 11
Simple but powerful models of stereotype formation * 0 0 1 3 1 8 13 19
Social Choice without the Pareto Principle under Weak Independence 0 0 0 13 1 10 12 121
Strong Equilibrium Outcomes of Voting Games are the Generalized Condorcet Winners 0 0 0 0 2 4 11 375
The Future of Economic Design 0 0 0 0 1 2 7 35
The Future of Economic Design: The Continuing Development of a Field as Envisioned by Its Researchers 0 0 0 0 0 2 4 19
The Future of Economic Design: The Continuing Development of a Field as Envisioned by Its Researchers 0 0 0 0 1 4 7 38
The relationship between Arrow’s and Wilson’s theorems on restricted domains 0 0 0 12 0 1 3 7
Uniform Random Dictatorship: A characterization without strategy-proofness * 0 0 0 0 0 4 9 10
Well-designed incentive schemes: introduction to the special issue in honor of Semih Koray 0 0 0 2 0 2 3 5
Total Working Papers 2 3 9 282 36 171 303 1,842
1 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 characterization of superdictatorial domains for strategy-proof social choice functions 0 0 0 6 0 3 3 32
A characterization of the Copeland solution 0 0 0 39 0 1 4 101
A general impossibility result on strategy-proof social choice hyperfunctions 0 0 0 27 1 5 10 127
A minimax procedure for electing committees 0 0 0 28 0 5 9 166
A new monotonicity condition for tournament solutions 0 0 0 21 0 2 4 86
A solution to the two-person implementation problem 0 0 2 7 1 4 7 31
Absolute qualified majoritarianism: How does the threshold matter? 0 0 0 3 0 3 6 30
An Allocation Rule with Wealth‐Regressive Tax Rates 0 0 0 28 0 2 2 166
An Arrovian impossibility in combining ranking and evaluation 0 0 0 3 1 8 13 31
An individual manipulability of positional voting rules 0 0 0 11 1 3 5 62
Anonymous, neutral, and resolute social choice revisited 0 0 0 2 10 12 16 35
Another characterization of the majority rule 0 0 1 74 0 1 6 179
Arrovian impossibilities in aggregating preferences over non-resolute outcomes 0 0 0 14 0 4 7 98
Characterizations of majoritarianism: a unified approach 0 0 0 12 0 3 7 63
Choosers as extension axioms 0 0 0 3 0 5 9 51
Compromise Rules Revisited 0 0 0 5 0 7 9 53
Compromising as an equal loss principle 0 0 0 0 1 2 9 14
Correction to: Anonymous, neutral, and resolute social choice revisited 0 0 0 0 0 6 7 12
Dictatorial domains in preference aggregation 0 0 0 56 0 3 4 117
Efficiency in the Degree of Compromise: A New Axiom for Social Choice 0 0 0 1 3 5 9 25
Eighth International Meeting of the Society for Social Choice and Welfare 0 0 0 2 0 2 2 28
Ensuring Pareto Optimality by Referendum Voting 0 0 0 21 0 2 4 112
Equilibrium allocations of endowment-pretension games in public good economies 0 0 0 8 1 3 3 104
Equilibrium outcomes of Lindahl-endowment pretension games1 0 0 0 15 0 4 8 113
Evaluating the Degree of Manipulability of Certain Aggregation Procedures under Multiple Choices 0 1 1 31 0 11 16 137
Evaluationwise strategy-proofness 0 0 0 13 1 7 16 65
Expected Utility Consistent Extensions of Preferences 0 0 0 20 1 3 5 80
Hyper-stable social welfare functions 0 0 0 6 0 1 7 51
Implementing Pareto Optimal and Individually Rational Outcomes by Veto 0 0 0 0 0 3 7 36
Implementing matching rules by type pretension mechanisms 0 0 0 16 0 4 5 98
Is abstention an escape from Arrow’s theorem? 0 0 0 19 0 0 1 62
Maskin monotonic aggregation rules 0 0 0 40 0 3 3 144
Metrizable preferences over preferences 0 0 0 6 1 1 3 30
Minimal monotonic extensions of scoring rules 0 0 0 30 0 4 6 136
Monotonicity properties and their adaptation to irresolute social choice rules 0 0 1 6 1 5 6 49
Monotonicity violations under plurality with a runoff: the case of French presidential elections 0 0 0 0 1 6 8 18
Nash implementability of the plurality rule over restricted domains 0 0 0 19 0 3 3 80
Nash implementation of the majority rule 0 0 0 27 1 4 6 75
Nash implementation via hyperfunctions 0 0 1 13 0 4 6 60
Nash implementing non-monotonic social choice rules by awards 0 0 0 34 0 5 12 163
Nash implementing social choice rules with restricted ranges 0 0 0 7 0 5 9 41
On combining implementable social choice rules 0 0 0 64 0 1 2 131
On domains that admit well-behaved strategy-proof social choice functions 0 0 0 14 1 2 7 113
On the alternating use of "unanimity" and "surjectivity" in the Gibbard-Satterthwaite Theorem 0 0 0 11 0 0 2 50
On the manipulability of voting rules: The case of 4 and 5 alternatives 0 0 0 31 0 4 9 88
On the subgame perfect implementability of voting rules 0 0 1 6 1 2 4 20
One-way monotonicity as a form of strategy-proofness 0 0 0 21 0 5 7 76
POSITIVELY RESPONSIVE COLLECTIVE CHOICE RULES AND MAJORITY RULE: A GENERALIZATION OF MAY'S THEOREM TO MANY ALTERNATIVES 0 1 1 13 0 8 13 48
Recovering non-monotonicity problems of voting rules 0 0 0 1 0 6 8 25
Restricting the domain allows for weaker independence 0 0 0 2 1 3 5 48
Revisiting the connection between the no-show paradox and monotonicity 0 0 1 3 0 5 15 39
Scoring rules cannot respect majority in choice and elimination simultaneously 0 0 0 19 0 2 5 84
Sets of alternatives as Condorcet winners 0 0 0 40 0 4 7 144
Simple Collective Identity Functions 0 0 1 19 0 2 6 140
Simple but Powerful Models of Stereotype Formation 0 0 0 0 2 8 9 14
Social choice without the Pareto principle under weak independence 0 0 0 3 0 2 7 30
Sophisticated preference aggregation 0 0 0 14 0 2 6 51
Stereotype formation as trait aggregation 0 0 0 18 0 5 8 107
Strategy-proof resolute social choice correspondences 0 0 0 37 0 1 2 122
Strategy-proofness of the plurality rule over restricted domains 0 0 1 7 0 5 10 58
Strong equilibrium outcomes of voting games ¶are the generalized Condorcet winners 0 0 1 45 0 1 8 179
The relationship between Arrow’s and Wilson’s theorems on restricted domains 0 0 1 3 0 3 7 14
Voting games of resolute social choice correspondences 0 0 0 7 0 2 2 40
Well-designed incentive schemes: introduction to the special issue in honor of Semih Koray 0 0 0 4 1 7 9 35
Which dictatorial domains are superdictatorial? A complete characterization for the Gibbard–Satterthwaite impossibility 0 0 0 1 3 3 5 19
Total Journal Articles 0 2 13 1,056 34 247 445 4,836

Chapter File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
Approval as an Intrinsic Part of Preference 0 0 0 0 1 6 9 26
How to Elect a Representative Committee Using Approval Balloting 0 0 0 0 1 2 4 8
Introduction to the Handbook on Approval Voting 0 0 0 0 1 6 9 17
Minimal Maskin Monotonic Extensions of Tournament Solutions 0 0 0 0 0 2 4 12
The Basic Approval Voting Game 0 0 0 0 1 5 7 10
Voting Systems that Combine Approval and Preference 0 0 0 1 1 6 8 17
Total Chapters 0 0 0 1 5 27 41 90

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