Academic help-seeking skills are vital to postsecondary students' long-term achievement, yet modern computing students face an ever-expanding landscape of help resources with very little explicit guidance on effective help-seeking approaches. Although substantial effort has been devoted to investigate computing students' help-seeking behavior, there is a lack of interventions designed for enhancing students' capabilities of instrumental help-seeking.

Background and Context. Academic help-seeking from both internal (course-affiliated) and external resources is a key part of computing students' learning. The recent emergence of Generative AI (GenAI) tools has substantially transformed students' help-seeking, but our understanding of this impact remains limited. Objectives. We seek to understand the collective changes in computing students' (1) preferences of using external help resources and (2) usage of internal help resources, and the relationship between these two kinds of metrics at the individual level. We also seek to examine whether the relationship is subject to context influences. Method. We analyzed students' self-reported preferences for external resources and recorded usage of two internal resources in 26 offerings of four computing courses (N=3,921 total enrollments) at our institution over a timespan of eight 15-week terms. Findings. We find increases in students' preferences for external resources and decreases in their usage of internal resources in some but not all courses. We identify a substantial negative relationship between the two kinds of metrics at the individual level, but its strength depends on help resource and instructional context.

Allocating students to projects is a commonplace task in computing education. These decisions underpin student-supervisor allocation, the formation of tutee and capstone groups, and pair programming. These allocations play a critical role for individual learner outcomes and the success of collaborative interventions. For example, imbalance in either gender, ethnicity, or nationality can negatively impact learner outcomes. Despite the critical importance of these allocation choices, we see little consensus on how these are implemented. The allocation task can be challenging and time-consuming for instructors of even moderately-sized classes, and the fairness implications can be difficult to assess. Inadvertently, an instructor may allocate in a way that amplifies existing biases or disproportionately harms those from disadvantaged or protected groups. From students' perspectives, a lack of transparency on the allocation process may also lead to issues of trust. The Working Group will undertake a study of allocation practices by bringing together educational and ML literature to develop and evaluate the fairness of allocation methods, and develop educator guidelines to promote pedagogically grounded allocation practices.

Background and Context. Prior experience (PE) has been shown to be related to computing students' performance, persistence, and help-seeking behavior. However, most works studied prior programming experience in introductory programming (CS1) courses, while other forms of PE in other contexts are underexplored.

This experience report documents an attempt at embracing the "A's for all" and equitable grading frameworks in an introductory, proof writing-based discrete mathematics course for computer science majors (with N=138 students) at a medium-sized research-oriented university in the US. Unlike in introductory programming contexts, there is so far no reliable automated grading system that gives formative and adaptive feedback supporting the scope of a proof-based discrete mathematics course. We therefore faced the unique challenge of being unable to automate all assessments and directly offer all students unlimited attempts toward mastery.

Background and Context. Existing works in computing students' help-seeking and resource selection identified an expanding set of important dimensions that students consider when choosing a help resource. However, most works either assume a predefined list of help resources or focus on one specific help resource, while the landscape of help resources evolve at a faster speed.

Background and Context. Academic help-seeking is vital to post-secondary computing students’ effective learning. However, most empirical works in this domain study students’ help resource selection and utilization by aggregating the entire student body as a whole. Moreover, existing theoretical frameworks often implicitly assume that whether/how much a student seeks help from a specific resource only depends on context (the type of help needed and the properties of the resources), not the individual student.

Although hybrid courses have become increasingly common in higher education, it remains uncertain whether a student's experience of a course is consistent between in-person and online modalities. To investigate this, we analyzed student modality and discussion data from the Spring 2023 offering of an elective data science course where students are allowed to attend each lecture in person or synchronously online.

Academic help-seeking is a vital part of students’ self-regulated learning strategies. Computing students’ help-seeking horizon has seen several transformations in the past 15 years such that existing frameworks no longer capture current computing students’ learning environment, motivating a dedicated study on computing students’ academic help-seeking behavior. Building on extant works that focus on a single course or help source, my research investigates computing students’ academic help-seeking behavior across different contexts. By analyzing students’ help-seeking records, my research seeks to understand how and why computing students transition between available help resources while seeking help, as well as how this process changes in different contexts.

Undergraduate teaching assistants (UTAs) office hours are an approachable way for students to get help, but little is known about why and for what do the students choose to attend office hours. We sought to understand what kind of help the students believe they need by analyzing the problem-solving step students self-reported when joining the office hours queue app. We used the UPIC framework to aggregate course specific problem-solving steps to enable comparing between seven data sets from a CS1 and a data science course across four semesters. We then compared the class-level and student-level phase distributions to understand the differences between the two courses and the two levels in the courses. We found most students have a "primary phase" where a majority of their interactions fall, and there are significant individual differences in their phase distributions. Moreover, we did not find either students' demographics or the context of their first visits to significantly impact their individual differences in the phase distributions, suggesting students may have fixed beliefs on how to approach office hours. Finally, a strong majority of interactions happen within 3 days of the deadline, such that the UPIC distribution for those days looks like the class-level phase distribution.

