The social construction of gender relation reality: an analysis of time management applied on sustainable bamboo forestry among families in Ngadha, East Nusa Tenggara, Indonesia

Gender discourse in Indonesia is currently developing very rapidly. On one hand, gender activists have focused on gender mainstreaming. On the other hand, the socio-cultural reality in Indonesia persists with the old traditional construction of power relations between men and women. Feminists fight for justice and inclusiveness for women. However, their struggle must be confronted with the fact that the prevailing socio-cultural norms still tend to be male-dominant. This paper will reveal how the social reality of power relations in the realm of gender is constructed in rural areas in Indonesia. The subjects studied are families at the clan level who are managing sustainable bamboo forestry in Ngadha Regency, East Nusa Tenggara, Indonesia. The research was conducted in 2019-2021. The methods used are participatory rural appraisal (PRA), in-depth interviews, and observation as participants. Time allocation is used as the object of this study to create gender mapping. The analysis is carried out using a social construction theory. This study concluded that the clan of Neguwulacan adopt the HBL system. This is reflected in the emergence of local initiatives to manage finances, the workforce, groups, as well as build and implement them at the clan level. The gender relations that exist in SBF practice at the clan of Neguwula are relative. First, in terms of family lines, women obtain benefits because could hold matrilineal law. Political decisions remain in the hands of women. Second, practically speaking, women work twice as much in domestic and commercial work. Third, in some cases, deliberation is put forward for a fair division of labor. At this point, inclusiveness emerges as a reality that colors gender relations.

Constraints in fair division

The fair allocation of resources to interested agents is a fundamental problem in society. While the majority of the fair division literature assumes that all allocations are feasible, in practice there are often constraints on the allocation that can be chosen. In this survey, we discuss fairness guarantees for both divisible (cake cutting) and indivisible resources under several common types of constraints, including connectivity, cardinality, matroid, geometric, separation, budget, and conflict constraints. We also outline a number of open questions and directions.

Computing Large Market Equilibria Using Abstractions

Computing market equilibria is an important practical problem for market design, for example, in fair division of items. However, computing equilibria requires large amounts of information, often the valuation of every buyer for every item, and computing power. In “Computing Large Market Equilibria Using Abstractions,” the authors study abstraction methods for ameliorating these issues. The basic abstraction idea is as follows. First, construct a coarsened abstraction of a given market, then solve for the equilibrium in the abstraction, and finally, lift the prices and allocations back to the original market. The authors show theoretical guarantees on the solution quality obtained via this approach. Then, two abstraction methods of interest for practitioners are introduced: (1) filling in unknown valuations using techniques from matrix completion and (2) reducing the problem size by aggregating groups of buyers/items into smaller numbers of representative buyers/items and solving for equilibrium in this coarsened market.

Weighted Envy-freeness in Indivisible Item Allocation

We introduce and analyze new envy-based fairness concepts for agents with weights that quantify their entitlements in the allocation of indivisible items. We propose two variants of weighted envy-freeness up to one item (WEF1): strong , where envy can be eliminated by removing an item from the envied agent’s bundle, and weak , where envy can be eliminated either by removing an item (as in the strong version) or by replicating an item from the envied agent’s bundle in the envying agent’s bundle. We show that for additive valuations, an allocation that is both Pareto optimal and strongly WEF1 always exists and can be computed in pseudo-polynomial time; moreover, an allocation that maximizes the weighted Nash social welfare may not be strongly WEF1, but it always satisfies the weak version of the property. Moreover, we establish that a generalization of the round-robin picking sequence algorithm produces in polynomial time a strongly WEF1 allocation for an arbitrary number of agents; for two agents, we can efficiently achieve both strong WEF1 and Pareto optimality by adapting the adjusted winner procedure. Our work highlights several aspects in which weighted fair division is richer and more challenging than its unweighted counterpart.

Fair algorithms for selecting citizens’ assemblies

Globally, there has been a recent surge in ‘citizens’ assemblies’1, which are a form of civic participation in which a panel of randomly selected constituents contributes to questions of policy. The random process for selecting this panel should satisfy two properties. First, it must produce a panel that is representative of the population. Second, in the spirit of democratic equality, individuals would ideally be selected to serve on this panel with equal probability2,3. However, in practice these desiderata are in tension owing to differential participation rates across subpopulations4,5. Here we apply ideas from fair division to develop selection algorithms that satisfy the two desiderata simultaneously to the greatest possible extent: our selection algorithms choose representative panels while selecting individuals with probabilities as close to equal as mathematically possible, for many metrics of ‘closeness to equality’. Our implementation of one such algorithm has already been used to select more than 40 citizens’ assemblies around the world. As we demonstrate using data from ten citizens’ assemblies, adopting our algorithm over a benchmark representing the previous state of the art leads to substantially fairer selection probabilities. By contributing a fairer, more principled and deployable algorithm, our work puts the practice of sortition on firmer foundations. Moreover, our work establishes citizens’ assemblies as a domain in which insights from the field of fair division can lead to high-impact applications.

Two-Sided Matching Meets Fair Division

We introduce a new model for two-sided matching which allows us to borrow popular fairness notions from the fair division literature such as envy-freeness up to one good and maximin share guarantee. In our model, each agent is matched to multiple agents on the other side over whom she has additive preferences. We demand fairness for each side separately, giving rise to notions such as double envy-freeness up to one match (DEF1) and double maximin share guarantee (DMMS). We show that (a slight strengthening of) DEF1 cannot always be achieved, but in the special case where both sides have identical preferences, the round-robin algorithm with a carefully designed agent ordering achieves it. In contrast, DMMS cannot be achieved even when both sides have identical preferences.

Keep Your Distance: Land Division With Separation

This paper is part of an ongoing endeavor to bring the theory of fair division closer to practice by handling requirements from real-life applications. We focus on two requirements originating from the division of land estates: (1) each agent should receive a plot of a usable geometric shape, and (2) plots of different agents must be physically separated. With these requirements, the classic fairness notion of proportionality is impractical, since it may be impossible to attain any multiplicative approximation of it. In contrast, the ordinal maximin share approximation, introduced by Budish in 2011, provides meaningful fairness guarantees. We prove upper and lower bounds on achievable maximin share guarantees when the usable shapes are squares, fat rectangles, or arbitrary axes-aligned rectangles, and explore the algorithmic and query complexity of finding fair partitions in this setting.