English
Related papers

Related papers: An Experimental Study of Decentralized Matching

200 papers

Recommendation systems for online dating have recently attracted much attention from the research community. In this paper we proposed a two-side matching framework for online dating recommendations and design an LDA model to learn the user…

Social and Information Networks · Computer Science 2014-02-03 Kun Tu , Bruno Ribeiro , Hua Jiang , Xiaodong Wang , David Jensen , Benyuan Liu , Don Towsley

This paper aims to provide insight into stability of collaboration choices in P2P networks. We study networks where exchanges between nodes are driven by the desire to receive the best service available. This is the case for most existing…

Networking and Internet Architecture · Computer Science 2007-05-23 Dmitry Lebedev , Fabien Mathieu , Laurent Viennot , Anh-Tuan Gai , Julien Reynier , Fabien De Montgolfier

Over the past years, distributed energy resources (DER) have been the object of many studies, which recognise and establish their emerging role in the future of power systems. However, the implementation of many scenarios and mechanism are…

Systems and Control · Computer Science 2018-09-20 Jaysson Guerrero , Archie Chapman , Gregor Verbic

In this paper, we propose a model of decentralized energy storages, who serve as instruments to shift energy supply intertemporally. From storages' perspective, we investigate their optimal buying or selling decisions under market…

Optimization and Control · Mathematics 2017-02-27 Qiao-Chu He , Yun Yang , Baosen Zhang

Motivated by the rapid push to decentralize sharing of data, we study whether large-scale data sharing coalitions can form in a decentralized manner under differential privacy when players have heterogeneous privacy preferences. We first…

Computer Science and Game Theory · Computer Science 2026-05-19 Raef Bassily , Kate Donahue , Diptangshu Sen , Annuo Zhao , Juba Ziani

Consider the stable matching problem on two sets. We introduce the concept of a preference cycle and show how its natural presence in stable matchings proves a series of classical results in an elementary way.

Discrete Mathematics · Computer Science 2018-04-19 Andrei Ciupan

With model uncertainty characterized by a convex, possibly non-dominated set of probability measures, the agent minimizes the cost of hedging a path dependent contingent claim with given expected success ratio, in a discrete-time,…

Mathematical Finance · Quantitative Finance 2017-09-29 Erhan Bayraktar , Gu Wang

In this paper, we introduce a novel, non-recursive, maximal matching algorithm for double auctions, which aims to maximize the amount of commodities to be traded. It differs from the usual equilibrium matching, which clears a market at the…

Computer Science and Game Theory · Computer Science 2013-04-12 Jinzhong Niu , Simon Parsons

We examine the effect of item arrangement on choices using a novel decision-making model based on the Markovian exploration of choice sets. This model is inspired by experimental evidence suggesting that the decision-making process involves…

Theoretical Economics · Economics 2024-10-30 Kremena Valkanova

In two-sided matching markets, ensuring both stability and strategy-proofness poses a significant challenge; it is impossible when agents' preferences are unrestricted. But what if agents' preferences have specific restricted structures?…

Theoretical Economics · Economics 2025-07-03 Pinaki Mandal

Making Smart Cities more sustainable, resilient and democratic is emerging as an endeavor of satisfying hard constraints, for instance meeting net-zero targets. Decentralized multi-agent methods for socio-technical optimization of…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-29 Srijoni Majumdar , Chuhao Qin , Evangelos Pournaras

In the context of energy market clearing, non-merchant assets are assets that do not submit bids but whose operational constraints are included. Integrating energy storage systems as non-merchant assets can maximize social welfare. However,…

Optimization and Control · Mathematics 2025-05-05 Eléa Prat , Jonas Bodulv Broge , Richard M. Lusby

We study many-to-one matching problems between institutions and individuals, where each institution may be matched to multiple individuals. The matching market includes couples, who view pairs of institutions as complementary. Institutions'…

Theoretical Economics · Economics 2025-07-11 Shashwat Khare , Souvik Roy

In a decentralized environment, exchanging resources requires users to bargain until an agreement is found. Moreover, human agreements involve a combination of collaborative and selfish behavior and often induce circularity, complicating…

Cryptography and Security · Computer Science 2022-07-26 Lorenzo Ceragioli , Letterio Galletta , Pierpaolo Degano , Luca Viganò

We study variants of the stable marriage and college admissions models in which the agents are allowed to express weak preferences over the set of agents on the other side of the market and the option of remaining unmatched. For the…

Computer Science and Game Theory · Computer Science 2017-03-31 Nevzat Onur Domaniç , Chi-Kit Lam , C. Gregory Plaxton

We study a many-to-one matching model inspired by school choice, where schools evaluate applicants using multiple rankings rather than a single priority order. We model each school's evaluation with social choice criteria to reflect the…

Computer Science and Game Theory · Computer Science 2026-03-05 Haoyu Song , Thanh Nguyen , Young-san Lin

The dynamical behavior of switched affine systems is known to be more intricate than that of the well-studied switched linear systems, essentially due to the existence of distinct equilibrium points for each subsystem. First, under…

Systems and Control · Electrical Eng. & Systems 2022-03-15 Matteo Della Rossa , Lucas N. Egidio , Raphaël M. Jungers

We study a decentralized matching market in which firms sequentially make offers to potential workers. For each offer, the worker can choose "accept" or "reject," but the decision is irrevocable. The acceptance of an offer guarantees her…

Computer Science and Game Theory · Computer Science 2019-11-19 Yasushi Kawase , Yutaro Yamaguchi , Yu Yokoi

Recent studies on many-to-one matching markets have explored agents with flexible capacity and truthful preference reporting, focusing on mechanisms that jointly design capacities and select a matching. However, in real-world applications…

Computer Science and Game Theory · Computer Science 2026-03-11 Maria Bazotte , Margarida Carvalho , Thibaut Vidal

We study a dynamic matching setting where homogeneous agents arrive at random according to a Poisson process and randomly form edges yielding a sparse market. Agents stay in the market according to a certain sojourn time and wait to be…

Data Structures and Algorithms · Computer Science 2025-11-27 Johannes Bäumler , Martin Bullinger , Stefan Kober , Donghao Zhu
‹ Prev 1 8 9 10 Next ›