نتایج جستجو برای: recourse curse

تعداد نتایج: 7662  

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2022

Algorithmic fairness is typically studied from the perspective of predictions. Instead, here we investigate recourse actions suggested to individuals remedy an unfavourable classification. We propose two new fair-ness criteria at group and individual level, which—unlike prior work on equalising average group-wise distance decision boundary—explicitly account for causal relationships between fea...

Journal: :CoRR 2017
Anupam Gupta Guru Guruganesh Amit Kumar David Wajc

We consider the bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. The objective here is to obtain algorithms achieving low asymptotic competitive ratio while changing the packing sparingly between updates. We associate with each item i a movement cost ci ≥ 0. We wish to achieve good approximation guarantees while incurring a movement cost of β ...

Journal: :CoRR 2016
João Pedro Pedroso Shiro Ikeda

This paper addresses the problem of maximizing the expected size of a matching in the case of unreliable vertices and/or edges. The assumption is that upon failure, remaining vertices that have not been matched may be subject to a new assignment. This process may be repeated a given number of times, and the objective is to end with the overall maximum number of matched vertices. The origin of t...

2017
Weijun Xie Shabbir Ahmed Maarten van der Vlerk

The simple integer recourse (SIR) function of a decision variable is the expectation of the integer roundup of the shortage/surplus between a random variable with a known distribution and the decision variable. It is the integer analogue of the simple (continuous) recourse function in two stage stochastic linear programming. Structural properties and approximations of SIR functions have been ex...

1999
Z. L. CHEN

We propose an algorithm for multistage stochastic linear programs with recourse where random quantities in different stages are independent. The algorithm approximates successively expected recourse functions by building up valid cutting planes to support these functions from below. In each iteration, for the expected recourse function in each stage, one cutting plane is generated using the dua...

Journal: :Foundations and Trends in Microeconomics 2011
Robert T. Deacon

This survey focuses on political economy theories of the resource curse and scrutinizes how well, or poorly, these theories have been integrated with empirical work. One reason why this integration is important lies in the practical importance of pinning down the causal links involved in the resource curse. A second reason for focusing on integration of theory and empirics is that the resource ...

Journal: :Journal of Chemical Education 1991

Journal: :Mathematical Programming 2021

We consider nonlinear multistage stochastic optimization problems in the spaces of integrable functions. allow for dynamics and general objective functionals, including dynamic risk measures. study causal operators describing system derive Clarke subdifferential a penalty function involving such operators. Then we introduce concept subregular recourse establish subregularity resulting systems t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید