Indifference orders and split-indifference graphs: thirty years of productive collaborative work
This is an account of our years as students of Jayme Luiz Szwarcfiter, during the years 1990. Two articles perfectly represent our experience as students, young researchers, and young authors.
Celina M.H. de Figueiredo +2 more
openalex +2 more sources
On the Complexity of Nash Equilibria of Action-Graph Games [PDF]
We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that encapsulates both "local" dependencies as in graphical games, and partial ...
Daskalakis, Constantinos +3 more
core +3 more sources
Strong stability in the Hospitals/Residents problem [PDF]
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 +2 more sources
Optimal greedy algorithms for indifference graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P. Looges, Stephan Olariu
openalex +4 more sources
Pairwise partition graphs and strategy-proof social choice in the exogenous indifference class model [PDF]
In this paper we consider the exogenous indifference classes model of Barberá and Ehlers (2011) and Sato (2009) and analyze further the relationship between the structure of indifference classes across agents and dictatorship results.
Anup Pramanik, Arunava Sen
openalex +1 more source
Linear time recognition of P4-indifference graphs
A graph is a P4-indifference graph if it admits an ordering < on its vertices such that every chordless path with vertices a, b, c, d and edges ab, bc, cd has ...
Michel Habib +2 more
openalex +3 more sources
Equivariant geometric learning for digital rock physics: estimating formation factor and effective permeability tensors from Morse graph [PDF]
We present a SE(3)-equivariant graph neural network (GNN) approach that directly predicting the formation factor and effective permeability from micro-CT images. FFT solvers are established to compute both the formation factor and effective permeability,
Chen Cai +8 more
semanticscholar +1 more source
Tree-layout based graph classes: proper chordal graphs [PDF]
Many standard graph classes are known to be characterized by means of layouts (a permutation of its vertices) excluding some patterns. Important such graph classes are among others: proper interval graphs, interval graphs, chordal graphs, permutation ...
C. Paul, Evangelos Protopapas
semanticscholar +1 more source
Adjacent-vertex-distinguishing total coloring of indifference graphs
Vagner Pedrotti, Célia de Mello
openalex +2 more sources
Packing triangles in low degree graphs and indifference graphs
Gordana Manić, Yoshiko Wakabayashi
openalex +2 more sources

