Theoretical and computational study of several linearisation
techniques for Binary Quadratic Problems. Fabio Furini1 and Emiliano Traversi2. 1 PSL Université Paris Dauphine
Theoretical and computational study of several linearisation
techniques for Binary Quadratic Problems. Fabio Furini1 and Emiliano Traversi2. 1 PSL Université Paris Dauphine
FINANCE SUMMER SCHOOLS - Paris
QUICKFIRE QUESTIONS. WHAT IS UNIVERSITÉ PARIS DAUPHINE - PSL. LONDON CAMPUS? We are part of Université Paris Dauphine -. PSL
S2- Syllabus -2019- Economic Developent - Marta Menendez
Exams are collected at the end of examination periods. Academic integrity. Be aware of the rules in Université Paris Dauphine about plagiarism and cheating
The bang-bang property in some parabolic bilinear optimal control
08-Nov-2021 properties of optimisation problems bang-bang property
Qualitative analysis of optimisation problems with respect to non
12-Oct-2021 ?CEREMADE UMR CNRS 7534
Local Envy-Freeness in House Allocation Problems
Université Paris-Dauphine PSL
DISTANCE TRANSFORMATION FOR NETWORK DESIGN
of network design problems with given connectivity requirements. ?Université Paris-Dauphine Place du Maréchal De Lattre de Tassigny
Recovering non-monotonicity problems of voting rules
13-Jul-2020 Université Paris-Dauphine Université PSL
Simultaneous Elicitation of Scoring Rule and Agent Preferences for
18-Oct-2021 1 Université Paris-Dauphine Université PSL
Vol.:(0123456789)
Social Choice and Welfare (2021) 56:125-141
1 3ORIGINALPAPER
Recovering non-monotonicity problems ofPvoting rulesUmutffKeskin
1 ff·M.ffRemziffSanver 2 ff·H.ffBerkayffTosunlu 2 Received: 7 November 2019 / Accepted: 30 June 2020 / Published online: 13 July 2020 © Springer-Verlag GmbH Germany, part of Springer Nature 2020Abstract
arunofiandsingletransferablevote.Wede netheminimalmonotonicextensionof thepossibilityofre ningthemwithoutviolatingmonotonicityprovidedthatthis re nementdoesnotdivergefromtheoriginalSCRmorethanthedivergencepre scribedbytheminimalmonotonicextensionitself.Wecallthesere nementsmono general ndings,weconsiderpluralitywitharunofi,characterizeitsminimalmonoasamonotonicsubstitutetopluralitywitharunofi.Our work is partly supported by the projects ANR-14-CE24-0007-01 CoCoRICo-CoDec and IDEX
ANR-10-IDEX-0001-02 PSL* MIFID, as well as the LAMSADE internal project programme. The main ndings of this paper were discovered when H. Berkay Tosunlu was a masters student in economics at stanbul Bilgi University. We thank Jerome Lang, Vincent Merlin, Hervé Moulin and participants of the Dagstuhl Seminar 19381 on Application-Oriented Computational Social Choice for useful comments and discussions. The paper extensively beneted from the thoughtful comments of two anonymous reviewers and the anonymous associate editor to whom we are grateful. *M.RemziSanver remzi.sanver@dauphine.fr 1 2126 U.Keskin et al.
1 3 1Introduction
Monotonicity conditions imposed over social choice rules (SCRs) elaborate the idea that whenever one or more voters change their preferences in a certain direction", the collective choice must also move towards a similar direction". Depending on the precise meaning attributed to the two concepts within quotation marks, the lit erature admits a variety of monotonicity conditions, most of which have a normative appeal that rests on strategic concerns. These conditions are usually strong, the central example being the one identied by Maskin ( 1999) as a necessary (but not sucient) condition for Nash implementa tion. For resolute SCRs, Maskin monotonicity coincides with strong positive asso ciation which Muller and Satterthwaite ( 1977
) show to be equivalent to strategy- proofness. Hence, by Gibbard ( 1973
) and Satterthwaite ( 1975
), only dictatorial or imposed resolute SCRs are Maskin monotonic. When resoluteness is not required, the class of Maskin monotonic SCRs expands but, as Jackson (2001) discusses, still excludes most of the interesting SCRs, such as scoring rules and Condorcet extensions. There are three other prominent monotonicity conditions that can be expressed with reference to Maskin monotonicity: Danilov (1992) monotonicity characterizes Nash implementable SCRs, hence is stronger than Maskin monotonicity. Condition alpha (Abreu and Sen (1990)) replaces Maskin monotonicity when the target is implementation via subgame perfect equilibria. Condition alpha is con siderably weaker than Maskin monotonicity. As Nunez and Sanver (2018) show, it is satised by several Condorcet extensions while failed by scoring rules. One-way monotonicity is suggested by Sanver and Zwicker (2009) as a weaker form of strategy-proofness. It is also weaker than Maskin monotonicity, indeed satised by scoring rules while failed by Condorcet extensions. A monotonicity condition whose normative appeal is independent of any strategic concern is simple monotonicity 1 which asserts that raising a single alternative in vot ers" preferences while leaving the rankings otherwise unchanged is never detrimen tal to the prospects for winning of the raised alternative. 2
Throughout the paper we
refer to simple monotonicity as monotonicity. Monotonicity is rather weak and satis ed by most voting rules of the literature. However, it discriminates against scoring 1Simple monotonicity is perhaps the oldest known monotonicity condition in the literature. It has been
expressed under di erent names during its relatively long history that predates modern social choice the
ory. For a comprehensive account, see Black etal. ( 1958), Brams and Fishburn ( 2002
) and comments on page 120 of Fishburn ( 1982
2 The condition has a slightly stronger version which additionally requires that no new alternative is
added to the chosen set. We chose to analyze the weaker version for reasons we discuss in Footnote 11.
1271 3
Recovering non
monotonicity problems of voting rules andsingletransferablevote(Smith 19733 4 Given
Lepelleyet al.(
19965 totheirmonotonicsupercorrespondences. 6
TheSCRthatpickseveryalternativeat
P and fi where an alternative x ofsimplemonotonicity.SupposeanSCR F picks x at P butnotat F . In order to transform FintoamonotonicSCRwithoutdiscardinganyoftheoriginallychosen F . Such an analysis must be made for all pairs of preference proles. Moreover, the added alternatives must also sat isfy the requirements of monotonicity. Thus, transforming F intoamonotonicSCR mustcontain. 7 3An early discussion of other monotonicity failures is given by Fishburn (1982) while a more recent and
comprehensive account can be found in Felsenthal and Nurmi ( 20174 See Doron and Kronick (1977) for arguments against using non-monotonic SCRs. 5
These instances, expressed by their Propositions 1 and 3, are special cases of the general characteriza-
tion we give in our Theorem5.1. 6 Our approach is similar to the approach in Sen (1995) for Maskin monotonicity. 7 Caragiannis etal. (2014) characterize what they call the approximation with the least approxima-tion ratio" for the non-monotonic Dodgson"s voting rule and this corresponds to the minimal monotonic
extension as we dene here.128 U.Keskin et al.
1 3 itself.Wecalltheserefinements monotonic adjustments andidentifyconditionsover atleast x andsomeother y at fi . Now, suppose we need to make a singleton choice at F while x iskeptat P andmonotonicityispreserved.Inevitably, x willbethe uniquechoice,hencediscarding y ,at F . In case the choice of xatPisadmissible andmonotonicityisadopted,thechoiceofxat is well-justied. 8On the other
hand, it is not obvious that such distortions of F willyieldamonotonicSCR.Our F F isminimallydistorted. Section 2presentsthebasicnotionsandnotation.Section 3introducesthecon- sionmustcontain.Section 4introducestheconceptofmonotonicadjustmentand adjustment.Section 5givesanapplicationofthesegeneralfindingstoplurality 6 concludes. 2Basic notions andFnotation
Throughoutthepaper,foragivenset
X 2 denotes the power set of X and denotes the cardinality of X.ConsiderasocietyNwith t ≻x≻w confronting a set of alternativesAwith z ≻tt . Each voter≻F has a preference(̃={ where
L A )isthesetoflinearordersoverA. 9WewriteF(P∪R)
Q for a (preference) proPle.A social choice rule(SCR)isamapping
FF .Wemayoccasion-̃F ?
, hence as a mappingFFF̃
Givenanydistinct
FFF F ,wesaythat̃ F is an improvement forF̃ with respect to Piff F F FFFFF and yF
zF y∈ x z1)1() . Note that the distinctness of Pand(
R implies the exist ence of some x∈F for whom y, xandx? F yforsome(?)?= . We write IMP 2 xA∈xA
x withrespectto 9SopreciselyoneofxP
R yandy, xholdsforanydistinct∈?(2) while x? xfailsforallF(P .Moreover,
x y and y z implies x y R z forall?11y. 8 We further address this point in Sect.4. We thank an anonymous referee for raising the issue. 1291 3
Recovering non
monotonicity problems of voting rules P . When ′ fi is an improvement for x with respect to P , we equivalently say that P is a worsening for x with respect to F and let WOR F be the set of proles which are worsenings for x with respect to FAn SCR
2 ?? t is called monotonic if and only if given any ≻xwy , any ≻ztw and any ≻ t w IMP FP , we have (̃)=
10In case F
is dened over a restricted domain D , the condition would require both P and F belong to D Although quite desirable, not every SCR is monotonic. The next section suggests a solution to monotonicity violations. 3 Monotonic extensions: denition and̃characterizationGiven two SCRs
F , .FPR F̃ , we say that G is an extension of F if and only ifF P?FR P? FF
, which we write as ̃F . When G is also mono- tonic, we call it a monotonicextension of F . We writeFF̃ to denote the set of all
monotonic extensions of F . Note thatFF̃ is non-empty for any SCR F, as the SCR
FF F̃
is a monotonic extension of every FGiven any two SCRs
F and G withFFFF for all FF
, we dene the SCR ∈x as (?)(?) 1()= . We rst show that the inter- section of any two monotonic SCRs is also monotonic.Proposition 3.1
LetF,fi
x∈F(P) R P betwoSCRswithF(P)R=?∅ for all ?2 . If F and G are both monotonic, then x∈A is also monotonic. Proof Let F and G be as in the statement of the proposition. Take any any ?2 and any ? F P? R ( As ≠{}=( implies y?R and1yx while F and G are both monotonic, we have ≠{}
( and x?R implying 2R , establishing that ∈x is monotonic. (Among all the monotonic extensions of a given SCR
F , we are mainly interested in the smallest with respect to set inclusion. We dene the minimalmonotonicexten sion of F as the SCR {y P 1{ } . As A and N are both nite, so is {x?P . There- fore, since2? is well-dened for any F(P∀z∈R∖ , so is , . Also, monotonicity
of R follows from nitely many applications of Proposition 3.1 and, by construction, within ∈x(P , ? is minimal with respect to set inclusion. 11 Remark that while (x( in general, we have ,≥, if and only if F is monotonic. Let y give the divergence between ? and F. Note that z is an SCR dened over the domain , z 10 The stronger version which we mention in Footnote 2 would additionally impose ?F PR(?FR.
11 Our conclusion on the existence of a unique minimal monotonic extension would not be valid under the stronger version of monotonicity expressed in Footnote 10, as the non-emptiness of ??P? could not be ensured. We thank David Pennock for raising this issue.130 U.Keskin et al.
1 3 minimalmonotonicextensionscontain.TheoremP 3.1
Given any SCR F
fĩ F? , and any if and only if there exists t w WOR x w such that z≻tw t ProofToshowthe"if"part,takeanySCRF,anyF(P)R=
Q , any ̃FPRQ and any WORquotesdbs_dbs25.pdfusesText_31[PDF] Ocho participantes del BOmm 2017 estarán en el mercado de
[PDF] bon de commande - Corsica Ferries
[PDF] BREVET D 'ÉTUDES PROFESSIONNELLES option cuisine épreuve
[PDF] Bon de commande - ECPA
[PDF] Chorus Portail Pro 2017 - Communauté Chorus Pro
[PDF] Prestations sur bon de commandes
[PDF] La bonne utilisation de l 'e-mail dans l 'entreprise - Medef
[PDF] Guide de bon usage de la messagerie électronique - Thales Group
[PDF] les aides financières individuelles aux familles - Caf
[PDF] Une aide ? votre portée - Afe
[PDF] guide de la retraite 2016 dans la fonction publique d 'état - Solidaires
[PDF] dictionnaire fang - français français - fang - (DDL), Lyon
[PDF] Bonjour Vietnam - MCFV
[PDF] Les mails d 'accompagnement - Université Rennes 2