Relevant bibliographies by topics / Maxmin

Academic literature on the topic 'Maxmin'

Author: Grafiati
Published: 7 July 2024
Last updated: 7 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Maxmin.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Journal articles on the topic "Maxmin":

1

Kokol Bukovšek, Damjana, Tomaž Košir, Blaž Mojškerc, and Matjaž Omladič. "Asymmetric linkages: Maxmin vs. reflected maxmin copulas." Fuzzy Sets and Systems 393 (August 2020): 75–95. http://dx.doi.org/10.1016/j.fss.2019.07.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tang, Rui, and Mu Zhang. "Maxmin implementation." Journal of Economic Theory 194 (June 2021): 105250. http://dx.doi.org/10.1016/j.jet.2021.105250.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Geanakoplos, John D. "Afriat from MaxMin." Economic Theory 54, no. 3 (November 2013): 443–48. http://dx.doi.org/10.1007/s00199-013-0783-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Maccheroni, Fabio. "Maxmin under risk." Economic Theory 19, no. 4 (June 1, 2002): 823–31. http://dx.doi.org/10.1007/s001990100167.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

von Stengel, Bernhard, and Daphne Koller. "Team-Maxmin Equilibria." Games and Economic Behavior 21, no. 1-2 (October 1997): 309–21. http://dx.doi.org/10.1006/game.1997.0527.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Guo, Huiyi, and Nicholas C. Yannelis. "Full Implementation under Ambiguity." American Economic Journal: Microeconomics 13, no. 1 (February 1, 2021): 148–78. http://dx.doi.org/10.1257/mic.20180184.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
This paper introduces the maxmin expected utility framework into the problem of fully implementing a social choice set as ambiguous equilibria. Our model incorporates the Bayesian framework and the Wald-type maxmin preferences as special cases and provides insights beyond the Bayesian implementation literature. We establish necessary and almost sufficient conditions for a social choice set to be fully implementable. Under the Wald-type maxmin preferences, we provide easy-to-check sufficient conditions for implementation. As applications, we implement the set of ambiguous Pareto-efficient and individually rational social choice functions, the maxmin core, the maxmin weak core, and the maxmin value. (JEL D71, D81, D82)
7

Amin, Raid W., and Kuiyuan Li. "The MaxMin EWMA tolerance limits." International Journal of Quality & Reliability Management 17, no. 1 (February 2000): 27–41. http://dx.doi.org/10.1108/02656710010283351.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Prisman, Eliezer Z. "Immunization as a maxmin strategy." Journal of Banking & Finance 10, no. 4 (December 1986): 491–509. http://dx.doi.org/10.1016/s0378-4266(86)80002-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Shibaev, S. V. "Maxmin subject to marginal constraints." Cybernetics and Systems Analysis 30, no. 6 (November 1994): 875–84. http://dx.doi.org/10.1007/bf02366446.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Alon, Shiri, and David Schmeidler. "Purely subjective Maxmin Expected Utility." Journal of Economic Theory 152 (July 2014): 382–412. http://dx.doi.org/10.1016/j.jet.2014.03.006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources
You might also be interested in the extended bibliographies on the topic 'Maxmin' for particular source types:
Journal articles Dissertations / Theses Books

Dissertations / Theses on the topic "Maxmin":

1

Léo, Bruno Beltrão. "Maxmin with multiple tastes and beliefs." reponame:Repositório Institucional da UnB, 2016. http://repositorio.unb.br/handle/10482/20734.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Tese (doutorado)—Universidade de Brasília, Departamento de Economia, Brasília, 2016.
Submitted by Fernanda Percia França (fernandafranca@bce.unb.br) on 2016-06-03T17:25:07Z No. of bitstreams: 1 2016_BrunoBeltraoLeo.pdf: 257152 bytes, checksum: d2e63d33f2dc389397cf4d20f3d50a73 (MD5)
Approved for entry into archive by Raquel Viana(raquelviana@bce.unb.br) on 2016-06-15T18:43:44Z (GMT) No. of bitstreams: 1 2016_BrunoBeltraoLeo.pdf: 257152 bytes, checksum: d2e63d33f2dc389397cf4d20f3d50a73 (MD5)
Made available in DSpace on 2016-06-15T18:43:44Z (GMT). No. of bitstreams: 1 2016_BrunoBeltraoLeo.pdf: 257152 bytes, checksum: d2e63d33f2dc389397cf4d20f3d50a73 (MD5)
Neste trabalho, apresentamos uma axiomatização de um modelo de preferências completas sob incerteza que propicia uma multiplicidade de gostos (utilidades) e crenças (priors). Tal qual Gilboa e Schmeidler (1989), trabalhamos em um set-up de Anscombe-Aumann e cada ato é avaliado pelo pior cenário. A diferença é que, enquanto no modelo de Gilboa e Schmeidler (1989) os múltiplos cenários são compostos de um conjunto de crenças, aqui eles serão representados por um conjunto formado de pares crenças-utilidades. Axiomatizamos, também, o caso especial quando os múltiplos cenários resultam apenas de uma multiplicidade de utilidades. _______________________________________________________________________________________________ ABSTRACT
In this work, we present an axiomatization of a model of complete preferences under uncertainty that allows for a multiplicity of tastes and beliefs. As in Gilboa and Schmeidler (1989), we work in an Anscombe-Aumann setup and each act is evaluated by the worst case scenario. The difference is that while in Gilboa and Schmeidler (1989) the multiple scenarios are composed of a set of priors, here they are composed of a set of probability-utility pairs. We axiomatize also the special case when the multiple scenarios are a consequence of the multiplicity of tastes only.
2

