M. Remzi Sanver

According to our database1, M. Remzi Sanver authored at least 34 papers between 2002 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
On the subgame perfect implementabılıty of voting rules.
Soc. Choice Welf., 2021

Recovering non-monotonicity problems of voting rules.
Soc. Choice Welf., 2021

2020
Metrizable preferences over preferences.
Soc. Choice Welf., 2020

2018
Restricting the domain allows for weaker independence.
Soc. Choice Welf., 2018

Which dictatorial domains are superdictatorial? A complete characterization for the Gibbard-Satterthwaite impossibility.
Math. Soc. Sci., 2018

2017
Revisiting the connection between the no-show paradox and monotonicity.
Math. Soc. Sci., 2017

Evaluationwise strategy-proofness.
Games Econ. Behav., 2017

2016
Hyper-stable social welfare functions.
Soc. Choice Welf., 2016

2015
Voting games of resolute social choice correspondences.
Soc. Choice Welf., 2015

2014
Social choice without the Pareto principle under weak independence.
Soc. Choice Welf., 2014

Measuring consensus in a preference-approval context.
Inf. Fusion, 2014

2013
On domains that admit well-behaved strategy-proof social choice functions.
J. Econ. Theory, 2013

2012
Monotonicity properties and their adaptation to irresolute social choice rules.
Soc. Choice Welf., 2012

On the manipulability of voting rules: The case of 4 and 5 alternatives.
Math. Soc. Sci., 2012

Computation and Incentives in Social Choice (Dagstuhl Seminar 12101).
Dagstuhl Reports, 2012

2009
Sophisticated preference aggregation.
Soc. Choice Welf., 2009

Characterizations of majoritarianism: a unified approach.
Soc. Choice Welf., 2009

Stereotype formation as trait aggregation.
Math. Soc. Sci., 2009

One-way monotonicity as a form of strategy-proofness.
Int. J. Game Theory, 2009

A general impossibility result on strategy-proof social choice hyperfunctions.
Games Econ. Behav., 2009

Voting Systems that Combine Approval and Preference.
Proceedings of the Mathematics of Preference, Choice and Order, 2009

2008
Strategy-proof resolute social choice correspondences.
Soc. Choice Welf., 2008

Arrovian impossibilities in aggregating preferences over non-resolute outcomes.
Soc. Choice Welf., 2008

2007
Dictatorial domains in preference aggregation.
Soc. Choice Welf., 2007

Is abstention an escape from Arrow's theorem?
Soc. Choice Welf., 2007

A characterization of superdictatorial domains for strategy-proof social choice functions.
Math. Soc. Sci., 2007

On combining implementable social choice rules.
Games Econ. Behav., 2007

2006
Ensuring Pareto Optimality by Referendum Voting.
Soc. Choice Welf., 2006

Nash implementation via hyperfunctions.
Soc. Choice Welf., 2006

2005
Minimal monotonic extensions of scoring rules.
Soc. Choice Welf., 2005

Implementing matching rules by type pretension mechanisms.
Math. Soc. Sci., 2005

2004
Strong equilibrium outcomes of voting games ¶are the generalized Condorcet winners.
Soc. Choice Welf., 2004

2003
Sets of alternatives as Condorcet winners.
Soc. Choice Welf., 2003

2002
Scoring rules cannot respect majority in choice and elimination simultaneously.
Math. Soc. Sci., 2002


  Loading...