Results 21 to 30 of about 757 (46)

Precise Complexity of the Core in Dichotomous and Additive Hedonic Games

, 2017
Hedonic games provide a general model of coalition formation, in which a set of agents is partitioned into coalitions, with each agent having preferences over which other players are in her coalition.
A Bogomolnaia, C Ballester, D Dimitrov, GJ Woeginger, GJ Woeginger, H Aziz, K Cechlárová, KI Ko, LJ Stockmeyer, S Banerjee, SC Sung   +10 more
core   +1 more source

The Complexity of Computing Minimal Unidirectional Covering Sets

, 2009
Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability.
A. Meyer, B. Dutta, C. Papadimitriou, C. Papadimitriou, C. Papadimitriou, C. Umans, D. Baumeister, D. Black, D. McGarvey, Dorothea Baumeister, E. Hemaspaandra, E. Hemaspaandra, E. Hemaspaandra, E. Hemaspaandra, E. Hemaspaandra, E. Hemaspaandra, F. Brandt, F. Brandt, F. Brandt, Felix Brandt, Felix Fischer, G. Bordes, G. Chalkiadakis, G. Woeginger, H. Young, I. McLean, J. Cai, J. Cai, J. Kemeny, J. Köbler, J. Laslier, J. Neumann von, J. Rothe, J. Rothe, Jan Hoffmann, Jörg Rothe, K. Wagner, K. Wagner, L. Adleman, L. Hemachandra, L. Stockmeyer, L. Valiant, M. Condorcet de, M. Garey, M. Schaefer, M. Schaefer, N. Alon, N. Miller, P. Fishburn, R. Ladner, S. Bouveret, T. Eiter, T. Eiter, T. Eiter, V. Conitzer, W. Lucas, W. Lucas   +56 more
core   +6 more sources

On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games

, 2013
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible.
Erich Grädel, Hugo Gimbert, Julie De Pril, Thomas Brihaye, Véronique Bruyère   +4 more
core   +2 more sources

EGOIST: Overlay Routing Using Selfish Neighbor Selection [PDF]

, 2007
A foundational issue underlying many overlay network applications ranging from routing to P2P file sharing is that of connectivity management, i.e., folding new arrivals into an existing overlay, and re-wiring to cope with changing network conditions ...
Bestavros, Azer, Byers, John W., Laoutaris, Nikolaos, Roussopoulos, Mema, Smaragdakis, Georgios   +4 more
core   +1 more source

Direct proofs of order independence [PDF]

We establish a generic result concerning order independence of a dominance relation on finite games. It allows us to draw conclusions about order independence of various dominance relations in a direct and simple way.dominance relations,order ...
Krzysztof R. Apt
core  

Dueling algorithms [PDF]

, 2011
We revisit classic algorithmic search and optimization problems from the perspective of competition. Rather than a single optimizer minimizing expected cost, we consider a zero-sum game in which an optimization problem is presented to two players, whose ...
Immorlica, Nicole, Kalai, Adam Tauman, Lucier, Brendan, Moitra, Ankur, Postlewaite, Andrew, Tennenholtz, Moshe   +5 more
core   +1 more source

Pricing bridges to cross a river. [PDF]

Bouhtou, Mustapha, Grigoriev, Alexander, Hoesel, Stan van, Kraaij, Anton van der, Uetz, Marc   +4 more
core   +1 more source

Improving patient and caregiver outcomes in oncology: Team‐based, timely, and targeted palliative care

Ca-A Cancer Journal for Clinicians, 2018
David Hui, Camilla Zimmermann, Eduardo Bruera   +2 more
exaly  

Patient navigation: An update on the state of the science

Ca-A Cancer Journal for Clinicians, 2011
Kristen J Wells
exaly  

Practical clinical interventions for diet, physical activity, and weight control in cancer survivors

Ca-A Cancer Journal for Clinicians, 2015
Wendy Demark-Wahnefried, Laura Q Rogers, Catherine M Alfano   +2 more
exaly