Pages that link to "Item:Q1352298"
From MaRDI portal
The following pages link to Distributed computation of Pareto solutions in \(n\)-player games (Q1352298):
Displaying 13 items.
- Parallelization of game theoretic centrality algorithms (Q301779) (← links)
- Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation (Q323444) (← links)
- Analysis of the constraint proposal method for two-party negotiations (Q877065) (← links)
- Distributed algorithms for the computation of noncooperative equilibria (Q1090263) (← links)
- Comment on a decision support approach for negotiation: Software vs. methodology (Q1278480) (← links)
- Decentralized method for computing Pareto solutions in multiparty negotiations (Q1806945) (← links)
- A distributed computation algorithm for solving portfolio problems with integer variables (Q2462177) (← links)
- Development and analysis of high performance parallel algorithms for solving cooperative games (Q2888216) (← links)
- (Q2951637) (← links)
- Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
- Achieving Pareto Optimality Through Distributed Learning (Q5173260) (← links)
- Searching for joint gains in multi-party negotiations. (Q5932023) (← links)
- Constraint proposal method for computing Pareto solutions in multi-party negotiations (Q5943557) (← links)