scholarly journals The Complexity of Computing Maximin Share Allocations on Graphs

2020 ◽  
Vol 34 (02) ◽  
pp. 2006-2013
Author(s):  
Gianluigi Greco ◽  
Francesco Scarcello
Keyword(s):  
A Priori ◽  
Utility Functions ◽  
Indivisible Goods ◽  
Bounded Treewidth ◽  
Underlying Graph ◽  
Low Degree

Maximin share is a compelling notion of fairness proposed by Buddish as a relaxation of more traditional concepts for fair allocations of indivisible goods. In this paper we consider this notion within a setting where bundles of goods must induce connected subsets over an underlying graph. This setting received much attention in earlier literature, and our study answers a number of questions that were left open. First, we show that computing maximin share allocations is FΔ2P-complete, even when focusing on consistent scenarios, that is, where such allocations are a-priori guaranteed to exist. Moreover, the problem remains intractable if all agents have the same type, i.e., have the same utility functions, and if either the values returned by the utility functions are polynomially bounded, or the underlying graphs have a low degree of cyclicity (more precisely, have bounded treewidth). However, if these conditions hold all together, then computing maximin share allocations (or checking that none exists) becomes tractable. The result is established via machineries based on logspace alternating machines that use partial representations of connected bundles, which are interesting in their own.

Fair Allocation of Indivisible Goods: Improvement

2021 ◽  
Author(s):  
Mohammad Ghodsi ◽  
Mohammad Taghi Hajiaghayi ◽  
Masoud Seddighin ◽  
Saeed Seddighin ◽  
Hadi Yami
Keyword(s):  
Assignment Problem ◽  
Competitive Equilibrium ◽  
Fundamental Problem ◽  
Impossibility Result ◽  
Utility Functions ◽  
Fair Allocation ◽  
Indivisible Goods ◽  
Approximation Result ◽  
Combinatorial Assignment

We study the problem of fair allocation for indivisible goods. We use the maximin share paradigm introduced by Budish [Budish E (2011) The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. J. Political Econom. 119(6):1061–1103.] as a measure of fairness. Kurokawa et al. [Kurokawa D, Procaccia AD, Wang J (2018) Fair enough: Guaranteeing approximate maximin shares. J. ACM 65(2):8.] were the first to investigate this fundamental problem in the additive setting. They showed that in delicately constructed examples, not everyone can obtain a utility of at least her maximin value. They mitigated this impossibility result with a beautiful observation: no matter how the utility functions are made, we always can allocate the items to the agents to guarantee each agent’s utility is at least 2/3 of her maximin value. They left open whether this bound can be improved. Our main contribution answers this question in the affirmative. We improve their approximation result to a 3/4 factor guarantee.

scholarly journals Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints

2019 ◽  
Vol 33 ◽  
pp. 2045-2052 ◽  
Author(s):  
Ayumi Igarashi ◽  
Dominik Peters
Keyword(s):  
Maximum Degree ◽  
Optimal Allocation ◽  
Additional Constraint ◽  
Pareto Optimal ◽  
Np Hard ◽  
Efficient Allocation ◽  
Indivisible Goods ◽  
Underlying Graph

We study the problem of allocating indivisible items to agents with additive valuations, under the additional constraint that bundles must be connected in an underlying item graph. Previous work has considered the existence and complexity of fair allocations. We study the problem of finding an allocation that is Pareto-optimal. While it is easy to find an efficient allocation when the underlying graph is a path or a star, the problem is NP-hard for many other graph topologies, even for trees of bounded pathwidth or of maximum degree 3. We show that on a path, there are instances where no Pareto-optimal allocation satisfies envy-freeness up to one good, and that it is NP-hard to decide whether such an allocation exists, even for binary valuations. We also show that, for a path, it is NP-hard to find a Pareto-optimal allocation that satisfies maximin share, but show that a moving-knife algorithm can find such an allocation when agents have binary valuations that have a non-nested interval structure.

scholarly journals The interconnection between generalized trust and corruption practices of the population (results of sociological research in Altai Krai)

2021 ◽  
Vol 5 (4) ◽  
pp. 47-62
Author(s):  
Anastasia S. Spirina ◽  
Svetlana G. Maximova
Keyword(s):  
Social Trust ◽  
A Priori ◽  
Public Perceptions ◽  
Sociological Research ◽  
Generalized Trust ◽  
Level Of Involvement ◽  
Low Degree ◽  
Different Types ◽  
High Degree ◽  
The Relationship