Patel, Ebrahim. "Maxmin-plus models of asynchronous computation." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/maxminplus-models-of-asynchronous-computation(148d3056-2309-48c2-887f-42743949ae03).html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
This thesis aims to better represent a framework for asynchrony. Traditional asynchronous models, particularly those used to simulate cellular automata, have used stochasticity or randomness to generate update times. We claimthat, while they may make good representations of their application, such asynchronousmethods rid themodel of the essence of interesting asynchronous processes. Thus, we attempt to better harness the aspects internal to the decision process of such discretely dynamic cells as those in cellular automata.We propose the maxmin-m model as a suitable model for the asynchronous computation of cellular automata. The model uses maxmin-plus algebra, a special case of which is max-plus algebra. This algebra arises naturally from the cellular automaton requirement that a cell receives the state of its neighbours before updating. The maxmin-m model allows each cell to update after it receives m out of a possible n neighbours' states.The max-plus model shows that, while update times may be asynchronous in real time, there is no loss of information, since the corresponding asynchronous process is bijectively related to the synchronous model. In turn, the cellular automaton output, measured by the Shannon and word entropies, is shown to vary little from the synchronous model. Moreover, this type of asynchrony is simple, i.e. it is deterministically obtained due to the linearity of max-plus algebra.Indeed, the maxmin-m model is also shown to be deterministic and always reaches periodic behaviour. In the long time limit, this model is shown to be represented by a max-plus model, supporting its determinism further. Consequently, the complexity of such a model may be thought to be limited. However, we show through large scale experiments that the case where m is approximately n/2 generates most complex behaviour in terms of large periods and transients to the aforementioned periodic orbits. In particular, the complexity is empirically shown to obey a bell form as a function of m (where m ranges from 1 to n). The resulting cellular automaton simulations indicate a correspondence from the complexity of the update times. Therefore, cellular automaton behaviour may be predictable with the type of asynchrony employed in this thesis.
3

Hartmann, L. "Perceived ambiguity, ambiguity attitude and strategic ambiguity in games." Thesis, University of Exeter, 2019. http://hdl.handle.net/10871/35581.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
This thesis contributes to the theoretical work on decision and game theory when decision makers or players perceive ambiguity. The first article introduces a new axiomatic framework for ambiguity aversion and provides axiomatic characterizations for important preference classes that thus far had lacked characterizations. The second article introduces a new axiom called Weak Monotonicity which is shown to play a crucial role in the multiple prior model. It is shown that for many important preference classes, the assumption of monotonic preferences is a consequence of the other axioms and does not have to be assumed. The third article introduces an intuitive definition of perceived ambiguity in the multiple prior model. It is shown that the approach allows an application to games where players perceive strategic ambiguity. A very general equilibrium existence result is given. The modelling capabilities of the approach are highlighted through the analysis of examples. The fourth article applies the model from the previous article to a specific class of games with a lattice-structure. We perform comparative statics on perceived ambiguity and ambiguity attitude. We show that more optimism does not necessarily lead to higher equilibria when players have Alpha-Maxmin preferences. We present necessary and sufficient conditions on the structure of the prior sets for this comparative statics result to hold. The introductory chapter provides the basis of the four articles in this thesis. An overview of axiomatic decision theory, decision-making under ambiguity and ambiguous games is given. It introduces and discusses the most relevant results from the literature.
4

