Results 21 to 30 of about 952,460 (194)

A graph-theoretic framework for free-parafermion solvability [PDF]

open access: yesProceedings of the Royal Society A
We present a graph-theoretic characterization of when a quantum spin model admits an exact solution via a mapping to free parafermions. Our characterization is based on the concept of a frustration graph, which represents the commutation relations ...
Ryan L. Mann   +3 more
semanticscholar   +1 more source

Size versus truthfulness in the House Allocation problem [PDF]

open access: yes, 2019
We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of allocating a set of objects among a set of agents, where each agent has ordinal preferences (possibly involving ties) over a subset of the objects.
Krysta, Piotr   +3 more
core   +3 more sources

From Actual Evil to Possible Forgiveness: Three Positions on the Axes of Self and Other

open access: yesPsychoanalytic Perspectives, 2023
This article focuses on three positions, from malignant to benign, located on the respective axes of object and subject in the context of forgiveness. A helpful graph is provided.
Dana Amir
semanticscholar   +1 more source

Quantum Computing and Hidden Variables I: Mapping Unitary to Stochastic Matrices [PDF]

open access: yes, 2004
This paper initiates the study of hidden variables from the discrete, abstract perspective of quantum computing. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another, into a stochastic matrix
C. Rovelli   +11 more
core   +2 more sources

Pareto Optimal Matchings in Many-to-Many Markets with Ties [PDF]

open access: yes, 2015
We consider Pareto-optimal matchings (POMs) in a many-to-many market of applicants and courses where applicants have preferences, which may include ties, over individual courses and lexicographic preferences over sets of courses.
A Abdulkadiroǧlu   +14 more
core   +6 more sources

On the recognition of P4-indifferent graphs

open access: yesDiscrete Mathematics, 2001
A simple graph \(G=(V,E)\) is \(P_4\)-indifferent if it admits a total order \(
openaire   +5 more sources

Fair assignment of indivisible objects under ordinal preferences [PDF]

open access: yes, 2014
We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner.
Aziz, Haris   +3 more
core   +4 more sources

Information Disclosure in Open Non-Binding Procurement Auctions: an Empirical Study [PDF]

open access: yes, 2012
The outcome of non-binding reverse auctions critically depends on how information is distributed during the bidding process. We use data from a large European procurement platform to study the impact of different information structures, specifically the ...
Stoll, Sebastian, Zöttl, Gregor
core   +2 more sources

Labour market screening with intermediaries [PDF]

open access: yes, 2006
We consider a Rothschild-Stiglitz-Spence labour market screening model and employ a centralised mechanism to coordinate the efficient matching of workers to firms. This mechanism can be thought of as operated by a recruitment agency, an employment office
Schweinzer, Paul
core   +2 more sources

Cubicity of interval graphs and the claw number

open access: yes, 2009
Let $G(V,E)$ be a simple, undirected graph where $V$ is the set of vertices and $E$ is the set of edges. A $b$-dimensional cube is a Cartesian product $I_1\times I_2\times...\times I_b$, where each $I_i$ is a closed interval of unit length on the real ...
Adiga, Abhijin, Chandran, L. Sunil
core   +2 more sources

Home - About - Disclaimer - Privacy