中文
相关论文

相关论文: Towards Fair Allocation in Social Commerce Platfor…

200 篇论文

We study fair division of indivisible goods in a single-parameter environment. In particular, we develop truthful social welfare maximizing mechanisms for fairly allocating indivisible goods. Our fairness guarantees are in terms of solution…

计算机科学与博弈论 · 计算机科学 2019-01-29 Siddharth Barman , Ganesh Ghalme , Shweta Jain , Pooja Kulkarni , Shivika Narang

Matching platforms, such as online dating services and job recommendations, have become increasingly prevalent. For the success of these platforms, it is crucial to design reciprocal recommender systems (RRSs) that not only increase the…

信息检索 · 计算机科学 2026-02-26 Yoji Tomita , Tomohiko Yokoyama

We study the problem of fairly allocating a set of indivisible goods among agents with additive valuations. The extent of fairness of an allocation is measured by its Nash social welfare, which is the geometric mean of the valuations of the…

计算机科学与博弈论 · 计算机科学 2018-07-23 Siddharth Barman , Sanath Kumar Krishnamurthy , Rohit Vaish

Recent studies on disparate impact in machine learning applications have sparked a debate around the concept of fairness along with attempts to formalize its different criteria. Many of these approaches focus on reducing prediction errors…

计算机与社会 · 计算机科学 2018-10-22 Ansh Patel

In an online fair allocation problem, a sequence of indivisible items arrives online and needs to be allocated to offline agents immediately and irrevocably. In our paper, we study the online allocation of either goods or chores. We employ…

计算机科学与博弈论 · 计算机科学 2025-09-10 Yuanyuan Wang , Tianze Wei

We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion of fairness is Nash social welfare, i.e., the goal is to maximize the geometric mean of the utilities of the agents. Each good comes in…

数据结构与算法 · 计算机科学 2019-05-13 Bhaskar Chaudhury , Yun Kuen Cheung , Jugal Garg , Naveen Garg , Martin Hoefer , Kurt Mehlhorn

We consider the problem of allocating a set of divisible goods to $N$ agents in an online manner, aiming to maximize the Nash social welfare, a widely studied objective which provides a balance between fairness and efficiency. The goods…

计算机科学与博弈论 · 计算机科学 2021-08-04 Siddhartha Banerjee , Vasilis Gkatzelis , Artur Gorokh , Billy Jin

Several fairness concepts have been proposed recently in attempts to approximate envy-freeness in settings with indivisible goods. Among them, the concept of envy-freeness up to any item (EFX) is arguably the closest to envy-freeness.…

计算机科学与博弈论 · 计算机科学 2019-02-13 Ioannis Caragiannis , Nick Gravin , Xin Huang

Many online platforms today (such as Amazon, Netflix, Spotify, LinkedIn, and AirBnB) can be thought of as two-sided markets with producers and customers of goods and services. Traditionally, recommendation services in these platforms have…

信息检索 · 计算机科学 2022-01-05 Arpita Biswas , Gourab K Patro , Niloy Ganguly , Krishna P. Gummadi , Abhijnan Chakraborty

We investigate the problem of fair recommendation in the context of two-sided online platforms, comprising customers on one side and producers on the other. Traditionally, recommendation services in these platforms have focused on…

人工智能 · 计算机科学 2026-02-26 Gourab K Patro , Arpita Biswas , Niloy Ganguly , Krishna P. Gummadi , Abhijnan Chakraborty

Rankings have become the primary interface in two-sided online markets. Many have noted that the rankings not only affect the satisfaction of the users (e.g., customers, listeners, employers, travelers), but that the position in the ranking…

信息检索 · 计算机科学 2022-08-31 Yuta Saito , Thorsten Joachims

We study resource allocation in two-sided markets from a fundamental perspective and introduce a general modeling and algorithmic framework to effectively incorporate the complex and multidimensional aspects of fairness. Our main technical…

计算机科学与博弈论 · 计算机科学 2025-06-03 Javier Cembrano , Andrés Moraga , Victor Verdugo

The fair allocation of mixed goods, consisting of both divisible and indivisible goods, has been a prominent topic of study in economics and computer science. We define an allocation as fair if its utility vector minimizes a symmetric…

计算机科学与博弈论 · 计算机科学 2024-07-10 Yasushi Kawase , Koichi Nishimura , Hanna Sumita

This paper considers incentives to provide goods that are partially shareable along social links. We introduce a model in which each individual in a social network not only decides how much of a shareable good to provide, but also decides…

理论经济学 · 经济学 2023-06-05 Stefanie Gerke , Gregory Gutin , Sung-Ha Hwang , Philip Neary

Recommender systems play an increasingly crucial role in shaping people's opportunities, particularly in online dating platforms. It is essential from the user's perspective to increase the probability of matching with a suitable partner…

信息检索 · 计算机科学 2024-09-04 Yoji Tomita , Tomohiki Yokoyama

A major problem in fair division is how to allocate a set of indivisible resources among agents fairly and efficiently. The goal of this work is to characterize the tradeoffs between two well-studied measures of fairness and efficiency --…

计算机科学与博弈论 · 计算机科学 2024-01-17 Michal Feldman , Simon Mauras , Tomasz Ponitka

We consider the problem of assigning items to platforms in the presence of group fairness constraints. In the input, each item belongs to certain categories, called classes in this paper. Each platform specifies the group fairness…

数据结构与算法 · 计算机科学 2021-05-21 Govind S. Sankar , Anand Louis , Meghana Nasre , Prajakta Nimbhorkar

Rankings are ubiquitous in the online world today. As we have transitioned from finding books in libraries to ranking products, jobs, job applicants, opinions and potential romantic partners, there is a substantial precedent that ranking…

信息检索 · 计算机科学 2018-10-18 Ashudeep Singh , Thorsten Joachims

Fair resource allocation is an important problem in many real-world scenarios, where resources such as goods and chores must be allocated among agents. In this survey, we delve into the intricacies of fair allocation, focusing specifically…

计算机科学与博弈论 · 计算机科学 2023-07-24 Shaily Mishra , Manisha Padala , Sujit Gujar

We develop a framework for the analysis of large-scale Ad-auctions where adverts are assigned over a continuum of search types. For this pay-per-click market, we provide an efficient mechanism that maximizes social welfare. In particular,…

计算机科学与博弈论 · 计算机科学 2016-06-03 Frank Kelly , Peter Key , Neil Walton
‹ 上一页 1 2 3 10 下一页 ›