Kelmendi, Edon. "Two-Player Stochastic Games with Perfect and Zero Information." Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0238/document.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
On considère des jeux stochastiques joués sur un graphe fini. La première partie s’intéresse aux jeux stochastiques à deux joueurs et information parfaite. Dans de tels jeux, les joueurs choisissent des actions dans ensemble fini, tour à tour, pour une durée infinie, produisant une histoire infinie. Le but du jeu est donné par une fonction d’utilité qui associe un réel à chaque histoire, la fonction est bornée et Borel-mesurable. Le premier joueur veut maximiser l’utilité espérée, et le deuxième joueur veut la minimiser. On démontre que si la fonction d’utilité est à la fois shift-invariant et submixing alors le jeu est semi-positionnel. C’est-à-dire le premier joueur a une stratégie optimale qui est déterministe et sans mémoire. Les deux joueurs ont information parfaite: ils choisissent leurs actions en ayant une connaissance parfaite de toute l’histoire. Dans la deuxième partie, on étudie des jeux de durée fini où le joueur protagoniste a zéro information. C’est-à-dire qu’il ne reçoit aucune information sur le déroulement du jeu, par conséquent sa stratégie est un mot fini sur l’ensemble des actions. Un automates probabiliste peut être considéré comme un tel jeu qui a un seul joueur. Tout d’abord, on compare deux classes d’automates probabilistes pour lesquelles le problème de valeur 1 est décidable: les automates leaktight et les automates simples. On prouve que la classe des automates simples est un sous-ensemble strict de la classe des automates leaktight. Puis, on considère des jeux semi-aveugles, qui sont des jeux à deux joueurs où le maximiseur a zéro information, et le minimiseur est parfaitement informé. On définit la classe des jeux semi-aveugles leaktight et on montre que le problème d’accessibilité maxmin est décidable sur cette classe
We consider stochastic games that are played on finite graphs. The subject of the first part are two-player stochastic games with perfect information. In such games the two players take turns choosing actions from a finite set, for an infinite duration, resulting in an infinite play. The objective of the game is given by a Borel-measurable and bounded payoff function that maps infinite plays to real numbers. The first player wants to maximize the expected payoff, and the second player has the opposite objective, that of minimizing the expected payoff. We prove that if the payoff function is both shift-invariant and submixing then the game is half-positional. This means that the first player has an optimal strategy that is at the same time pure and memoryless. Both players have perfect information, so the actions are chosen based on the whole history. In the second part we study finite-duration games where the protagonist player has zero information. That is, he gets no feedback from the game and consequently his strategy is a finite word over the set of actions. Probabilistic finite automata can be seen as an example of such a game that has only a single player. First we compare two classes of probabilistic automata: leaktight automata and simple automata, for which the value 1 problem is known to be decidable. We prove that simple automata are a strict subset of leaktight automata. Then we consider half-blind games, which are two player games where the maximizer has zero information and the minimizer is perfectly informed. We define the class of leaktight half-blind games and prove that it has a decidable maxmin reachability problem
5

