<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Alternative Cross-Border Dispute Resolutions, from the Past to New Computational Methods (IT Realities)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Marco Giacalone</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>PhD Candidate in Legal logic and Legal Informatics Università degli Studi di Napoli Federico II Corso Umberto I</institution>
          ,
          <addr-line>80133 Napoli</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Prof. Francesco Romeo (Naples University, Italy) Prof. Francesco Gambino (Macerata University, Italy) Prof. Frank Fleerackers (KU Leuven University, Belgium) Prof. Alain Laurent Verbeke (KU Leuven University</institution>
          ,
          <addr-line>Belgium) Prof. Wojciech Załuski</addr-line>
          ,
          <institution>Jagiellonian University</institution>
          ,
          <country country="PL">Poland</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>At present, legal proceedings are often delayed, expensive, and characterized by unforeseeable decisions. In this context my objective would be to reduce obstacles to the good functioning of civil proceedings, especially the cross-border ones, by enforcing a method that could improve civil proceedings by means of a new procedure in certain areas of civil law, such as successions and trust, matrimonial regimes, property and lease, company law and consumer law.</p>
      </abstract>
      <kwd-group>
        <kwd>Alternative Dispute Resolution</kwd>
        <kwd>ADR</kwd>
        <kwd>Online Dispute Resolution</kwd>
        <kwd>ODR</kwd>
        <kwd>Cross-border Disputes</kwd>
        <kwd>Equity</kwd>
        <kwd>Game Theory</kwd>
        <kwd>Fair Division</kwd>
        <kwd>Algorithmical tools</kwd>
        <kwd>Adjusted Winner</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Supervisors:</p>
      <p>Nowadays, there are too many obstacles to the good functioning of
crossborder civil proceedings in the EU Member States.</p>
      <p>First of all, these proceedings take a long time, both to establish them and to
obtain a decision, also due to identify and to reach the judge having competence,
to translate the summon and the other relevant acts in a language comprehensible
to the addressee.</p>
      <p>Secondly, cross-border civil proceedings are too expensive for citizens owing
to high costs both for documents’ translation and for consulting excellent legal
experts.</p>
      <p>In addition, another obstacle, that citizens have to face to obtain an effective
access to justice in cross-border claims, consists in very divergent interpretations,
deriving from each national court, even if they apply EU rules. So there is a real
need to reach, to the extent possible, foreseeable decisions, especially in consumer
disputes.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Objective of the research</title>
    </sec>
    <sec id="sec-3">
      <title>Background</title>
      <p>In the field of ADR there are too many methods, which are not well used or
developed as much as it could be done.</p>
      <p>Nowadays a good amount of disputes could be solved applying several “games”
for a fair solution for the parties involved.</p>
      <p>One of them, as experienced in USA (law and economics), is the patented
algorithm “Adjusted-winner” (patented by Steven J. Brams and Alan Taylor on the
9th of November 1999, Patent Number: 5983205).</p>
      <p>Fair Division Theory originated in mathematics, and then became a proper branch
in the modern social sciences in 1996 with the publication of the book “Fair Division”
by S. J. Brams and A. D. Taylor. The recent years have witnessed an increasing
interest by the international scientific community, testified by a large number of
publications in the field.</p>
      <p>I would review existing frameworks and definitions related to fair division and I
would provide an updated review of the most important theoretical results, together
with a survey of existing procedures and computer algorithms in fair division.
4</p>
    </sec>
    <sec id="sec-4">
      <title>An Example</title>
      <p>As an example to put into practice an algorithm to solve a dispute: “Suppose
Francesco and Paola are dividing three goods between them: A, B, and C. They
indicate how much they value obtaining the different goods, by distributing 100
points across them. Assume that Francesco assigns 6 points to good A, 67 points to
good B and 27 points to C, while Paola values the goods 5, 34 and 61, respectively”.</p>
      <sec id="sec-4-1">
        <title>Input Preferences</title>
        <p>ITEMS
Item 1
Item 2
Item 3
Total</p>
        <p>equitable (Francesco and Paola both believe that their portion is valued
the same as the other player’s) and
efficient (there is no allocation that is strictly better for Francesco – or
Paola – and as good for Paola – or Francesco).</p>
      </sec>
      <sec id="sec-4-2">
        <title>Initial Allocation</title>
        <p>ITEMS
Item 1
Item 2
Item 3
Francesco
6
67
0</p>
      </sec>
      <sec id="sec-4-3">
        <title>Francesco’s initial point total: 73 Paola’s initial point total: 61</title>
      </sec>
      <sec id="sec-4-4">
        <title>Adjustments</title>
        <p>Initially Francesco’s point total is greater, so we must transfer some goods to
