中文
相关论文

相关论文: Competitive division of a mixed manna

200 篇论文

The aim of this article is to define a notion of cardinal utility function called measurable utility and to define it on a connected and separable subset of a weakly ordered topological space. The definition is equivalent to the ones given…

综合经济学 · 经济学 2023-01-04 Gianmarco Caldini

We study the price competition in a duopoly with an arbitrary number of buyers. Each seller can offer multiple units of a commodity depending on the availability of the commodity which is random and may be different for different sellers.…

计算机科学与博弈论 · 计算机科学 2016-11-15 Mohammad Hassan Lotfi , Saswati Sarkar

In fair division, equitability dictates that each participant receives the same level of utility. In this work, we study equitable allocations of indivisible goods among agents with additive valuations. While prior work has studied…

计算机科学与博弈论 · 计算机科学 2019-05-28 Rupert Freeman , Sujoy Sikdar , Rohit Vaish , Lirong Xia

We study the efficiency of allocations in large markets with a network structure where every seller owns an edge in a graph and every buyer desires a path connecting some nodes. While it is known that stable allocations in such settings can…

计算机科学与博弈论 · 计算机科学 2015-10-06 Elliot Anshelevich , Shreyas Sekar

Agents attempt to maximize expected profits earned by selling multiple units of a perishable product where their revenue streams are affected by the prices they quote as well as the distribution of other prices quoted in the market by other…

交易与市场微观结构 · 定量金融 2025-04-16 Ryan Donnelly , Zi Li

The fair division of chores, as well as mixed manna (goods and chores), has received substantial recent attention in the fair division literature; however, ours is the first paper to extend this research to matching markets. Indeed, our…

计算机科学与博弈论 · 计算机科学 2024-12-24 Jugal Garg , Thorben Tröbst , Vijay V. Vazirani

This paper considers a novel variant of the online fair division problem involving multiple agents in which a learner sequentially observes an indivisible item that has to be irrevocably allocated to one of the agents while satisfying a…

机器学习 · 计算机科学 2025-05-30 Arun Verma , Indrajit Saha , Makoto Yokoo , Bryan Kian Hsiang Low

This paper examines optimal risk sharing for empirically realistic risk attitudes, providing results on Pareto optimality, competitive equilibria, utility frontiers, and the first and second theorems of welfare. Contrary to common…

理论经济学 · 经济学 2025-10-06 Jean-Gabriel Lauzier , Liyuan Lin , Peter Wakker , Ruodu Wang

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

Fairness in multiwinner elections is studied in varying contexts. For instance, diversity of candidates and representation of voters are both separately termed as being fair. A common denominator to ensure fairness across all such contexts…

计算机科学与博弈论 · 计算机科学 2022-11-24 Kunal Relia

Under the assumption of (positive) homogeneity (PH in the sequel) of the corresponding utility functions, we construct polynomial time algorithms for the weak separability, the collective consumption behavior and some related problems.…

数据结构与算法 · 计算机科学 2018-01-04 Alexander Shananin , Sergey Tarasov

The classic house allocation problem is primarily concerned with finding a matching between a set of agents and a set of houses that guarantees some notion of economic efficiency (e.g. utilitarian welfare). While recent works have shifted…

计算机科学与博弈论 · 计算机科学 2024-07-08 Hadi Hosseini , Medha Kumar , Sanjukta Roy

We study fair allocation of indivisible public goods subject to cardinality (budget) constraints. In this model, we have n agents and m available public goods, and we want to select $k \leq m$ goods in a fair and efficient manner. We first…

计算机科学与博弈论 · 计算机科学 2021-07-22 Jugal Garg , Pooja Kulkarni , Aniket Murhekar

We study the classic problem of dividing a collection of indivisible resources in a fair and efficient manner among a set of agents having varied preferences. Pareto optimality is a standard notion of economic efficiency, which states that…

计算机科学与博弈论 · 计算机科学 2023-07-25 Ioannis Caragiannis , Kristoffer Arnsfelt Hansen , Nidhi Rathi

We study the efficiency of fair allocations using the well-studied price of fairness concept, which quantitatively measures the worst-case efficiency loss when imposing fairness constraints. Previous works provided partial results on the…

计算机科学与博弈论 · 计算机科学 2024-01-04 Zihao Li , Shengxin Liu , Xinhang Lu , Biaoshuai Tao , Yichen Tao

We propose a notion of fairness for allocation problems in which different agents may have different reservation utilities, stemming from different outside options, or property rights. Fairness is usually understood as the absence of envy,…

理论经济学 · 经济学 2020-05-12 Federico Echenique , Antonio Miralles , Jun Zhang

We consider the classic problem of fairly allocating indivisible goods among agents with additive valuation functions and explore the connection between two prominent fairness notions: maximum Nash welfare (MNW) and envy-freeness up to any…

计算机科学与博弈论 · 计算机科学 2022-09-12 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros Hollender , Alexandros A. Voudouris

A truthful mechanism for a Bayesian single-item auction results with some ex-ante revenue for the seller, and some ex-ante total surplus for the buyers. We study the Pareto frontier of the set of seller-buyers ex-ante utilities, generated…

计算机科学与博弈论 · 计算机科学 2026-02-13 Moshe Babaioff , Sijin Chen , Zhaohua Chen , Yiding Feng

We establish necessary and sufficient conditions for a network configuration to provide utilities that are both fair and efficient in a well-defined sense. To cover as many applications as possible with a unified framework, we consider…

信号处理 · 电气工程与系统科学 2023-11-27 Renato Luis Garrido Cavalcante , Lorenzo Miretti , Slawomir Stanczak

We study the fair allocation of undesirable indivisible items, or chores. While the case of desirable indivisible items (or goods) is extensively studied, with many results known for different notions of fairness, less is known about the…

计算机科学与博弈论 · 计算机科学 2022-08-30 Umang Bhaskar , A. R. Sricharan , Rohit Vaish