Ozturk, Aybuke. "Design, Implementation and Analysis of a Description Model for Complex Archaeological Objects." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSE2048/document.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
La céramique est l'un des matériaux archéologiques les plus importants pour aider à la reconstruction des civilisations passées. Les informations à propos des objets céramiques complexes incluent des données textuelles, numériques et multimédias qui posent plusieurs défis de recherche abordés dans cette thèse. D'un point de vue technique, les bases de données de céramiques présentent différents formats de fichiers, protocoles d'accès et langages d'interrogation. Du point de vue des données, il existe une grande hétérogénéité et les experts ont différentes façons de représenter et de stocker les données. Il n'existe pas de contenu et de terminologie standard, surtout en ce qui concerne la description des céramiques. De plus, la navigation et l'observation des données sont difficiles. L'intégration des données est également complexe en raison de laprésence de différentes dimensions provenant de bases de données distantes, qui décrivent les mêmes catégories d'objets de manières différentes.En conséquence, ce projet de thèse vise à apporter aux archéologues et aux archéomètres des outils qui leur permettent d'enrichir leurs connaissances en combinant différentes informations sur les céramiques. Nous divisons notre travail en deux parties complémentaires : (1) Modélisation de données archéologiques complexes, et (2) Partitionnement de données (clustering) archéologiques complexes. La première partie de cette thèse est consacrée à la conception d'un modèle de données archéologiques complexes pour le stockage des données céramiques. Cette base de donnée alimente également un entrepôt de données permettant des analyses en ligne (OLAP). La deuxième partie de la thèse est consacrée au clustering (catégorisation) des objets céramiques. Pour ce faire, nous proposons une approche floue, dans laquelle un objet céramique peut appartenir à plus d'un cluster (d'une catégorie). Ce type d'approche convient bien à la collaboration avec des experts, enouvrant de nouvelles discussions basées sur les résultats du clustering.Nous contribuons au clustering flou (fuzzy clustering) au sein de trois sous-tâches : (i) une nouvelle méthode d'initialisation des clusters flous qui maintient linéaire la complexité de l'approche ; (ii) un indice de qualité innovant qui permet de trouver le nombre optimal de clusters ; et (iii) l'approche Multiple Clustering Analysis qui établit des liens intelligents entre les données visuelles, textuelles et numériques, ce qui permet de combiner tous les types d'informations sur les céramiques. Par ailleurs, les méthodes que nous proposons pourraient également être adaptées à d'autres domaines d'application tels que l'économie ou la médecine
Ceramics are one of the most important archaeological materials to help in the reconstruction of past civilizations. Information about complex ceramic objects is composed of textual, numerical and multimedia data, which induce several research challenges addressed in this thesis. From a technical perspective, ceramic databases have different file formats, access protocols and query languages. From a data perspective, ceramic data are heterogeneous and experts have differentways of representing and storing data. There is no standardized content and terminology, especially in terms of description of ceramics. Moreover, data navigation and observation are difficult. Data integration is also difficult due to the presence of various dimensions from distant databases, which describe the same categories of objects in different ways.Therefore, the research project presented in this thesis aims to provide archaeologists and archaeological scientists with tools for enriching their knowledge by combining different information on ceramics. We divide our work into two complementary parts: (1) Modeling of Complex Archaeological Data and (2) Clustering Analysis of Complex Archaeological Data. The first part of this thesis is dedicated to the design of a complex archaeological database model for the storage of ceramic data. This database is also used to source a data warehouse for doing online analytical processing (OLAP). The second part of the thesis is dedicated to an in-depth clustering (categorization) analysis of ceramic objects. To do this, we propose a fuzzy approach, where ceramic objects may belong to more than one cluster (category). Such a fuzzy approach is well suited for collaborating with experts, by opening new discussions based on clustering results.We contribute to fuzzy clustering in three sub-tasks: (i) a novel fuzzy clustering initialization method that keeps the fuzzy approach linear; (ii) an innovative quality index that allows finding the optimal number of clusters; and (iii) the Multiple Clustering Analysis approach that builds smart links between visual, textual and numerical data, which assists in combining all types ofceramic information. Moreover, the methods we propose could also be adapted to other application domains such as economy or medicine
6

Silva, Adriano Jeronimo da. "Leilões de certificados de energia eletrica : maximo excedente versus maxima quantidade negociada." [s.n.], 2003. http://repositorio.unicamp.br/jspui/handle/REPOSIP/264537.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Orientador : Paulo de Barros Correia
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Mecanica
Made available in DSpace on 2018-08-03T19:46:48Z (GMT). No. of bitstreams: 1 Silva_AdrianoJeronimoda_M.pdf: 616881 bytes, checksum: 151659c0f2ddd2abe2a87c2801f205d8 (MD5) Previous issue date: 2003
Mestrado
7

Li, Junkang. "Games with incomplete information : complexity, algorithmics, reasoning." Electronic Thesis or Diss., Normandie, 2023. http://www.theses.fr/2023NORMC270.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Dans cette thèse, on étudie les jeux à information incomplète. On commence par établir un paysage complet de la complexité du calcul des stratégies pures optimales pour différentes sous-catégories de jeux, lorsque les jeux sont explicitement donnés en entrée. On étudie ensuite la complexité lorsque les jeux sont représentés de façon compacte (par leurs règles de jeu, par exemple). Pour ce faire, on conçoit deux formalismes pour ces représentations compactes. Dans la suite, on se consacre aux jeux à information incomplète, en proposant d'abord un nouveau formalisme, nommé jeu combinatoire à information incomplète, qui regroupe les jeux sans hasard (sauf un tirage aléatoire initial) et avec uniquement des actions publiques. Pour de tels jeux, ce nouveau formalisme capture la notion de l'information et de la connaissance des joueurs mieux que la forme extensive. Puis, on étudie des algorithmes et leurs optimisations pour résoudre les jeux combinatoires à information incomplète ; certains algorithmes que l'on propose sont applicables au-delà de ces jeux. Dans la dernière partie, on présente un travail en cours, qui consiste à modéliser les raisonnements récursifs et différents types de connaissances sur le comportement des adversaires dans les jeux à information incomplète
In this dissertation, we study games with incomplete information. We begin by establishing a complete landscape of the complexity of computing optimal pure strategies for different subclasses of games, when games are given explicitly as input. We then study the complexity when games are represented compactly (e.g.\ by their game rules). For this, we design two formalisms for such compact representations. Then we concentrate on games with incomplete information, by first proposing a new formalism called combinatorial game with incomplete information, which encompasses games of no chance (apart from a random initial drawing) and with only public actions. For such games, this new formalism captures the notion of information and knowledge of the players in a game better than extensive form. Next, we study algorithms and their optimisations for solving combinatorial games with incomplete information; some of these algorithms are applicable beyond these games. In the last part, we present a work in progress that concerns the modelling of recursive reasoning and different types of knowledge about the behaviour of the opponents in games with incomplete information
8

