On Fair Virtual Conference Scheduling: Achieving Equitable Participant and Speaker Satisfaction

• URL: http://arxiv.org/abs/2010.14624v1
• Date: Sat, 24 Oct 2020 15:05:12 GMT
• Title: On Fair Virtual Conference Scheduling: Achieving Equitable Participant and Speaker Satisfaction
• Authors: Gourab K Patro, Abhijnan Chakraborty, Niloy Ganguly, Krishna P. Gummadi
• Abstract summary: We show that optimizing for global welfare could result in a schedule that is unfair to the stakeholders, i.e., the individual utilities for participants and speakers can be highly unequal. We propose a joint optimization framework that allows conference organizers to design talk schedules that balance (i.e., allow trade-offs) between global welfare, participant fairness and the speaker fairness objectives.
• Score: 33.59413518808626
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The (COVID-19) pandemic-induced restrictions on travel and social gatherings have prompted most conference organizers to move their events online. However, in contrast to physical conferences, virtual conferences face a challenge in efficiently scheduling talks, accounting for the availability of participants from different time-zones as well as their interests in attending different talks. In such settings, a natural objective for the conference organizers would be to maximize some global welfare measure, such as the total expected audience participation across all talks. However, we show that optimizing for global welfare could result in a schedule that is unfair to the stakeholders, i.e., the individual utilities for participants and speakers can be highly unequal. To address the fairness concerns, we formally define fairness notions for participants and speakers, and subsequently derive suitable fairness objectives for them. We show that the welfare and fairness objectives can be in conflict with each other, and there is a need to maintain a balance between these objective while caring for them simultaneously. Thus, we propose a joint optimization framework that allows conference organizers to design talk schedules that balance (i.e., allow trade-offs) between global welfare, participant fairness and the speaker fairness objectives. We show that the optimization problem can be solved using integer linear programming, and empirically evaluate the necessity and benefits of such joint optimization approach in virtual conference scheduling.

Related papers

• A Human-in-the-Loop Fairness-Aware Model Selection Framework for Complex Fairness Objective Landscapes [37.5215569371757]
  ManyFairHPO is a fairness-aware model selection framework that enables practitioners to navigate complex and nuanced fairness objective landscapes. We demonstrate the effectiveness of ManyFairHPO in balancing multiple fairness objectives, mitigating risks such as self-fulfilling prophecies, and providing interpretable insights to guide stakeholders in making fairness-aware modeling decisions.
  arXiv  Detail & Related papers  (2024-10-17T07:32:24Z)
• Fair Allocation in Dynamic Mechanism Design [57.66441610380448]
  We consider a problem where an auctioneer sells an indivisible good to groups of buyers in every round, for a total of $T$ rounds. The auctioneer aims to maximize their discounted overall revenue while adhering to a fairness constraint that guarantees a minimum average allocation for each group.
  arXiv  Detail & Related papers  (2024-05-31T19:26:05Z)
• The Impossibility of Fair LLMs [59.424918263776284]
  The need for fair AI is increasingly clear in the era of large language models (LLMs) We review the technical frameworks that machine learning researchers have used to evaluate fairness. We develop guidelines for the more realistic goal of achieving fairness in particular use cases.
  arXiv  Detail & Related papers  (2024-05-28T04:36:15Z)
• Scheduling Virtual Conferences Fairly: Achieving Equitable Participant and Speaker Satisfaction [30.751802638466835]
  Almost all conferences have moved to virtual mode due to the pandemic-induced restrictions on travel and social gathering. We show that optimizing for efficiency alone can result in an unfair virtual conference schedule, where individual utilities for participants and speakers can be highly unequal. We propose a joint optimization framework that allows conference organizers to design schedules that balance (i.e., allow trade-offs) among efficiency, participant fairness and speaker fairness objectives.
  arXiv  Detail & Related papers  (2022-04-26T03:54:17Z)
• Curriculum Learning for Goal-Oriented Semantic Communications with a Common Language [60.85719227557608]
  A holistic goal-oriented semantic communication framework is proposed to enable a speaker and a listener to cooperatively execute a set of sequential tasks. A common language based on a hierarchical belief set is proposed to enable semantic communications between speaker and listener. An optimization problem is defined to determine the perfect and abstract description of the events.
  arXiv  Detail & Related papers  (2022-04-21T22:36:06Z)
• Towards a Fairness-Aware Scoring System for Algorithmic Decision-Making [35.21763166288736]
  We propose a general framework to create data-driven fairness-aware scoring systems. We show that the proposed framework provides practitioners or policymakers great flexibility to select their desired fairness requirements.
  arXiv  Detail & Related papers  (2021-09-21T09:46:35Z)
• Multi-Stage Decentralized Matching Markets: Uncertain Preferences and Strategic Behaviors [91.3755431537592]
  This article develops a framework for learning optimal strategies in real-world matching markets. We show that there exists a welfare-versus-fairness trade-off that is characterized by the uncertainty level of acceptance. We prove that participants can be better off with multi-stage matching compared to single-stage matching.
  arXiv  Detail & Related papers  (2021-02-13T19:25:52Z)
• A Reputation Mechanism Is All You Need: Collaborative Fairness and Adversarial Robustness in Federated Learning [24.442595192268872]
  Federated learning (FL) is an emerging practical framework for effective and scalable machine learning. In conventional FL, all participants receive the global model (equal rewards), which might be unfair to the high-contributing participants. We propose a novel RFFL framework to achieve collaborative fairness and adversarial robustness simultaneously via a reputation mechanism.
  arXiv  Detail & Related papers  (2020-11-20T15:52:45Z)
• Organizing Virtual Conferences through Mirrors: The ACM e-Energy 2020 Experience [4.104922436116807]
  The emergence of the world-wide COVID-19 pandemic has forced academic conferences to be held entirely in a virtual manner. Past conferences have revealed numerous challenges, from budget planning, to selecting the supporting virtual platforms. We advocate a mirror program approach for academic conferences. More specifically, the conference program is executed in multiple parallel (mirrored) programs, so that each mirror program can fit a different time zone.
  arXiv  Detail & Related papers  (2020-08-19T08:14:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.