• Aucun résultat trouvé

[PDF] Top 20 Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds

Has 10000 "Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds" found on our website. Below are the top 20 most common "Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds".

Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds

Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds

... coalitions and which agents she would like not to: For instance, if  1 is 2  1 3  1 4, we know that 1 prefers 2 to 3 and 3 to 4, but nothing tells us whether 1 prefers to be with 2 (respectively, ... Voir le document complet

9

Hedonic Games with Ordinal Preferences and Thresholds

Hedonic Games with Ordinal Preferences and Thresholds

... variants with possible or necessary stability; the open problems in Table 3 ...correspondences with the purpose to actually identify “good” coalition structures as an ...of hedonic games where ... Voir le document complet

53

Hedonic Games with Ordinal Preferences and Thresholds

Hedonic Games with Ordinal Preferences and Thresholds

... do with the space, time, and cognitive effort re- quired from the agents for expressing their preferences, another difficulty consists in the complexity of computing coalition structures that satisfy ... Voir le document complet

52

Postcolonial Thresholds: Gateways and Borders

Postcolonial Thresholds: Gateways and Borders

... Gennep and Victor Turner) has been criticized for its lack of definition due to assumptions of unproblematic familiarity and inherent subversiveness (Bugeja 2012; Shome ...processes and power ... Voir le document complet

8

Aggregating Preferences with Positive and Negative Reasons

Aggregating Preferences with Positive and Negative Reasons

... Positive and negative reasons in social choice Consider the Security Council of the United ...elected and 5 ...agree and that no permanent member uses its ...independently and only in a ... Voir le document complet

6

Thin Games with Symmetry and Concurrent Hyland-Ong Games

Thin Games with Symmetry and Concurrent Hyland-Ong Games

... interactions with an Opponent of observational strength wired into the ...intensional and most likely further away from quotient-free full abstraction ...modular, and a finer representation: from the ... Voir le document complet

87

Parity and Streett Games with Costs

Parity and Streett Games with Costs

... smaller than ⊤, which implies ρ ∈ BndCostParity(Ω) due to Lemma 5.5. In the preliminary version of this work [20], we presented a similar construction, the main difference being that we did not use overflows there, but ... Voir le document complet

29

Equilibria in Ordinal Games: A Framework based on Possibility Theory

Equilibria in Ordinal Games: A Framework based on Possibility Theory

... theory and probabilis- tic game theory ...play and which they are more prone to play than ...where games are not repeated and possible outcomes cannot be ... Voir le document complet

8

Identification and Estimation of Hedonic Models

Identification and Estimation of Hedonic Models

... Gérard and Joan Martens Weiner, Cross-Border Loss Offset and Formulary Apportionment: How do they affect multijurisdictional firm investment spending and interjurisdictional tax competition ?, August ... Voir le document complet

78

Learning Ordinal Preferences on Multiattribute Domains: the Case of CP-nets

Learning Ordinal Preferences on Multiattribute Domains: the Case of CP-nets

... models and languages can be partitioned by examining the mathematical nature of the preferences they ...between ordinal preferences that consist in ranking the alternatives, and ... Voir le document complet

24

Learning Ordinal Preferences on Multiattribute Domains: the Case of CP-Nets

Learning Ordinal Preferences on Multiattribute Domains: the Case of CP-Nets

... dealing with ordinal preferences on combinatorial domains, is the dependence structure between ...for representing preferences based on conditional preferential independence ...graph ... Voir le document complet

20

Solving strong Stackelberg equilibrium in stochastic games

Solving strong Stackelberg equilibrium in stochastic games

... ONCLUSIONS AND F UTURE WORK In this work we adapt dynamic programming based algo- rithms to find stationary policies forming ...exists and is achievable via dynamic ...iteration and policy iteration ... Voir le document complet

5

Efficient allocations and Equilibria with short-selling and Incomplete Preferences

Efficient allocations and Equilibria with short-selling and Incomplete Preferences

... 1 and Y i + e" 0 i X i , i 6= 1 contradicting the weak efficiency of ...equilibrium with iner- tia, then X ⇤ is weakly efficient and that, if agents have a common increasing direction and ... Voir le document complet

17

Ordinal power relations and social rankings

Ordinal power relations and social rankings

... dominance and symmetry, are not compatible over the class of all power relations (see Theorem 1 in Section 4), despite the fact that, in some related axiomatic frameworks (see, for instance, [2]), similar axioms ... Voir le document complet

13

New algorithms for solving zero-sum stochastic games

New algorithms for solving zero-sum stochastic games

... zero-sum games is its ...values and the value of any stochastic game, which are polynomial in the number of pure stationary strategies of the game, that is: strategies that depend only on the current ... Voir le document complet

21

Vote and Aggregation in Combinatorial Domains with Structured Preferences

Vote and Aggregation in Combinatorial Domains with Structured Preferences

... dessert and a wine, with a choice of 6 items for ...each, and any stan- dard voting rule could be applied without ...problem with p variables into a set of p smaller problems, each one bearing ... Voir le document complet

6

Pushdown games with unboundedness and regular conditions

Pushdown games with unboundedness and regular conditions

... The EXPTIME-hardness follows by the same reduction as for the push- down games with regular winning conditions (cf. [18, 19]). This is because the EXPTIME lower bound is obtained with reachability ... Voir le document complet

49

Choices, Preferences, and Welfare

Choices, Preferences, and Welfare

... task, and a copy ...Niederle, and Sprenger (2015) used efort tasks to measure ...experiment, and thus, subjects did not know anything about them before the ...like, and inally one where they ... Voir le document complet

172

Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods

Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods

... division with in- divisible goods is its combinatorial nature [9]: the space of possible bundles grows exponentially in the number of ...items, and end up with an exponentially large representation, ... Voir le document complet

6

Solving Simple Stochastic Tail Games

Solving Simple Stochastic Tail Games

... tail games which are of independent interest: they are qualitatively determined and both players have optimal strate- ...game with finitely many vertices, either Eve has an almost-sure winning ... Voir le document complet

19

Show all 10000 documents...