Philippe, Maxime. "Impact des composés oxygènes modèles issus d'une huile de pyrolyse de biomasse sur l'hydrodésulfuration des dibenzothiophènes." Poitiers, 2010. http://theses.edel.univ-poitiers.fr/theses/2010/Philippe-Maxime/2010-Philippe-Maxime-These.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
La matière lignocellulosique est une nouvelle source potentielle de carburant. Cependant les huiles produites à partir de cette ressource contiennent d'importantes quantités d'oxygène qu'il est nécessaire d'éliminer via un procédé d'hydrodésoxygénation qui peut être réalisée lors de l'hydrodésulfuration (HDS) des gazoles. Ceci présente l'avantage d'utiliser les unités d'hydrotraitement disponibles en raffinerie. Pour mettre en évidence les interactions complexes qui existent entre les molécules soufrées et oxygénées, l'impact de composés modèles oxygénés (guaiacol, phénol, CO, CO2 et acide décanoïque) sur la transformation de composés modèles soufrés représentatifs de ceux contenus dans les gazoles (dibenzothiophène (DBT) et 4,6-diméthyldibenzothiophène (46DMDBT)) a été évalué dans les conditions d'HDS (340°C, 4 MPa, CoMoP/Al2O3). Le choix du DBT et du 46DMDBT est justifié car leur transformation implique les deux principales voies de désulfuration (rupture directe des liaisons C-S (DSD) et hydrogénation préalable des noyaux aromatiques (HYD)). Ainsi, un impact négatif des composés oxygénés sur l'HDS des dibenzothiophènes a été mis en évidence et attribué à des compétitions à l'adsorption entre les composés soufrés et oxygénés à la surface du catalyseur. Néanmoins, l'effet négatif dépend de la molécule oxygénée et de la molécule soufrée. L'acide décanoïque serait plus inhibiteur que le CO, le guaiacol et surtout le phénol. Le phénol présente un effet similaire sur les deux voies (HYD et DSD), contrairement au guaiacol qui provoque une inhibition plus importante de la voie HYD. L'acide décanoïque et le CO ont un impact plus conséquent sur la rupture des liaisons C-S
The lignocellulosic material is a new potential source to produce diesel fuels. However, this material contains significant amounts of oxygen which is necessary to eliminate through a process hydrodeoxygenation that can be achieved during the hydrodesulfurization (HDS) of diesel fuels. This represents the advantage of using hydrotreating units available in the refinery. To highlight the complex interactions between sulfur and oxygen molecules, the impact of model oxygenated compounds (guaiacol, phenol, CO, CO2 and decanoic acid) on the conversion of model compounds representative of those sulfur content in diesel (dibenzothiophene (DBT) and 4,6-dimethyldibenzothiophene (46DMDBT)) was evaluated under HDS operating conditions (340°C, 4 MPa, CoMoP/Al2O3). The transformation of DBT and 46DMDBT requires the two main routes involves in HDS process (direct C-S bond rupture: DSD and hydrogenation of aromatic rings followed by C-S bond rupture:HYD). A negative impact of oxygenates on the HDS of dibenzothiophenes has been showed and corresponds to a competitive adsorption between the sulfur and oxygenated compounds on the catalyst surface. The negative impact depends on the oxygenated and sulfur molecules. Indeed, the inhibition was more significant in the presence of decanoic acid than CO and more especially than guaiacol and phenol. Phenol has a similar effect on both ways (HYD and DSD), in contrast to guaiacol, which leads to a greater inhibition of the HYD pathway. Decanoic acid and CO have a more substantial impact on the direct C-S bonds
9

Yang, Dong-Hyeuk Kwon Hyuck M. "Frequency offset effects on Maximin and MOSTLE." Diss., Click here for available full-text of this thesis, 2006. http://library.wichita.edu/digitallibrary/etd/2006/t025.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Thesis (M.S.)--Wichita State University, Dept. of Electrical Engineering.
"July 2006." Title from PDF title page (viewed on October 2, 2006). Thesis adviser: Hyuck M. Kwon. Includes bibliographic references (leaves 39-40).
10