The relevance of the topic is determined by the importance of the category of generalized trust, which is recognized, within the framework of the concept of social capital, as the foundation for developing the attitude of trust as «a priori benevolence», which can later be considered as the basis for reducing the corruption practices of the population. The low degree and lack of generalized trust can generate a calm attitude towards corruption and facilitate the participation of the population in corrupt activities. A high degree of trust in an individual contributes to confidence in the actions carried out by them, their compliance with established norms, rules or agreements, due to which the likelihood of the implementation of corrupt actions is minimized. This duality of the relationship between corruption and trust is explained by the existence of different forms and levels of trust in society, when different types of trust play their «role». The purpose of the study is to identify the presence of interconnection of generalized trust and corruption in the Altai Krai’s society. The basis of this article consists of integrative theoretical and methodological background, which includes concepts of theories of trust and of corruptogenicity of a society. The novelty of the research lies in the identification of possible points of interdependence of social trust and corruption in society. The article focuses on the sociological analysis of corruption practices and public perceptions of corruption. The level of coverage of everyday corruption and the degree of generalized trust among the population of Altai Krai were determined based on the results of a sociological survey of the urban and rural population aged 18 to 70 years (n = 1200). Corrupt practices of the population are presented in the work by the level of involvement of the population in everyday corruption for the sixteen proposed situations of contacting state authorities. The hypotheses about the presence of interconnection/dependence between generalized trust and corrupt practices were tested. For some figures, a connection was found between socio-demographic characteristics, the degree of generalized trust, the coverage of domestic corruption and its demand. The dependence of some corrupt practices on generalized trust were also revealed. The authors have used regression analysis in the present research.

Application of cross correlation to HREM images of surfaces

1987 ◽  
Vol 45 ◽  
pp. 754-755
Author(s):  
D. E. Luzzi ◽  
L. D. Marks ◽  
M. I. Buckett
Keyword(s):  
Cross Correlation ◽  
A Priori ◽  
Matrix Material ◽  
Correlation Method ◽  
Accurate Knowledge ◽  
Complex Image ◽  
Fourier Filtering ◽  
The Matrix ◽  
Low Pass ◽  
Data Reduction Technique

As the HREM becomes increasingly used for the study of dynamic localized phenomena, the development of techniques to recover the desired information from a real image is important. Often, the important features are not strongly scattering in comparison to the matrix material in addition to being masked by statistical and amorphous noise. The desired information will usually involve the accurate knowledge of the position and intensity of the contrast. In order to decipher the desired information from a complex image, cross-correlation (xcf) techniques can be utilized. Unlike other image processing methods which rely on data massaging (e.g. high/low pass filtering or Fourier filtering), the cross-correlation method is a rigorous data reduction technique with no a priori assumptions.We have examined basic cross-correlation procedures using images of discrete gaussian peaks and have developed an iterative procedure to greatly enhance the capabilities of these techniques when the contrast from the peaks overlap.

Towards 1-Ångstrom-resolution STEM

1993 ◽  
Vol 51 ◽  
pp. 996-997
Author(s):  
H.S. von Harrach ◽  
D.E. Jesson ◽  
S.J. Pennycook
Keyword(s):  
High Resolution ◽  
Field Emission ◽  
Phase Contrast ◽  
Spherical Aberration ◽  
A Priori ◽  
Dark Field ◽  
Image Resolution ◽  
Objective Lens ◽  
Annular Dark Field ◽  
First Results

Phase contrast TEM has been the leading technique for high resolution imaging of materials for many years, whilst STEM has been the principal method for high-resolution microanalysis. However, it was demonstrated many years ago that low angle dark-field STEM imaging is a priori capable of almost 50% higher point resolution than coherent bright-field imaging (i.e. phase contrast TEM or STEM). This advantage was not exploited until Pennycook developed the high-angle annular dark-field (ADF) technique which can provide an incoherent image showing both high image resolution and atomic number contrast.This paper describes the design and first results of a 300kV field-emission STEM (VG Microscopes HB603U) which has improved ADF STEM image resolution towards the 1 angstrom target. The instrument uses a cold field-emission gun, generating a 300 kV beam of up to 1 μA from an 11-stage accelerator. The beam is focussed on to the specimen by two condensers and a condenser-objective lens with a spherical aberration coefficient of 1.0 mm.

Treating Velopharyngeal Inadequacy Using Bilateral Buccal Flap Revision Palatoplasty

2019 ◽  
Vol 4 (5) ◽  
pp. 878-892
Author(s):  
Joseph A. Napoli ◽  
Linda D. Vallino
Keyword(s):  
Systematic Review ◽  
Obstructive Sleep Apnea ◽  
Sleep Apnea ◽  
Cleft Lip ◽  
Cleft Lip And Palate ◽  
A Priori ◽  
Sufficient Evidence ◽  
Obstructive Sleep ◽  
Before And After ◽  
Buccal Flap

