English
Related papers

Related papers: Competition May Increase Social Happiness in Bipar…

200 papers

Evolutionary game theory assumes that individuals maximize their benefits when choosing strategies. However, an alternative perspective proposes that individuals seek to maximize the benefits of others. To explore the relationship between…

Physics and Society · Physics 2024-05-16 Chaoqian Wang , Attila Szolnoki

We study the mechanism design problem in the setting where agents are rewarded using information only. This problem is motivated by the increasing interest in secure multiparty computation techniques. More specifically, we consider the…

Computer Science and Game Theory · Computer Science 2018-09-28 Simina Brânzei , Claudio Orlandi , Guang Yang

We introduce a `concrete complexity' model for studying algorithms for matching in bipartite graphs. The model is based on the "demand query" model used for combinatorial auctions. Most (but not all) known algorithms for bipartite matching…

Computational Complexity · Computer Science 2019-06-12 Noam Nisan

Cross-group externalities and network effects in two-sided platform markets shape market structure and competition policy, and are the subject of extensive study. Less understood are the within-group externalities that arise when the…

Theoretical Economics · Economics 2020-11-10 Quitzé Valenzuela-Stookey

In a setting where heterogeneous agents interact to accomplish a given set of goals, cooperation is of utmost importance, especially when agents cannot achieve their individual goals by exclusive use of their own efforts. Even when we…

Multiagent Systems · Computer Science 2008-06-25 Ilker Yildirim , Haluk Bingol

Applications such as employees sharing office spaces over a workweek can be modeled as problems where agents are matched to resources over multiple rounds. Agents' requirements limit the set of compatible resources and the rounds in which…

Artificial Intelligence · Computer Science 2022-12-01 Yohai Trabelsi , Abhijin Adiga , Sarit Kraus , S. S. Ravi , Daniel J. Rosenkrantz

An approximation of strategyproofness in large, two-sided matching markets is highly evident. Through simulations, one can observe that the percentage of agents with useful deviations decreases as the market size grows. Furthermore, there…

Multiagent Systems · Computer Science 2022-11-30 Lars Lien Ankile , Kjartan Krange , Yuto Yagi

A common form of competition is one where judges grade contestants' performances which are then compiled to determine the final ranking of the contestants. Unlike in another common form of competition where two contestants play a…

Physics and Society · Physics 2016-08-09 Gyuhyeon Jeon , Juyong Park

We investigate in this paper the theory and econometrics of optimal matchings with competing criteria. The surplus from a marriage match, for instance, may depend both on the incomes and on the educations of the partners, as well as on…

General Economics · Economics 2021-02-26 Alfred Galichon , Bernard Salanié

We investigate the polygamy relations related to the concurrence of assistance for any multipartite pure states. General polygamy inequalities given by the $\alpha$th $(0\leq \alpha\leq 2)$ power of concurrence of assistance is first…

Quantum Physics · Physics 2020-10-13 Zhi-Xiang Jin , Shao-Ming Fei

Two-sided popular matchings in bipartite graphs are a well-known generalization of stable matchings in the marriage setting, and they are especially relevant when preference lists are incomplete. In this case, the cardinality of a stable…

Discrete Mathematics · Computer Science 2018-03-13 Yuri Faenza , Vladlena Powers , Xingyu Zhang

We study competition among contests in a general model that allows for an arbitrary and heterogeneous space of contest design, where the goal of the contest designers is to maximize the contestants' sum of efforts. Our main result shows…

Computer Science and Game Theory · Computer Science 2021-07-29 Xiaotie Deng , Yotam Gafni , Ron Lavi , Tao Lin , Hongyi Ling

We study the stable marriage problem in two-sided markets with randomly generated preferences. We consider agents on each side divided into a constant number of "soft tiers", which intuitively indicate the quality of the agent.…

Computer Science and Game Theory · Computer Science 2021-01-14 Itai Ashlagi , Mark Braverman , Amin Saberi , Clayton Thomas , Geng Zhao

We study the problem of online learning in competitive settings in the context of two-sided matching markets. In particular, one side of the market, the agents, must learn about their preferences over the other side, the firms, through…

Artificial Intelligence · Computer Science 2022-06-07 Chinmay Maheshwari , Eric Mazumdar , Shankar Sastry

We present a model of competition between web search algorithms, and study the impact of such competition on user welfare. In our model, search providers compete for customers by strategically selecting which search results to display in…

Computer Science and Game Theory · Computer Science 2013-10-16 David Kempe , Brendan Lucier

Let $G=(U \cup V, E)$ be a bipartite graph, where $U$ represents jobs and $V$ represents machines. We study a new variant of the bipartite matching problem in which each job in $U$ can be matched to at most one machine in $V$, and the…

Data Structures and Algorithms · Computer Science 2025-08-28 Shaul Rosner , Tami Tamir

The hypothesis that living systems can benefit from operating at the vicinity of critical points has gained momentum in recent years. Criticality may confer an optimal balance between exceedingly ordered and too noisy states. We here…

Populations and Evolution · Quantitative Biology 2016-03-23 Jorge Hidalgo , Jacopo Grilli , Samir Suweis , Amos Maritan , Miguel A. Munoz

In most social choice settings, the participating agents express their preferences over the different alternatives in the form of linear orderings. While this clearly simplifies preference elicitation, it inevitably leads to poor…

Computer Science and Game Theory · Computer Science 2022-10-05 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros A. Voudouris

Making an informed decision -- for example, when choosing a career or housing -- requires knowledge about the available options. Such knowledge is generally acquired through costly trial and error, but this learning process can be disrupted…

Machine Learning · Computer Science 2022-04-15 Sarah H. Cen , Devavrat Shah

Within the context of stochastic probing with commitment, we consider the online stochastic matching problem; that is, the one sided online bipartite matching problem where edges adjacent to an online node must be probed to determine if…

Data Structures and Algorithms · Computer Science 2021-01-07 Allan Borodin , Calum MacRury , Akash Rakheja