Paola.</p>
        <p>Order the goods that Francesco initially receives according to their ratios
(x/y where Francesco receives x and Paola receives y) from smallest to
largest:
Item 1 with ratio 1.2
Item 2 with ratio 1.97
Transfer all of Item 1 to Paola. Francesco’s new point total is 67; and Paola’s
new point total is 66.</p>
        <p>To achieve equitability we must transfer part of Item 2 to Paola. Let p be the
portion of 2 that will be transferred to Paola. We must solve the following
equation for p</p>
        <p>67 - 67p = 66 + 34p
This yields p 0.01.</p>
      </sec>
      <sec id="sec-4-5">
        <title>Calculated point allocation</title>
        <p>ITEMS
Item 1
Item 2
Item 3
Francesco
0
66.34
0</p>
      </sec>
      <sec id="sec-4-6">
        <title>Total points assigned to each player: 66.34</title>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Hypotheses and Predictions</title>
      <p>How is it possible to solve a dispute in a quicker, cheaper and fairer way?
Is it possible to solve a dispute using some economic principles of Game theory?
Is it possible to have specific types of civil disputes a “win-win solution”?
In these cases is it possible to avoid the appointment of a judge or an arbiter, using
just an online program, based on economic algorithms?
Is it possible to use this online program to solve cross-border disputes?
The research is aimed to propose an innovative resolution method for cross-border
proceedings in Europe, facilitating an equitable dispute resolution.</p>
      <p>The project is based on the re-use and/or the development of algorithms on
equitable controversy resolution. Some of them were already patented in USA, others
are in the process of research, development or patent-pending.</p>
      <p>These algorithms will be applied taking account of the distinction between
available rights (droits disponibles) from national mandatory rules (loi de police), in
force in the different European Countries.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Project Outline</title>
      <p>To perform the above objectives, after having experienced these algorithms on
various samples, it might be advocated that the European Union should build a
platform where citizens will be able to solve disputes obtaining prompt and
foreseeable resolution.</p>
      <p>Moreover, in conformity with new Directive on alternative dispute resolution and
new Regulation on on-line dispute resolution (ODR), this study would provide
something new and different in the European context: the adoption of this online
procedure could facilitate a faster and cheaper dispute resolution based on parties’
agreement and, thereby, avoid difficult problems such as competence and applicable
law.</p>
      <p>The added value of this project would consist, in addition, in avoiding the recourse
to national courts by simplifying and solving disputes as fairly as possible: it will
exceed the differences due to national laws on the basis of an agreement among
parties, that should be favored and enforced.</p>
      <p>Furthermore, this platform could be connected to the planned “EU-wide dispute
resolution platform” and/or to the E-Justice Portal, encouraging the possibility of
adopting this algorithm both in solving the disputes (ex post), and in envisaging the
use of this procedure in negotiating various contracts or obligations (ex ante).</p>
    </sec>
    <sec id="sec-7">
      <title>Methodology</title>
      <p>First of all, the project will start with an overview on ADR nowadays utilized in
Europe to solve disputes out-of-courts.</p>
      <p>After that, the study will focus on cross-border litigations methodologies. In this
field it will be important to discern available rights from mandatory rules.</p>
      <p>Afterwards, I am confident that this point-allocation procedure, based on
economic fair “game theory”, could be practised in negotiations involving easily
specified issues or well-defined goods.</p>
      <p>Examples might include a dispute within a company over the division of job
responsibilities or the division of marital property in a divorce settlement.</p>
      <p>After an experimental phase I would develop, working with a specialized team, the
laboratory analysis and evidence needed to support the thesis exposed in this research
project, starting from the well known and developed experimental literature on this
subject.</p>
      <p>More in detail I would run two different experimental phases.</p>
      <p>PHASE 1 – Firstly, I would run a battery of experiments aimed at understanding
the different role both in terms of efficiency (measured in this setting by the time
needed to find a division agreement) and in terms of individual welfare (represented
by the absence of envy after the division) of the same “fair division rule” whether
proposed by a human being, like the judge, versus a computer.</p>
      <p>This would allow me to better characterize the potential of the application of an
algorithm to the resolution of this kind of problems.</p>
      <p>Phase 1 could include different treatments:
 in treatment 1 it could be tested just a simple ultimatum game (that is a
simple proposal of division that could be only accepted or refused) in the two
different framings described above;
 in treatment 2 it could be allowed for bargaining;
 in treatment 3 it could be allowed for cheap talking.</p>
      <p>Each of these treatments could be complicated by the introduction of different
information framings (human being with full information or under a veil of
ignorance).</p>
      <p>PHASE 2 – Once assessed the validity of automatic procedures in this setting I
