Pages that link to "Item:Q925820"
From MaRDI portal
The following pages link to To be fair or efficient or a bit of both (Q925820):
Displaying 17 items.
- Inequity averse optimization in operational research (Q319581) (← links)
- Levels of incomplete information in group decision models -- a comprehensive simulation study (Q337125) (← links)
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints (Q367165) (← links)
- An information-theoretic characterization of weighted \(\alpha \)-proportional fairness in network resource allocation (Q433054) (← links)
- Fair division of indivisible items between two players: design parameters for contested pile methods (Q483924) (← links)
- Fair allocation using a fast smart market auction (Q818107) (← links)
- Unifying view on min-max fairness, max-min fairness, and utility optimization in cellular networks (Q933971) (← links)
- A general branch-and-bound algorithm for fair division problems (Q991365) (← links)
- An approximation algorithm for the facility location problem with lexicographic minimax objective (Q2336537) (← links)
- Fair optimization and networks: a survey (Q2336590) (← links)
- Turnpike theorem for terminal functionals in infinite horizon optimal control problems (Q2348520) (← links)
- Development and calibration of a currency trading strategy using global optimization (Q2392749) (← links)
- Generalized Nash bargaining solution for bandwidth allocation (Q2432666) (← links)
- Lexicographic maximin optimisation for fair bandwidth allocation in computer networks (Q2455638) (← links)
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation (Q2664297) (← links)
- Derivative-free optimization and neural networks for robust regression (Q3145056) (← links)
- String-averaging incremental stochastic subgradient algorithms (Q4631774) (← links)