Haines, Sheena Ayla. "Convex relaxations of the maximin dispersion problem." Thesis, University of British Columbia, 2011. http://hdl.handle.net/2429/38242.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Recently, convex relaxations have achieved notable success in solving NP-hard optimization problems. This thesis studies semidefinite and second-order cone programming convex relaxations of the maximin dispersion problem. Providing nontrivial approximation bounds, we believe that our SDP and SOCP relaxation methods are useful in large-scale optimization. The thesis is organized as follows. We begin by recalling some basic concepts from convex analysis, nonsmooth analysis, and optimization. We then introduce the weighted maximin dispersion optimization problem; locating point(s) in a given region X ⊆ R^{n} that is/are furthest from a given set of m points. Also given are several reformulations of the original problem, including a convex relaxation problem and semidefinite and second order cone programming relaxations. Using well known results on Lipschitz functions and subdifferentials of Lipschitz functions we then derive a theoretical characterization of the optimal solutions for a given convex region X and equal weights. Next, we provide a proof that the weighted maximin dispersion problem is NP-hard even in the case where X is a box and the weights are equal. We then propose an algorithm for finding an approximate solution using the SDP relaxation, and derive an approximation bound that depends on the subset X. In the case that X is a box or a product of low-dimensional spheres, we show that the convex relaxation reduces to a second-order cone program, and provide further results on the bound provided. Lastly, we provide numerical examples using the SDP and SOCP relaxations, and suggest future work.
More sources

Books on the topic "Maxmin":

1

Bevers, Michael. Formulating MAXMIN objectives in national forest planning models. Fort Collins, Colo. (240 W. Prospect Rd., Ft. Collins 80526): U.S. Dept. of Agriculture, Forest Service, Rocky Mountain Forest and Range Experiment Station, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bevers, Michael. Formulating MAXMIN objectives in national forest planning models. Fort Collins, Colo. (240 W. Prospect Rd., Ft. Collins 80526): U.S. Dept. of Agriculture, Forest Service, Rocky Mountain Forest and Range Experiment Station, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Karlitch, Johnny. Maximun Max, Prince of Peaks: Inspired by the Adventures of Maxime Chaya. Beirut: Hachette Antoine, 2022.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bezner, Frank. Von der Liturgie zur Geschichte: Die Riesenbibel von St. Maximin und die Historia Excidii Sancti Maximini. Ramsen, Schweiz: Heribert Tenschert, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pino, Marina. Maxín y Maxín. Madrid: Espasa Calpe, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhukovskiĭ, Vladislav Iosifovich. The vector-valued maximin. Boston: Academic Press, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

François, La Rochefoucauld. Maxims. South Bend, Indiana: St. Augustine's Press, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Stephen. Maxims. Kalamazoo, Mich: Cistercian Publications, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cantemir, Dimitrie. Maxime. Chișinău: Cartea Moldovei, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cantemir, Dimitrie. Maxime. Chișinău: Cartea Moldovei, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Maxmin":

1

Washburn, Alan. "Maxmin Versus Minmax." In International Series in Operations Research & Management Science, 5–13. Boston, MA: Springer US, 2013. http://dx.doi.org/10.1007/978-1-4614-9050-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fekete, S´andor P., Winfried Hellmann, Michael Hemmer, Arne Schmidt, and Julian Troegel. "Computing MaxMin Edge Length Triangulations." In 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX), 55–69. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973754.6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Patel, Ebrahim L. "Complexity of Maxmin- $$\omega $$ Cellular Automata." In Unifying Themes in Complex Systems IX, 98–107. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96661-8_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Öztürk, Aybüke, Stéphane Lallich, Jérôme Darmont, and Sylvie Yona Waksman. "MaxMin Linear Initialization for Fuzzy C-Means." In Machine Learning and Data Mining in Pattern Recognition, 1–15. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96136-1_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yanovskaya, Elena. "Lexicographical Maxmin Core Solutions for Cooperative Games." In Lecture Notes in Economics and Mathematical Systems, 125–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-48773-6_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhu, Binhai, and Xiaotie Deng. "On Computing and Drawing Maxmin-Height Covering Triangulation." In Graph Drawing, 464–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-37623-2_48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kelmendi, Edon, and Hugo Gimbert. "Deciding Maxmin Reachability in Half-Blind Stochastic Games." In Algorithmic Game Theory, 52–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53354-3_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Audet, Charles, Pierre Hansen, Brigitte Jaumard, and Gilles Savard. "On the Linear Maxmin and Related Programming Problems." In Multilevel Optimization: Algorithms and Applications, 181–208. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4613-0307-7_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Patel, Ebrahim L. "Maxmin- $$\omega $$ : A Simple Deterministic Asynchronous Cellular Automaton Scheme." In Lecture Notes in Computer Science, 192–98. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44365-2_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Balbás, Alejandro, and Alfredo Ibáñez. "Maxmin Portfolios in Models Where Immunization is Not Feasible." In Applied Optimization, 139–65. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4757-3613-7_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Maxmin":

