English
Related papers

Related papers: Equivalent Choice Functions and Stable Mechanisms

200 papers

We study the interaction between strategy, heterogeneity and growth in a two-agent model of capital accumulation. Preferences are represented by recursive utility functions with decreasing marginal impatience. The stationary equilibria of…

Optimization and Control · Mathematics 2016-08-26 Luis Alcala , Fernando Tohme , Carlos Dabus

We address the following dynamic version of the school choice question: a city, named City, admits students in two temporally-separated rounds, denoted $\mathcal{R}_1$ and $\mathcal{R}_2$. In round $\mathcal{R}_1$, the capacity of each…

Computer Science and Game Theory · Computer Science 2020-07-24 Karthik Gajulapalli , James Liu , Tung Mai , Vijay V. Vazirani

We study the market selection hypothesis in complete financial markets, populated by heterogeneous agents. We allow for a rich structure of heterogeneity: individuals may differ in their beliefs concerning the economy, information and…

Portfolio Management · Quantitative Finance 2012-01-17 Roman Muraviev

In this paper, paired comparison models with stochastic background are investigated. We focus on the models that allow three options for choice. We estimate all parameters, the strength of the objects and the boundaries of equal decision,…

Optimization and Control · Mathematics 2025-02-20 László Gyarmati , Csaba Mihálykó , Eva Orbán-Mihálykó , András Mihálykó

We extend well-known comparative results under expected utility to models of non-expected utility by providing novel conditions on local utility functions. We illustrate how our results parallel, and are distinct from, existing results for…

Theoretical Economics · Economics 2026-01-16 Collin Raymond , Yangwei Song

We introduce the {\sc classified stable matching} problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applicants. Both institutes and applicants have preferences…

Data Structures and Algorithms · Computer Science 2009-10-25 Chien-Chung Huang

The word stable is used to describe a situation when mathematical objects that almost satisfy an equation are close to objects satisfying it exactly. We study operator-algebraic forms of stability for unitary representations of groups and…

Operator Algebras · Mathematics 2025-09-22 Mikael de la Salle

We consider the allocation of indivisible objects when agents have preferences over their own allocations, but share the ownership of the resources to be distributed. Examples might include seats in public schools, faculty offices, and time…

Theoretical Economics · Economics 2021-09-07 Mustafa Oğuz Afacan , Inácio Bó

This paper studies a many-to-one matching between individuals and institutions where institutions comprise multiple divisions and face cross-divisional constraints. We introduce a parametrized family of choice rules, which we call…

Theoretical Economics · Economics 2026-01-09 Orhan Aygün , Bertan Turhan

In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…

Computer Science and Game Theory · Computer Science 2025-02-11 Gergely Csáji

Recent work has shown that models trained to the same objective, and which achieve similar measures of accuracy on consistent test data, may nonetheless behave very differently on individual predictions. This inconsistency is undesirable in…

Machine Learning · Computer Science 2021-11-17 Emily Black , Klas Leino , Matt Fredrikson

We consider the problem of embedding a dynamic network, to obtain time-evolving vector representations of each node, which can then be used to describe changes in behaviour of individual nodes, communities, or the entire graph. Given this…

Machine Learning · Statistics 2022-01-21 Ian Gallagher , Andrew Jones , Patrick Rubin-Delanchy

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

We extend the study of learning in games to dynamics that exhibit non-asymptotic stability. We do so through the notion of uniform stability, which is concerned with equilibria of individually utility-seeking dynamics. Perhaps surprisingly,…

Computer Science and Game Theory · Computer Science 2025-10-17 Geelon So , Yi-An Ma

We propose a learning dynamics to model how strategic agents repeatedly play a continuous game while relying on an information platform to learn an unknown payoff-relevant parameter. In each time step, the platform updates a belief estimate…

Multiagent Systems · Computer Science 2023-11-02 Manxi Wu , Saurabh Amin , Asuman Ozdaglar

We introduce a new class of functions, called Attractivity Guarantee (AG)-functions, to certify the attractivity of sets for uncertain nonlinear switched systems in discrete time. The existence of an AG-function associated with a set…

Systems and Control · Electrical Eng. & Systems 2026-05-12 Alejandro Anderson , Esteban A. Hernandez-Vargas , Giulia Giordano

Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computational aspects of a possible similar scheme for assigning…

Data Structures and Algorithms · Computer Science 2015-01-26 Katarina Cechlarova , Tamas Fleiner , David F. Manlove , Iain McBride

We study a two-alternative voting game where voters' preferences depend on an unobservable world state and each voter receives a private signal correlated to the true world state. We consider the collective decision when voters can…

Computer Science and Game Theory · Computer Science 2024-10-11 Xiaotie Deng , Biaoshuai Tao , Ying Wang

We present a strategy-proof public goods budgeting mechanism where agents determine both the total volume of expanses and the specific allocation. It is constructed as a modification of VCG to a less typical environment, namely where we do…

Computer Science and Game Theory · Computer Science 2023-03-14 Jonathan Wagner , Reshef Meir

We study the utilitarian distortion of social choice mechanisms under the recently proposed learning-augmented framework where some (possibly unreliable) predicted information about the preferences of the agents is given as input. In…

Computer Science and Game Theory · Computer Science 2025-02-11 Aris Filos-Ratsikas , Georgios Kalantzis , Alexandros A. Voudouris
‹ Prev 1 8 9 10 Next ›