In this paper we present potential advantages of an algorithmic approach in legal dispute resolution, introducing the CREA project with its objectives and methods. We describe a model that represents legal disputes by constraints satisfaction problems and two algorithmic strategies to solve them (Nash allocation and Egalitarian Equitative Allocation), focusing on inheritance disputes category. This approach is radically innovative because it helps lawyers and judges to set the legal procedure not as a parties’ dispute but as a process aiming to consensual agreement. We also report the experimental results to prove the effectiveness of our approach, considering a concrete legal case dispute. © Springer Nature Switzerland AG 2020.
Equitative Algorithms for Legal Conflict Resolution / Amato, Flora; Cozzolino, Giovanni; Giacalone, Marco. - 96:(2020), pp. 589-597. [10.1007/978-3-030-33509-0_55]
Equitative Algorithms for Legal Conflict Resolution
Amato Flora;Cozzolino Giovanni;Giacalone Marco
2020
Abstract
In this paper we present potential advantages of an algorithmic approach in legal dispute resolution, introducing the CREA project with its objectives and methods. We describe a model that represents legal disputes by constraints satisfaction problems and two algorithmic strategies to solve them (Nash allocation and Egalitarian Equitative Allocation), focusing on inheritance disputes category. This approach is radically innovative because it helps lawyers and judges to set the legal procedure not as a parties’ dispute but as a process aiming to consensual agreement. We also report the experimental results to prove the effectiveness of our approach, considering a concrete legal case dispute. © Springer Nature Switzerland AG 2020.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