1

García-Soriano, David, and Francesco Bonchi. "Maxmin-Fair Ranking." In KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3447548.3467349.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sreedurga, Gogulapati, Mayank Ratan Bhardwaj, and Yadati Narahari. "Maxmin Participatory Budgeting." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/70.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Participatory Budgeting (PB) is a popular voting method by which a limited budget is divided among a set of projects, based on the preferences of voters over the projects. PB is broadly categorised as divisible PB (if the projects are fractionally implementable) and indivisible PB (if the projects are atomic). Egalitarianism, an important objective in PB, has not received much attention in the context of indivisible PB. This paper addresses this gap through a detailed study of a natural egalitarian rule, Maxmin Participatory Budgeting (MPB), in the context of indivisible PB. Our study is in two parts: (1) computational (2) axiomatic. In the first part, we prove that MPB is computationally hard and give pseudo-polynomial time and polynomial-time algorithms when parameterized by certain well-motivated parameters. We propose an algorithm that achieves for MPB, additive approximation guarantees for restricted spaces of instances and empirically show that our algorithm in fact gives exact optimal solutions on real-world PB datasets. We also establish an upper bound on the approximation ratio achievable for MPB by the family of exhaustive strategy-proof PB algorithms. In the second part, we undertake an axiomatic study of the MPB rule by generalizing known axioms in the literature. Our study leads to the proposal of a new axiom, maximal coverage, which captures fairness aspects. We prove that MPB satisfies maximal coverage.
3

Yan, Li-rong, and Yi-bo Wu. "MaxMin: An Unbiased Outlier Detection Method." In 2015 2nd International Conference on Information Science and Control Engineering (ICISCE). IEEE, 2015. http://dx.doi.org/10.1109/icisce.2015.73.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lee, Tae Hee, and Jae Jun Jung. "Maxmin Engenvalue Sampling of Kriging Model." In 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2004. http://dx.doi.org/10.2514/6.2004-4488.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bateni, MohammadHossein, Moses Charikar, and Venkatesan Guruswami. "MaxMin allocation via degree lower-bounded arborescences." In the 41st annual ACM symposium. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1536414.1536488.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tsai, Wei, Pohao Huang, Thomas Liau, and Dan-han Tsai. "Theory of Multi-Path Maxmin Rate Allocation." In 2006 14th IEEE International Conference on Networks. IEEE, 2006. http://dx.doi.org/10.1109/icon.2006.302617.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Köppen, Mario, Masato Tsuru, and Yuji Oie. "Evolutionary Approach to Maxmin-Fair Network-Resource Allocation." In 2008 International Symposium on Applications and the Internet. IEEE, 2008. http://dx.doi.org/10.1109/saint.2008.91.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Aziz, Haris, Hau Chan, and Bo Li. "Weighted Maxmin Fair Share Allocation of Indivisible Chores." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
We initiate the study of indivisible chore allocation for agents with asymmetric shares. The fairness concept we focus on is the weighted natural generalization of maxmin share: WMMS fairness and OWMMS fairness. We first highlight the fact that commonly-used algorithms that work well for allocation of goods to asymmetric agents, and even for chores to symmetric agents do not provide good approximations for allocation of chores to asymmetric agents under WMMS. As a consequence, we present a novel polynomial-time constant-approximation algorithm, via linear program, for OWMMS. For two special cases: the binary valuation case and the 2-agent case, we provide exact or better constant-approximation algorithms.
9

Kawanabe, M., C. Vidaurre, S. Scholler, and K. R. Muller. "Robust common spatial filters with a maxmin approach." In 2009 Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE, 2009. http://dx.doi.org/10.1109/iembs.2009.5334786.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Koppen, Mario, Rodrigo Verschae, Kaori Yoshida, and Masato Tsuru. "Heuristic Maxmin Fairness for the Wireless Channel Allocation Problem." In 2010 International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA 2010). IEEE, 2010. http://dx.doi.org/10.1109/bwcca.2010.141.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Maxmin":

1