would test, together with a teamwork, the characteristics again both in terms of
efficiency and individual welfare of the different algorithms proposed by game
theorists in order to assess if a possible ranking among them exists, also in case of
trade off between the two desired characteristics. This will be possibly obtained
comparing the different levels of truth-telling versus suspiciousness involved in the
bargaining procedure implied by each of them.</p>
      <p>If the envisage procedure works well, justified through the above
experimentations, it might be used in more complex disputes: a point-allocation
procedure could prove very useful in finding a settlement that mirrors the most salient
concerns of each party.</p>
      <p>In addition, I would suggest that the online platform mentioned above should be
built in order to have an easier, fairer, more efficient and more impartial output, from
which all citizens will benefit.
8</p>
    </sec>
    <sec id="sec-8">
      <title>Significance and Conclusion</title>
      <p>The project - concerning the use of electronic mathematical tools - would favour
practical solutions regarding actual difficulties in cross border proceedings.</p>
      <p>In conclusion, I would improve the use of ADR based on equity, applying game
theory’s algorithms.</p>
      <p>My main target is focused on the cross-border disputes where there are too many
problems to deal with, such as conflict of laws, applicable law, international private
law principles. I would recommend to use an economic method to solve these
disputes, avoiding competence and applicable law problems; obviously without
prejudice of mandatory rules of each European country.</p>
      <p>Hence, all EU citizens will be able to use this procedure, which will foster the
access to justice.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Betancourt</surname>
            <given-names>J.C.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Crook</surname>
            <given-names>J.: ADR</given-names>
          </string-name>
          ,
          <article-title>Arbitration and Mediation, a collection of essays</article-title>
          ,
          <source>AuthorHouse</source>
          ,
          <year>2014</year>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Blake</surname>
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Browne</surname>
            <given-names>J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Sime</surname>
            <given-names>S.</given-names>
          </string-name>
          :
          <source>The Jackson ADR Handbook</source>
          , Oxford University Press,
          <year>2013</year>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. Born G.:
          <source>International Arbitration: Law and Practice</source>
          , Wolters Kluwer International,
          <source>Law and Business</source>
          , 2012
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Brams</surname>
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Game Theory and the Humanities: Bridging Two Worlds</article-title>
          , MIT Press,
          <year>2011</year>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Brams</surname>
            <given-names>S.: The</given-names>
          </string-name>
          <string-name>
            <surname>Win-Win</surname>
            <given-names>Solution</given-names>
          </string-name>
          : Guaranteeing Fair Shares to Everybody, Norton &amp; Company, 2010
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Brams</surname>
            <given-names>S.: Fair</given-names>
          </string-name>
          <string-name>
            <surname>Division: From</surname>
          </string-name>
          Cake-Cutting to Dispute Resolution, Cambridge University Press,
          <year>1996</year>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Brams</surname>
            <given-names>S.</given-names>
          </string-name>
          : Mathematics and Democracy: Designing Better Voting and
          <string-name>
            <surname>Fair-Division</surname>
            <given-names>Procedures</given-names>
          </string-name>
          , Princeton University Press,
          <year>2008</year>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Ellickson R.C.</surname>
          </string-name>
          <article-title>: Order without Law, How neighbours settle disputes</article-title>
          , Harvard University Press,
          <year>1991</year>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Lodder</surname>
            <given-names>A</given-names>
          </string-name>
          and
          <string-name>
            <surname>Zeleznikow</surname>
            <given-names>J.</given-names>
          </string-name>
          :
          <source>Enhanced Dispute Resolution Through the Use of Information Technology</source>
          , Cambridge University Press,
          <year>2010</year>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Ossowski</surname>
            <given-names>S.</given-names>
          </string-name>
          : Agreement Technologies, Law,
          <source>Governance and Technology Series</source>
          , Vol.
          <volume>8</volume>
          , Springer 2013
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Plott</surname>
            <given-names>C.</given-names>
          </string-name>
          And
          <string-name>
            <surname>Smith</surname>
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Handbook of Experimental Economics Results</article-title>
          , Vol.
          <volume>1</volume>
          ,
          <string-name>
            <surname>Elsevier</surname>
          </string-name>
          ,
          <year>2008</year>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Poblet</surname>
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Mobile Technologies for Conflict Management</article-title>
          , Law,
          <source>Governance and Technology Series</source>
          , Vol.
          <volume>2</volume>
          , Springer 2011
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Zaluski</surname>
            <given-names>W.</given-names>
          </string-name>
          : Game Theory in Jurisprudence, Copernicus Center Press,
          <year>2014</year>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>