Purpose The 2 most commonly used operations to treat velopharyngeal inadequacy (VPI) are superiorly based pharyngeal flap and sphincter pharyngoplasty, both of which may result in hyponasal speech and airway obstruction. The purpose of this article is to (a) describe the bilateral buccal flap revision palatoplasty (BBFRP) as an alternative technique to manage VPI while minimizing these risks and (b) conduct a systematic review of the evidence of BBFRP on speech and other clinical outcomes. A report comparing the speech of a child with hypernasality before and after BBFRP is presented. Method A review of databases was conducted for studies of buccal flaps to treat VPI. Using the principles of a systematic review, the articles were read, and data were abstracted for study characteristics that were developed a priori. With respect to the case report, speech and instrumental data from a child with repaired cleft lip and palate and hypernasal speech were collected and analyzed before and after surgery. Results Eight articles were included in the analysis. The results were positive, and the evidence is in favor of BBFRP in improving velopharyngeal function, while minimizing the risk of hyponasal speech and obstructive sleep apnea. Before surgery, the child's speech was characterized by moderate hypernasality, and after surgery, it was judged to be within normal limits. Conclusion Based on clinical experience and results from the systematic review, there is sufficient evidence that the buccal flap is effective in improving resonance and minimizing obstructive sleep apnea. We recommend BBFRP as another approach in selected patients to manage VPI. Supplemental Material https://doi.org/10.23641/asha.9919352

Project MATCH secondary a priori hypotheses

Addiction ◽  
1997 ◽  
Vol 92 (12) ◽  
pp. 1671-1698 ◽  
Author(s):  
Project Match Research Group
Keyword(s):  
A Priori ◽  
Project Match

Vergleich einer Papier-Bleistift- und einer computergestützten Version des Leistungsprüfsystems (LPS)

Diagnostica ◽  
2002 ◽  
Vol 48 (3) ◽  
pp. 115-120 ◽  
Author(s):  
Stefan Troche ◽  
Beatrice Rammstedt ◽  
Thomas Rammsayer
Keyword(s):  
A Priori

Zusammenfassung. Der zunehmende Einsatz computergestützter diagnostischer Verfahren führt zwangsläufig zur Frage nach der Äquivalenz zwischen konventionellen Papier-Bleistift-Versionen und entsprechenden Computertranspositionen. Zur Überprüfung der Äquivalenz zwischen der computergestützten Version des Leistungsprüfsystems (LPS) im Hogrefe Testsystem und der Papier-Bleistift-Version wurden 131 Versuchspersonen mit beiden Verfahren getestet. Heterogene Ergebnisse zwischen der Papier-Bleistift- und der Computerversion belegen, dass nicht a priori von der Äquivalenz beider Versionen ausgegangen werden kann, und weisen nachdrücklich auf die Notwendigkeit systematischer Äquivalenzprüfungen hin. Eine an Hand einer zweiten Stichprobe von 40 Testpersonen durchgeführte Überprüfung der Retest-Reliabilität der computergestützten Version des LPS ergab für ein Retest-Intervall von zwei Wochen Reliabilitätskoeffizienten zwischen rtt = 0.55 und rtt = 0.94. In der Diskussion werden mögliche Gründe für die Nicht-Äquivalenz der beiden LPS-Versionen identifiziert.

Effects of a Priori Liking on the Elicitation of Mimicry

2010 ◽  
Vol 57 (6) ◽  
pp. 412-418 ◽  
Author(s):  
Mariëlle Stel ◽  
Rick B. van Baaren ◽  
Jim Blascovich ◽  
Eric van Dijk ◽  
Cade McCall ◽  
...  
Keyword(s):  
A Priori ◽  
The Relationship

Mimicry and prosocial feelings are generally thought to be positively related. However, the conditions under which mimicry and liking are related largely remain unspecified. We advance this specification by examining the relationship between mimicry and liking more thoroughly. In two experiments, we manipulated an individual’s a priori liking for another and investigated whether it influenced mimicry of that person. Our experiments demonstrate that in the presence of a reason to like a target, automatic mimicry is increased. However, mimicry did not decrease when disliking a target. These studies provide further evidence of a link between mimicry and liking and extend previous research by showing that a certain level of mimicry even occurs when mimicry behavior is inconsistent with one’s goals or motivations.

Sign in / Sign up

Export Citation Format

Share Document