English
Related papers

Related papers: Competition May Increase Social Happiness in Bipar…

200 papers

This paper shows that group composition shapes the effectiveness of labor market training programs for jobseekers. Using rich administrative data from Germany and a novel measure of employability, I find that participants benefit from…

Econometrics · Economics 2025-07-29 Ulrike Unterhofer

Many scenarios where agents with restrictions compete for resources can be cast as maximum matching problems on bipartite graphs. Our focus is on resource allocation problems where agents may have restrictions that make them incompatible…

Artificial Intelligence · Computer Science 2022-09-13 Yohai Trabelsi , Abhijin Adiga , Sarit Kraus , S. S. Ravi

In pairwise interactions assortativity in cognition means that pairs where both decision-makers use the same cognitive process are more likely to occur than what happens under random matching. In this paper we study both the mechanisms…

Theoretical Economics · Economics 2022-05-31 Ennio Bilancini , Leonardo Boncinelli , Eugenio Vicario

Some features of the global entanglement of a composed quantum system can be quantified in terms of the purity of a balanced bipartition, made up of half of its subsystems. For the given bipartition, purity can always be minimized by taking…

Quantum Physics · Physics 2011-05-10 P. Facchi , G. Florio , U. Marzolino , G. Parisi , S. Pascazio

The prevalence and importance of algorithmic two-sided marketplaces has drawn attention to the issue of fairness in such settings. Algorithmic decisions are used in assigning students to schools, users to advertisers, and applicants to job…

Machine Learning · Computer Science 2023-06-19 Siddartha Devic , David Kempe , Vatsal Sharan , Aleksandra Korolova

We consider the popular matching problem in a roommates instance with strict preference lists. While popular matchings always exist in a bipartite instance, they need not exist in a roommates instance. The complexity of the popular matching…

Data Structures and Algorithms · Computer Science 2018-04-10 Telikepalli Kavitha

Academic challenges comprise effective means for (i) advancing the state of the art, (ii) putting in the spotlight of a scientific community specific topics and problems, as well as (iii) closing the gap for under represented communities in…

Machine Learning · Computer Science 2023-12-04 Hugo Jair Escalante , Aleksandra Kruchinina

The task of ranking individuals or teams, based on a set of comparisons between pairs, arises in various contexts, including sporting competitions and the analysis of dominance hierarchies among animals and humans. Given data on which…

Machine Learning · Statistics 2022-10-21 M. E. J. Newman

Matching markets are of particular interest in computer science and economics literature as they are often used to model real-world phenomena where we aim to equitably distribute a limited amount of resources to multiple agents and…

Computer Science and Game Theory · Computer Science 2021-10-01 Andrew Yang , Bruce Changlong Xu , Ivan Villa-Renteria

We study the concurrence of arbitrary dimensional bipartite quantum systems. An explicit analytical lower bound of concurrence is obtained, which detects entanglement for some quantum states better than some well-known separability…

Quantum Physics · Physics 2011-04-07 Xiao-Sheng Li , Xiu-Hong Gao , Shao-Ming Fei

Strategic classification studies the design of a classifier robust to the manipulation of input by strategic individuals. However, the existing literature does not consider the effect of competition among individuals as induced by the…

Computer Science and Game Theory · Computer Science 2022-02-23 Lydia T. Liu , Nikhil Garg , Christian Borgs

Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and ranks on the edges denote preferences of the agents over posts. A matching M in G is rank-maximal if it matches the maximum number of…

Data Structures and Algorithms · Computer Science 2014-09-18 Pratik Ghoshal , Meghana Nasre , Prajakta Nimbhorkar

Two-sided matching platforms provide users with menus of match recommendations. To maximize the number of realized matches between the two sides (referred here as customers and suppliers), the platform must balance the inherent tension…

Computer Science and Game Theory · Computer Science 2020-07-29 Itai Ashlagi , Anilesh K. Krishnaswamy , Rahul Makhijani , Daniela Saban , Kirankumar Shiragur

We consider a setting where goods are allocated to agents by way of an allocation platform (e.g., a matching platform). An ``allocation facilitator'' aims to increase the overall utility/social-good of the allocation by encouraging (some of…

Computer Science and Game Theory · Computer Science 2025-08-27 Yohai Trabelsi , Abhijin Adiga , Yonatan Aumann , Sarit Kraus , S. S. Ravi

We study truthful mechanisms for welfare maximization in online bipartite matching. In our (multi-parameter) setting, every buyer is associated with a (possibly private) desired set of items, and has a private value for being assigned an…

Computer Science and Game Theory · Computer Science 2024-02-20 Michal Feldman , Federico Fusco , Stefano Leonardi , Simon Mauras , Rebecca Reiffenhäuser

Entities in multi-agent systems may seek conflicting subobjectives, and this leads to competition between them. To address performance degradation due to competition, we consider a bi-level lottery where a social planner at the high level…

Computer Science and Game Theory · Computer Science 2020-12-04 Hunmin Kim , Minghui Zhu

In many two-sided markets, the parties to be matched have incomplete information about their characteristics. We consider the settings where the parties engaged are extremely patient and are interested in long-term partnerships. Hence, once…

Computer Science and Game Theory · Computer Science 2019-08-30 Kartik Ahuja , Mihaela van der Schaar

The stable marriage problem has been introduced in order to describe a complex system where individuals attempt to optimise their own satisfaction, subject to mutually conflicting constraints. Due to the potential large applicability of…

Statistical Mechanics · Physics 2009-10-31 G. Caldarelli , A. Capocci

In the Stable Marriage Problem two sets of agents must be paired according to mutual preferences, which may happen to conflict. We present two generalizations of its sex-oriented version, aiming to take into account correlations between the…

Disordered Systems and Neural Networks · Physics 2009-11-07 G. Caldarelli , Andrea Capocci , Paolo Laureti

To regulate a social system comprised of self-interested agents, economic incentives are often required to induce a desirable outcome. This incentive design problem naturally possesses a bilevel structure, in which a designer modifies the…

Computer Science and Game Theory · Computer Science 2022-10-14 Boyi Liu , Jiayang Li , Zhuoran Yang , Hoi-To Wai , Mingyi Hong , Yu Marco Nie , Zhaoran Wang
‹ Prev 1 3 4 5 6 7 10 Next ›