We model the societal task of redistricting political districts as a partitioning problem: Given a set of n points in the plane, each belonging to one of two parties, and a parameter k, our goal is to compute a partition P of the plane into regions so that each region contains roughly s = n/k points. P should satisfy a notion of "local" fairness, which is related to the notion of core, a well-studied concept in cooperative game theory. A region is associated with the majority party in that region, and a point is unhappy in P if it belongs to the minority party. A group D of roughly s contiguous points is called a deviating group with respect to P if majority of points in D are unhappy in P. The partition P is locally fair if there is no deviating group with respect to P. This paper focuses on a restricted case when points lie in 1D. The problem is non-trivial even in this case. We consider both adversarial and "beyond worst-case" settings for this problem. For the former, we characterize the input parameters for which a locally fair partition always exists; we also show that a locally fair partition may not exist for certain parameters. We then consider input models where there are "runs" of red and blue points. For such clustered inputs, we show that a locally fair partition may not exist for certain values of s, but an approximate locally fair partition exists if we allow some regions to have smaller sizes. We finally present a polynomial-time algorithm for computing a locally fair partition if one exists.

In this paper, we propose to use the concept of local fairness for auditing and ranking redistricting plans. Given a redistricting plan, a deviating group is a population-balanced contiguous region in which a majority of individuals are of the same interest and in the minority of their respective districts; such a set of individuals have a justified complaint with how the redistricting plan was drawn. A redistricting plan with no deviating groups is called locally fair. We show that the problem of auditing a given plan for local fairness is NP-complete. We present an MCMC approach for auditing as well as ranking redistricting plans. We also present a dynamic programming based algorithm for the auditing problem that we use to demonstrate the efficacy of our MCMC approach. Using these tools, we test local fairness on real-world election data, showing that it is indeed possible to find plans that are almost or exactly locally fair. Further, we show that such plans can be generated while sacrificing very little in terms of compactness and existing fairness measures such as competitiveness of the districts or seat shares of the plans.

We study the power of price discrimination via an intermediary in bilateral trade, when there is a revenue-maximizing seller selling an item to a buyer with a private value drawn from a prior. Between the seller and the buyer, there is an intermediary that can segment the market by releasing information about the true values to the seller. This is termed signaling, and enables the seller to price discriminate. In this setting, Bergemann et al. showed the existence of a signaling scheme that simultaneously raises the optimal consumer surplus, guarantees the item always sells, and ensures the seller's revenue does not increase.

Research on new queries for finding dense subgraphs and groups has been actively pursued due to their many applications, especially in social network analysis and graph mining. However, existing work faces two major weaknesses: i) incapability of supporting personalized neighborhood density, and ii) inability to find sparse groups. To tackle the above issues, we propose a new query, called Density-Customized Social Group Query (DCSGQ), that accommodates the need for personalized density by allowing individual users to flexibly configure their social tightness (and sparseness) for the target group. The proposed DCSGQ is general due to flexible in configuration of neighboring social density in queries. We prove the NP-hardness and inapproximability of DCSGQ, formulate an Integer Program (IP) as a baseline, and propose an efficient algorithm, FSGSel-RR, by relaxing the IP. We then propose a fixed-parameter tractable algorithm with a performance guarantee, named FSGSel-TD, and further combine it with FSGSel-RR into a hybrid approach, named FSGSel-Hybrid, in order to strike a good balance between solution quality and efficiency. Extensive experiments on multiple large real datasets demonstrate the superior solution quality and efficiency of our approaches over existing subgraph and group queries.

Shopping in VR malls has been regarded as a paradigm shift for E-commerce, but most of the conventional VR shopping platforms are designed for a single user. In this paper, we envisage a scenario of VR group shopping, which brings major advantages over conventional group shopping in brick-and-mortar stores and Web shopping: 1) configure flexible display of items and partitioning of subgroups to address individual interests in the group, and 2) support social interactions in the subgroups to boost sales. Accordingly, we formulate the Social-aware VR Group-Item Configuration (SVGIC) problem to configure a set of displayed items for flexibly partitioned subgroups of users in VR group shopping. We prove SVGIC is APX-hard and also NP-hard to approximate within [EQUATION]. We design a 4-approximation algorithm based on the idea of Co-display Subgroup Formation (CSF) to configure proper items for display to different subgroups of friends. Experimental results on real VR datasets and a user study with hTC VIVE manifest that our algorithms outperform baseline approaches by at least 30.1% of solution quality.

With the rapid advent of Virtual Reality (VR) technology and virtual tour applications, there is a research need on spatial queries tailored for simultaneous movements in both the physical and virtual worlds. Traditional spatial queries, designed mainly for one world, do not consider the entangled dual worlds in VR. In this paper, we first investigate the fundamental shortest-path query in VR as the building block for spatial queries, aiming to avoid hitting boundaries and obstacles in the physical environment by leveraging Redirected Walking (RW) in Computer Graphics. Specifically, we first formulate Dual-world Redirected-walking Obstacle-free Path (DROP) to find the minimum-distance path in the virtual world, which is constrained by the RW cost in the physical world to ensure immersive experience in VR. We prove DROP is NP-hard and design a fully polynomial-time approximation scheme, Dual Entangled World Navigation (DEWN), by finding Minimum Immersion Loss Range (MIL Range). Afterward, we show that the existing spatial query algorithms and index structures can leverage DEWN as a building block to support kNN and range queries in the dual worlds of VR. Experimental results and a user study with implementation in HTC VIVE manifest that DEWN outperforms the baselines with smoother RW operations in various VR scenarios.