117 search results - page 21 / 24 » Characterization of polyhedron monotonicity |
MSS
2011
IEEE
14 years 4 months ago
2011
IEEE
We consider bargaining problems under the assumption that players are loss averse, i.e., experience disutility from obtaining an outcome lower than some reference point. We follow...
WG
1994
Springer
15 years 1 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
In the present paper, we investigate consequence relations that are both paraconsistent and plausible (but still monotonic). More precisely, we put the focus on pivotal consequenc...
ECCC
2006
14 years 9 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...