Pairwise partition graphs and strategy-proof social choice in the exogenous indifference class model [PDF]
Social Choice and Welfare, 2015 In this paper we consider the exogenous indifference classes model of Barbera and Ehlers (2011) and Sato (2009) and analyze further the relationship between the structure of indifference classes across agents and dictatorship results. The key to our approach is the pairwise partition graph.
Anup Pramanik, Arunava Sen
openalex +4 more sources
Characterizing and edge-colouring split-indifference graphs
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Z. Carmen Ortiz +2 more
openalex +4 more sources
Adjacent-vertex-distinguishing total coloring of indifference graphs
Matemática Contemporânea, 2010 Vagner Pedrotti, Célia de Mello
openalex +2 more sources
A Symmetric Function of Increasing Forests
Forum of Mathematics, Sigma, 2021 For an indifference graph G, we define a symmetric function of increasing spanning forests of G. We prove that this symmetric function satisfies certain linear relations, which are also satisfied by the chromatic quasisymmetric function and unicellular $\
Alex Abreu, Antonio Nigro
doaj +1 more source
Analysis and synthesis of silhouettes of frontal - and flank-attacking shooting targets using graphs / Анализ и синтез силуэтов фронтальных и флангово-атакующих стрелковых мишеней с использованием графов / Analiza i sinteza silueta frontalnih i bočnih meta za gađanje pomoću grafova [PDF]
Vojnotehnički Glasnik, 2019 The goal of this contribution is to reveal the analytical framework and synthesis guidelines for frontal-attacking targets (FRATs) and flankattacking targets (FLATs) from the point of view of a graph as a mathematical object. The final outcome of this
Vadim L. Khaikov
doaj +1 more source
Strong stability in the Hospitals/Residents problem [PDF]
, 2003 We study a version of the well-known Hospitals/Residents problem in which participants' preferences may involve ties or other forms of indifference.
Irving, R.W, Manlove, D.F., Scott, S.
core +1 more source
Size versus truthfulness in the House Allocation problem [PDF]
, 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
Quantum Computing and Hidden Variables I: Mapping Unitary to Stochastic Matrices [PDF]
, 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]
, 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
Information Disclosure in Open Non-Binding Procurement Auctions: an Empirical Study [PDF]
, 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