Results 71 to 80 of about 3,305 (196)
"Almost stable" matchings in the roommates problem with bounded preference lists [PDF]
An instance of the classical Stable Roommates problem need not admit a stable matching. Previous work has considered the problem of finding a matching that is “as stable as possible”, i.e., admits the minimum number of blocking pairs.
Biró, Péter +7 more
core +1 more source
Energy trading framework for electric vehicles: an assignment matching-theoretic game
Electric Vehicles (EVs) can be considered as a flexible source of energy which can receive some benefit in terms of incentives for selling their energy. For efficient and economic trading amongst the EV owners, various researchers have proposed a variety
Rubi Rana +3 more
doaj +1 more source
Ordinal Simplicity in Discrete Mechanism Design
ABSTRACT In environments without transfers, market designers usually restrict attention to ordinal mechanisms. Ordinal mechanisms are simpler but miss potentially welfare‐relevant information. Under what conditions is it without loss to focus on ordinal mechanisms? We show that all group strategy‐proof mechanisms are ordinal.
Marek Pycia, M. Utku Ünver
wiley +1 more source
A master rise and recession analysis allows to represent the hydraulic behavior of a peatland from water level, precipitation, and topography data. Because of the lack of in situ precipitation data from tropical peatlands, we adapted the master rise and recession curves construction specifically for a satellite‐based precipitation product, that is ...
Sebastian Apers +3 more
wiley +1 more source
Tâtonnement in matching markets
I study tâtonnement processes in a matching market without transfers. In each period, schools set cutoffs, i.e., the preference ranks of the least preferred students they are willing to admit, and students accept their most preferred offers. Cutoffs are adjusted on the basis of demand–supply imbalances. A school's adjustment from one period to the next
Alexander Westkamp
wiley +1 more source
PESMATCH: a job matching web application for PEESO Tagum using Gale-Shapley algorithm
A thesis presented to the Thesis Committee of the Department of Arts and Sciences Education. In partial fulfillment of the requirements for the degree Bachelor of Science in Computer Science.Includes bibliographical references (pages 38-40).The use of ...
Ycoy, Meller C. +2 more
core
Research on Multi-Level Distribution Location-Route of Urban Subway Based on Bilateral Matching [PDF]
Urbanization advancement has promoted the rapid development of urban logistics, and multi-level new features have emerged in urban distribution. However, problems such as traffic congestion and environmental pollution, have also arisen.
SHU Da, LIANG Chengji, WANG Yu, SUN Miaomiao
doaj +1 more source
Expectational Equilibria and Drèze Equilibria in Many‐to‐One Matching Models
ABSTRACT We study coalition formation in many‐to‐one matching models from a competitive equilibrium perspective. We cover both models with and models without monetary transfers. A first notion to do so is the one of Drèze equilibrium, which we extend to the many‐to‐one setup. A second concept is expectational equilibrium.
P. Jean‐Jacques Herings
wiley +1 more source
Data‐bility: Endogamous social intimacies on dating apps in Mumbai
Abstract In this paper I argue through the double entendre of ‘data‐bility’ that how dateable one is on a dating app relies on data. This techno‐social framework enables an understanding of how dating apps are reconfiguring a politics of sexuality, circumscribed by digital technologies and data.
Kavita Dattani
wiley +1 more source
Manipulationsanreize im Gale-Shapley-Algorithmus: Ein Literaturüberblick [PDF]
Die von Gale und Shapley in ihrem 1962 veröffentlichten Artikel College Admissions and the Stability of Marriage vorgestellte deferred acceptance procedure hat in der Literatur zu einer umfassenden Diskussion über Zuordnungsverfahren auf zweiseitigen ...
Hüber, Frank
core

