Sciweavers

479 search results - page 15 / 96
» An Algebra of Pareto Points
Sort
View
DM
2000
115views more  DM 2000»
14 years 9 months ago
Dualizability and graph algebras
We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is eith...
Brian A. Davey, Pawel M. Idziak, William A. Lampe,...
MP
2010
150views more  MP 2010»
14 years 4 months ago
The algebraic degree of semidefinite programming
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
Jiawang Nie, Kristian Ranestad, Bernd Sturmfels
74
Voted
JAIR
2008
102views more  JAIR 2008»
14 years 9 months ago
An Ordinal Bargaining Solution with Fixed-Point Property
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
Dongmo Zhang, Yan Zhang
AMAI
2007
Springer
14 years 9 months ago
Database querying under changing preferences
We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is query modification: a query tran...
Jan Chomicki
CDC
2009
IEEE
143views Control Systems» more  CDC 2009»
15 years 2 months ago
Control interpretations of products in the Hopf algebra
Abstract— Families of differential operators, like those defining affine, generally nonlinear, control systems are known to have natural Hopf algebra structures. These provide ...
Matthias Kawski