DanAdvance Book Archive


Algorithmic Decision Theory: Third International Conference, by Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici (auth.),

By Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici (auth.), Patrice Perny, Marc Pirlot, Alexis Tsoukià s (eds.)

This ebook constitutes the completely refereed convention court cases of the 3rd overseas convention on Algorithmic determination idea, ADT 2013, held in November 2013 in Bruxelles, Belgium. The 33 revised complete papers provided have been rigorously chosen from greater than 70 submissions, overlaying personal tastes in reasoning and choice making, uncertainty and robustness in choice making, multi-criteria choice research and optimization, collective determination making, studying and data extraction for selection aid.

Show description

Read or Download Algorithmic Decision Theory: Third International Conference, ADT 2013, Bruxelles, Belgium, November 12-14, 2013, Proceedings PDF

Best international books

Advances in Visual Computing: 5th International Symposium, ISVC 2009, Las Vegas, NV, USA, November 30-December 2, 2009. Proceedings, Part II

The 2 quantity set LNCS 5875 and LNCS 5876 constitutes the refereed lawsuits of the fifth overseas Symposium on visible Computing, ISVC 2009, held in Las Vegas, NV, united states, in November/December 2009. The ninety seven revised complete papers and sixty three poster papers provided including forty complete and 15 poster papers of seven designated tracks have been conscientiously reviewed and chosen from greater than 320 submissions.

Generic and Indexed Programming: International Spring School, SSGIP 2010, Oxford, UK, March 22-26, 2010, Revised Lectures

Commonplace programming is set making courses extra generally appropriate through unique types of parametrization---not simply alongside the scale of values or of sorts, but in addition of items similar to the form of information, algebraic buildings, innovations, computational paradigms, etc. listed programming is a light-weight type of dependently typed programming, constraining flexibility by means of permitting one to country and payment relationships among parameters: that the shapes of 2 arguments agree, that an encoded worth fits a few style, that values transmitted alongside a channel agree to the acknowledged protocol, etc.

BIS ’99: 3rd International Conference on Business Information Systems, Poznan, Poland 14–16 April 1999

Welcome to BIS'99! enterprise details structures ninety nine is a world convention being held for the 3rd time. BIS'99 goals to debate the advance, implementation, program and development of computers for company tactics. it's addressed to the medical group, humans occupied with the advance of commercial laptop functions, and to specialists supporting to correctly enforce laptop expertise and functions in undefined.

First International Workshop on Larch: Proceedings of the First International Workshop on Larch, Dedham, Massachusetts, USA, 13–15 July 1992

The papers during this quantity have been awarded on the First foreign Workshop on Larch, held at MIT Endicott condo close to Boston on 13-15 July 1992. Larch is a kinfolk of formal specification languages and instruments, and this workshop was once a discussion board in the event you have designed the Larch languages, equipped instrument aid for them, fairly the Larch Prover, and used them to specify and cause approximately software program and platforms.

Additional resources for Algorithmic Decision Theory: Third International Conference, ADT 2013, Bruxelles, Belgium, November 12-14, 2013, Proceedings

Example text

Springer, Heidelberg (2012) 16. : Kernel-based learning methods for preference aggregation. 4OR 7(2), 169–189 (2009) 17. : k-additivity and c-decomposability of bi-capacities and its integral. Fuzzy Sets Syst. 158(15), 1698–1712 (2007) Identification of a 2-Additive BC by Using Mathematical Programming 29 18. : Evaluation and Decision models with multiple criteria: stepping stones for the analyst. Int. Series in Op. Res. & Manag. , vol. 86. Springer (2006) 19. : Determination of weights of interacting criteria from a reference set.

Each voter may support any number of proposals in P and rejects all the others. Subsets of P are called ballots. The favorite ballot Bi ⊆ P of a voter i (1 ≤ i ≤ n) consists of all proposals he supports. The voters evaluate a ballot Q ⊆ P according to the size of the intersection of Q and their favorite ballots. More precisely, voter i accepts Q if and only if a strict majority of proposals from Q is also contained in his favorite ballot, that is, |Bi ∩ Q| > |Q|/2. We say that in this case voter i is happy with Q.

Parameterized by the size h of the solution ballot, Unanimously Accepted Ballot is W[2]-complete and Majoritywise Accepted Ballot is W[2]-hard. Both results hold even if Q+ = ∅. Proof (Sketch). Reduction 1 is a parameterized reduction from the W[2]-hard Hitting Set parameterized by the size k of the hitting set to UnaAB parameterized by the size h of the solution ballot with Q+ = ∅ (see Lemma 1). Because of Observation 2, this implies W[2]-hardness for MajAB parameterized by h even if Q+ = ∅. To show that UnaAB is in W[2], we reduce from UnaAB parameterized by h to the W[2]-complete Independent Dominating Set parameterized by the solution size k [12].

Download PDF sample

Rated 4.67 of 5 – based on 29 votes