The following pages link to Michele Lombardi (Q343140):
Displayed 47 items.
- Feasible sets, comparative risk aversion, and comparative uncertainty aversion in bargaining (Q343141) (← links)
- A full characterization of Nash implementation with strategy space reduction (Q372374) (← links)
- A min-flow algorithm for minimal critical set detection in resource constrained project scheduling (Q456733) (← links)
- CROSS cyclic resource-constrained scheduling solver (Q490449) (← links)
- Empirical decision model learning (Q511793) (← links)
- Uncovered bargaining solutions (Q532700) (← links)
- Optimal resource allocation and scheduling for the CELL BE platform (Q545538) (← links)
- Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip (Q707694) (← links)
- Minimal covering set solutions (Q733808) (← links)
- Allocation and scheduling of conditional task graphs (Q969530) (← links)
- What kind of preference maximization does the weak axiom of revealed non-inferiority characterize? (Q975942) (← links)
- Alternative characterizations of the proportional solution for nonconvex bargaining problems with claims (Q988673) (← links)
- Reason-based choice correspondences (Q1005763) (← links)
- Uncovered set choice rules (Q1024770) (← links)
- Off-line and on-line optimization under uncertainty: a case study on energy management (Q1626713) (← links)
- Model agnostic solution of CSPs via deep learning: a preliminary study (Q1626734) (← links)
- Natural implementation with semi-responsible agents in pure exchange economies (Q1684127) (← links)
- How efficient is a global constraint in practice? A fair experimental framework (Q1706598) (← links)
- Treading a fine line: (im)possibilities for Nash implementation with partially-honest individuals (Q1792573) (← links)
- Nash implementation via simple stochastic mechanisms: strategy space reduction (Q1929138) (← links)
- Implementation in largest consistent set via rights structures (Q2031197) (← links)
- Injecting domain knowledge in neural networks: a controlled experiment on a constrained problem (Q2117227) (← links)
- Hybrid offline/online optimization for energy management via reinforcement learning (Q2170215) (← links)
- Closure under interim utility equivalence implies two-agent Bayesian implementation (Q2173392) (← links)
- Partially-honest Nash implementation: a full characterization (Q2206010) (← links)
- Do coalitions matter in designing institutions? (Q2288521) (← links)
- Fair social decision under uncertainty and belief disagreements (Q2323613) (← links)
- Constrained implementation (Q2324814) (← links)
- A sampling-free anticipatory algorithm for the kidney exchange problem (Q2327246) (← links)
- Implementation in partial equilibrium (Q2397627) (← links)
- A Lagrangian propagator for artificial neural networks in constraint programming (Q2398510) (← links)
- One-step-ahead implementation (Q2425196) (← links)
- Continuous virtual implementation: complete information (Q2668986) (← links)
- Non-linear Optimization of Business Models in the Electricity Market (Q2815097) (← links)
- Treading a Fine Line: Characterisations and Impossibilities for Liberal Principles in Infinitely-Lived Societies (Q2867502) (← links)
- Precedence Constraint Posting for Cyclic Scheduling Problems (Q3003283) (← links)
- Scheduling Conditional Task Graphs (Q3523074) (← links)
- Integrated Offline and Online Decision Making under Uncertainty (Q5145836) (← links)
- Robust Scheduling of Task Graphs under Execution Time Uncertainty (Q5274273) (← links)
- Multi-stage Benders Decomposition for Optimizing Multicore Architectures (Q5387619) (← links)
- Disregarding Duration Uncertainty in Partial Order Schedules? Yes, We Can! (Q5418735) (← links)
- Embedding Decision Trees and Random Forests in Constraint Programming (Q5741458) (← links)
- Understanding the Potential of Propagators (Q5741483) (← links)
- Behavioral strong implementation (Q6063107) (← links)
- An alternative equivalent formulation for robust implementation (Q6148388) (← links)
- Implementation in strong core by codes of rights (Q6168805) (← links)
- Designing rotation programs: limits and possibilities (Q6188667) (← links)