Dumont, R., Z. Bardossy, and W. Miles. MAXIMA: software to determine local maxima from gridded data. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 2015. http://dx.doi.org/10.4095/296957.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Семеріков, Сергій Олексійович, Ілля Олександрович Теплицький, and Світлана Вікторівна Шокалюк. Maxima – система комп’ютерної математики для вітчизняної системи освіти. НПУ імені М.П. Драгоманова, 2008. http://dx.doi.org/10.31812/0564/915.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ramos, Octavio Jr. Eric Martinez: Maxing out on life. Office of Scientific and Technical Information (OSTI), October 2019. http://dx.doi.org/10.2172/1573324.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Семеріков, Сергій Олексійович, and Ілля Олександрович Теплицький. Огляд інтерфейсів системи комп’ютерної математики Maxima. [б.в.], 2006. http://dx.doi.org/10.31812/0564/813.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Система комп’ютерної математики (СКМ) Maxima завдяки зусиллям міжнародної команди розробників набула властивостей, що роблять її придатною для застосування у вітчизняній системі освіти (як середньої, так і вищої): 1) система повністю відкрита, ліцензійно чиста та безоплатна; 2) система незалежна від використовуваної операційної системи та апаратної платформи; 3) система не вимагає інсталяції, мала за розміром та невимоглива до апаратних ресурсів; 4) сорокарічний досвід вдосконалення системи призвів до появи в неї повністю відлагоджених, швидких та оптимізованих алгоритмів. Останні п’ять років авторами проводиться експериментальна робота із впровадження СКМ Maxima у навчальний процес вищих педагогічних та технічних ВНЗ м. Кривого Рогу та Дніпропетровської області, в ході якої побудовано ряд інтерактивних електронних та друкованих посібників.
5

Семеріков, Сергій Олексійович, and Ілля Олександрович Теплицький. Розробка гіпертекстового довідника з системи Maxima для підтримки факультативного курсу «Комп’ютерні технології в наукових дослідженнях». Бердянський державний педагогічний університет, September 2005. http://dx.doi.org/10.31812/0564/996.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Переваги вільно поширюваної системи Maxima природно роблять її придатною для застосування у системі освіти. На жаль, до сьогодні у вітчизняній навчальній літературі можливості цієї системи практично не висвітлені, тому з метою її популяризації ми поставили ціллю своєї роботи розробку гіпертекстового довідника з системи Maxima для підтримки факультативного курсу “Комп’ютерні технології в наукових дослідженнях”.
6

Ros, Gerard H., Henk Janssen, Nicole Bartelds, and Henri Holster. Uitwerking concept MaxiMi : op weg naar resultaatgestuurd mestbeleid? Wageningen: Wageningen Environmental Research, 2018. http://dx.doi.org/10.18174/461897.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Peterson, T. Liquid Argon Maximm Convective Heat Flux vs. Liquid Depth. Office of Scientific and Technical Information (OSTI), January 1990. http://dx.doi.org/10.2172/1031856.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shyshkina, Mariya, and Uliana Kohut. The Method of Using the Maxima System for Operations Research Learning. [б. в.], June 2019. http://dx.doi.org/10.31812/123456789/3172.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
In the article, the problems of using the systems of computer mathematics (SCM) as a tool to support the teaching and research activities in the field of informatics and mathematics disciplines training are investigated. The role of SCM in the process of bachelors of informatics training and special aspects of pedagogical applications of these systems in the “Operations research” study is defined. The aim of the article is the justification of the Maxima system use of in the process of “Operations research” teaching in pedagogical university as enchasing the investigative approach to learning and determination of the perspective ways of its introduction. The main characteristics of SCM Maxima and the ways of access organizing to it both in local and the cloud-oriented implementation are considered. The results of the pedagogical experiment on the Maxima application to support the investigative approach to operation research study and the analysis of its conclusions are reported.
9

Siegmund, David. Approximate Tail Probabilities for the Maxima of Some Random Fields. Fort Belvoir, VA: Defense Technical Information Center, August 1986. http://dx.doi.org/10.21236/ada172729.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kohut, Uliana, and Mariya Shyshkina. Providing the Fundamentalisation of Operations Research Learning Using MAXIMA System. [б. в.], November 2020. http://dx.doi.org/10.31812/123456789/4464.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
In the article, the problems of using the systems of computer mathe- matics (SCM) as a tool to provide the fundamental component of operations re- search learning and students research activities support are considered. The role of SCM in the process of bachelors of informatics training and special aspects of pedagogical applications of these systems in the “Operations research” study is defined. The analysis of the basic concepts of the fundamentalisation of educa- tion and in particular the basic concepts of the fundamentalisation of informatics disciplines learning is summarized. The attempt to distinguish explicitly and specify the fundamental concepts in the content of “Operation research” learning is made. The method of “Operation research” study using Maxima system as a tool to support the basic concepts learning and an investigation is approved. The results of the pedagogical experiment on MAXIMA application to support the fundamental component of learning in the course of “Operation research” study and the analysis of its results are reported.

To the bibliography