English
Related papers

Related papers: Coordinate-free utility theory

200 papers

Consider a financial market in which an agent trades with utility-induced restrictions on wealth. For a utility function which satisfies the condition of reasonable asymptotic elasticity at $-\infty$ we prove that the utility-based…

Probability · Mathematics 2008-12-10 Frank Oertel , Mark Owen

Inspired by work surrounding Igusa's local zeta function, we introduce topological representation zeta functions of unipotent algebraic groups over number fields. These group-theoretic invariants capture common features of established…

Group Theory · Mathematics 2015-03-09 Tobias Rossmann

Finding an envy-free allocation of indivisible resources to agents is a central task in many multiagent systems. Often, non-trivial envy-free allocations do not exist, and, when they do, finding them can be computationally hard. Classical…

Computer Science and Game Theory · Computer Science 2020-11-24 Robert Bredereck , Andrzej Kaczmarczyk , Rolf Niedermeier

A mixture preorder is a preorder on a mixture space (such as a convex set) that is compatible with the mixing operation. In decision theoretic terms, it satisfies the central expected utility axiom of strong independence. We consider when a…

Theoretical Economics · Economics 2021-02-16 David McCarthy , Kalle Mikkola , Teruji Thomas

Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent…

Computer Science and Game Theory · Computer Science 2025-09-08 Nina Chiarelli , Clément Dallard , Andreas Darmann , Stefan Lendl , Martin Milanič , Peter Muršič , Ulrich Pferschy

Additive utility function models are widely used in multiple criteria decision analysis. In such models, a numerical value is associated to each alternative involved in the decision problem. It is computed by aggregating the scores of the…

Optimization and Control · Mathematics 2017-10-05 Olivier Sobrie , Nicolas Gillis , Vincent Mousseau , Marc Pirlot

This paper studies the allocation of indivisible items to agents, when each agent's preferences are expressed by means of a directed acyclic graph. The vertices of each preference graph represent the subset of items approved of by the…

We study the strong core of housing markets when agents' preferences over houses are expressed as partial orders. We provide a structural characterization of the strong core, and propose an efficient algorithm that finds an allocation in…

Computer Science and Game Theory · Computer Science 2025-02-10 Ildikó Schlotter , Lydia Mirabel Mendoza-Cadena

We write the partition function for a lattice gauge theory, with compact gauge group, exactly in terms of unconstrained variables and show that, in the mean field approximation, the dynamics of pure gauge theories, invariant under compact,…

High Energy Physics - Lattice · Physics 2011-08-12 Stam Nicolis

We explore the influence of framing on decision-making, where some products are framed (e.g., displayed, recommended, endorsed, or labeled). We introduce a novel choice function that captures observed variations in framed alternatives.…

Theoretical Economics · Economics 2025-02-04 Paul H. Y. Cheung , Yusufcan Masatlioglu

The Assignment problem is a fundamental and well-studied problem in the intersection of Social Choice, Computational Economics and Discrete Allocation. In the Assignment problem, a group of agents expresses preferences over a set of items,…

Data Structures and Algorithms · Computer Science 2021-05-24 Barak Steindl , Meirav Zehavi

In this paper, we study a variant of hedonic games, called \textsc{Seat Arrangement}. The model is defined by a bijection from agents with preferences for each other to vertices in a graph $G$. The utility of an agent depends on the…

Computer Science and Game Theory · Computer Science 2025-07-30 Hans L. Bodlaender , Tesshu Hanaka , Lars Jaffke , Hirotaka Ono , Yota Otachi , Tom C. van der Zanden

Let ${\mathcal A}\subset {\mathcal P}(X)$, $\emptyset, X\in {\mathcal A}$, ${\mathcal A}$ being closed under finite intersections. If $\psi={o},\omega,\gamma$, then $\Psi({\mathcal A})$ is the family of those $\psi$-covers ${\mathcal U}$…

General Topology · Mathematics 2020-01-01 Lev Bukovský

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 presented insights into the implementation of transactive multi-agent systems over flow networks where local resources are decentralized. Agents have local resource demand and supply, and are interconnected through a flow network…

Multiagent Systems · Computer Science 2023-10-11 Yijun Chen , Zeinab Salehi , Elizabeth L. Ratnam , Ian R. Petersen , Guodong Shi

Let $\mathbf{G}$ be a unipotent group scheme defined in terms of a nilpotent Lie lattice over the ring $\mathcal{O}$ of integers of a number field. We consider bivariate zeta functions of groups of the form $\mathbf{G}(\mathcal{O})$…

Group Theory · Mathematics 2018-07-17 Paula Macedo Lins de Araujo

In this work, we examine one two-parameter family of sets consisting of functions holomorphic in the unit disk, previously investigated by several mathematicians. We focus on the set-theoretic properties of this family, identify the general…

Complex Variables · Mathematics 2024-06-06 Mark Elin , Fiana Jacobzon

Dependence on the parameter is continuous when perturbations of the parameter preserves strict preference for one alternative over another. We characterise this property via a utility function over alternatives that depends continuously on…

Computer Science and Game Theory · Computer Science 2019-04-01 Patrick H. O'Callaghan

Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of…

Logic in Computer Science · Computer Science 2007-05-23 Victor Marek , Jan Treur , Miroslaw Truszczynski

Game theory relies heavily on the availability of cardinal utility functions, but in fields such as matching markets, only ordinal preferences are typically elicited. The literature focuses on mechanisms with simple dominant strategies, but…

Computer Science and Game Theory · Computer Science 2024-08-22 Fabian R. Pieroth , Martin Bichler