A model for multi-party negotiations with majority rule

被引:0
|
作者
Zhang, S [1 ]
Makedon, F [1 ]
Ford, J [1 ]
Ai, L [1 ]
机构
[1] Dartmouth Coll, Dept Comp Sci, Hanover, NH 03755 USA
来源
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Our model of multi-party negotiations is a many parties, many issues model. The whole multi-party negotiation consists of a set of mutually influencing bilateral negotiations that are focused on different bilateral issues. We propose to use majority rule to help parties reach group agreements. When a party is not satisfied with another party's negotiation progress, he can send a primitive oppose to the other. Those negotiation parties who get a sufficient number of oppose primitives from others or those negotiation parties who lack support in opposing others will be warned to make satisfactory concessions in the following negotiation round. So the will of majority affects each party's negotiation behavior and leads to the final group agreement.
引用
收藏
页码:228 / 237
页数:10
相关论文
共 50 条
  • [1] After the age of majority? Multi-party governance and the Westminster model
    Paun, Akash
    [J]. COMMONWEALTH & COMPARATIVE POLITICS, 2011, 49 (04) : 440 - 456
  • [2] Searching for joint gains in multi-party negotiations
    Ehtamo, H
    Kettunen, E
    Hämäläinen, RP
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 130 (01) : 54 - 69
  • [3] An attributional account of power in multi-party negotiations
    Trif, Sabina
    Curseu, Petru Lucian
    Fodor, Oana Catalina
    Flestea, Alina Maria
    [J]. INTERNATIONAL JOURNAL OF CONFLICT MANAGEMENT, 2020, 31 (05) : 821 - 842
  • [4] Round efficiency of multi-party computation with a dishonest majority
    Katz, J
    Ostrovsky, R
    Smith, A
    [J]. ADVANCES IN CRYPTOLOGY-EUROCRYPT 2003, 2003, 2656 : 578 - 595
  • [5] Adaptively Secure Multi-Party Computation with Dishonest Majority
    Garg, Sanjam
    Sahai, Amit
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2012, 2012, 7417 : 105 - 123
  • [6] Secure Multi-party Quantum Computation with a Dishonest Majority
    Dulek, Yfke
    Grilo, Alex B.
    Jeffery, Stacey
    Majenz, Christian
    Schaffner, Christian
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2020, PT III, 2020, 12107 : 729 - 758
  • [7] Dishonest Majority Multi-Party Computation for Binary Circuits
    Larraia, Enrique
    Orsini, Emmanuela
    Smart, Nigel P.
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2014, PT II, 2014, 8617 : 495 - 512
  • [8] Phases, transitions and interruptions: Modeling processes in multi-party negotiations
    Olekalns, M
    Brett, JM
    Weingart, LR
    [J]. INTERNATIONAL JOURNAL OF CONFLICT MANAGEMENT, 2003, 14 (03) : 191 - 211
  • [9] Complete Fairness in Multi-party Computation without an Honest Majority
    Gordon, S. Dov
    Katz, Jonathan
    [J]. THEORY OF CRYPTOGRAPHY, 6TH THEORY OF CRYPTOGRAPHY CONFERENCE, TCC 2009, 2009, 5444 : 19 - 35
  • [10] Multi-party e-negotiations: Agents, alliances, and negotiation success
    Kurtzberg, Terri R.
    Dunn-Jensen, Linda M.
    Matsibekker, Crystal L. Z.
    [J]. INTERNATIONAL JOURNAL OF CONFLICT MANAGEMENT, 2005, 16 (03) : 245 - 264