Q1. What have the authors contributed in "A participatory budget model under uncertainty" ?
In this paper, the authors propose a model for participatory budgeting under uncertainty based on stochastic programming.
Did you find this useful? Give us your feedback
93 citations
...Theoretical studies have focused on communication, deliberation, and decision making [5], modeling under uncertainty [6], designing general frameworks [7], and experimental solutions [8], [9], but most of these existing solutions only consider support for administrative tasks related to PBs, rather than the actual decisionmaking process....
[...]
15 citations
13 citations
10 citations
2,477 citations
...Two clasic versions of chance-constrained problems are the individual chance onstraints (Charnes & Cooper, 1959; Wets, 1989) and the joint chance onstraints (Miller & Warner, 1965), which we adopt here: we place a ower bound β on the probability that each stochastic constraint will e jointly…...
[...]
1,863 citations
1,709 citations
...BIM under uncertainty BIM is an iterative multilateral negotiation support method, based n the discrete balanced increment solution, see Raiffa et al. (2002). tarting from the disagreement point d, the method iteratively ofers (Kalai & Smorodinsky, 1975) solutions to participants....
[...]
836 citations
...We assume that we may model each participant’s preferences hrough a multiattribute utility function uj, j = 1, . . . , n, whose xpected value should be maximized, see e.g. French (1986)....
[...]
654 citations
...For a general discussion on the role of uncertainty in negotiations see Raiffa, Richardson, and Metcalfe (2002), Neale and Fragale (2006) or Moon, Yao, and Park (2011)....
[...]
...BIM under uncertainty BIM is an iterative multilateral negotiation support method, based n the discrete balanced increment solution, see Raiffa et al. (2002). tarting from the disagreement point d, the method iteratively ofers (Kalai & Smorodinsky, 1975) solutions to participants....
[...]
...…Calculate bt = bt−1 − Ct ; xt = B−1(S, bt) and K̂t = K(S, xt); if K̂t = K̂t−1 then Offer alternative associated with K̂t ; ethod assumes an initial inefficient solution and suggests at each teration, as new solution, a Pareto improvement with respect to the revious offer, see Raiffa et al. (2002)....
[...]