Search

Your search keyword '"MAGOS, DIMITRIOS"' showing total 27 results
Start Over Author "MAGOS, DIMITRIOS"
27 results on '"MAGOS, DIMITRIOS"'

4. Pareto Optimal Matchings in Many-to-Many Markets with Ties

Author

Cechlárová, Katarína, Eirinakis, Pavlos, Fleiner, Tamás, Magos, Dimitrios, Manlove, David, Mourtos, Ioannis, Oceláková, Eva, and Rastegari, Baharak

Subjects
Computer Science - Computer Science and Game Theory
Abstract

We consider Pareto-optimal matchings (POMs) in a many-to-many market of applicants and courses where applicants have preferences, which may include ties, over individual courses and lexicographic preferences over sets of courses. Since this is the most general setting examined so far in the literature, our work unifies and generalizes several known results. Specifically, we characterize POMs and introduce the \emph{Generalized Serial Dictatorship Mechanism with Ties (GSDT)} that effectively handles ties via properties of network flows. We show that GSDT can generate all POMs using different priority orderings over the applicants, but it satisfies truthfulness only for certain such orderings. This shortcoming is not specific to our mechanism; we show that any mechanism generating all POMs in our setting is prone to strategic manipulation. This is in contrast to the one-to-one case (with or without ties), for which truthful mechanisms generating all POMs do exist.

Published
2015

11. Finding all stable pairs and solutions to the many-to-many stable matching problem

Author

Eirinakis, Pavlos, Magos, Dimitrios, Mourts, Ioannis, and Miliotis, Panayiotis

Subjects
Pairwise comparison -- Research, Algorithms -- Research, Algorithm, Computers, Science and technology
Abstract

The many-to-many stable matching problem (MM), defined in the context of a job market, asks for an assignment of workers to firms satisfying the quota of each agent and being [...]

Published
2012

16. There are only 42 Types of 10x10 Latin Squares (LS) to Consider in the Search for a Mutually Orthogonal Triple

Author

Appa, Gautam, Euler, Reinhardt, Kouvela, Anastasia, Magos, Dimitrios, Mourtos, Yiannis, Euler, Reinhardt, Lab-STICC_UBO_CACS_MOCS, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), and Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2014

18. Derhy, Marie-France. 2010. Linear Programming Sensitivity Analysis and Related Topics

Author

Magos, Dimitrios

Subjects
Linear Programming Sensitivity Analysis and Related Topics (Nonfiction work) -- Derhy, Marie-France -- Book reviews, Books -- Book reviews, Business, general, Business
Abstract

DERHY, MARIE-FRANCE. 2010. Linear Programming Sensitivity Analysis and Related Topics. Prentice Hall-Pearson, Harlow, UK. 464 pp. $92.50. Linear Programming Sensitivity Analysis and Related Topics is an introductory textbook on linear [...]

Published
2012
Full Text
View/download PDF

19. On the recognition of 2-row orthogonal latin rectangle circuits

Author

Appa, Gautam, Euler, Reinhardt, Kouvela, Anastasia, Magos, Dimitrios, Mourtos, Yiannis, Lab-STICC_UBO_CACS_MOCS, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS), and Euler, Reinhardt

Subjects
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2012

20. Lessons for finding Mutually Orthogonal Latin Squares (MOLS) for n=10 from new and old proofs for infeasibility of n=6

Author

Appa, Gautam, Euler, Reinhardt, Kouvela, Anastasia, Magos, Dimitrios, Mourtos, Yiannis, Lab-STICC_UBO_CACS_MOCS, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS), and Euler, Reinhardt

Subjects
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2012

21. Three Essays in Competition Policy

Author

MAGOS, Dimitrios

Abstract

Defense Date: 5 May 2011 Jury Members: Prof. Massimo Motta, Supervisor, Universitat Pompeu Fabra Prof. Michele Polo, Università Bocconi Prof. Fernando Vega Redondo, EUI Prof. Nikolaos Vettas, Athens University of Economics and Business This thesis focuses on different aspects of Competition Policy and analyses questions related to market power, collusion and the European Commission's fining policy. The first chapter provides a theoretical setting to study a particular abuse of dominant position, known as margin (or price) squeeze. It explores the conditions under which margin squeeze arises as an equilibriumoutcome and discusses policy implications of introducing price squeeze testing. In the field of cartel detection, the leniency program has been instrumental in competition authorities' fight against cartels. This is the topic of the second paper, which examines the deterrence effect of the leniency program in a setup where all cartels are failing cartels. The third chapter provides an overview of the fining decisions of the European Commission in the field of antitrust. It analyses the incentives of firms to appeal Commission infringement decisions and examines whether the fining Guidelines have led to lower appeal rates, possibly through providing greater transparency in the way fines are set.

Published
2011

27. Linear Programming Sensitivity Analysis and Related Topics.

Author

Rand, Graham K. and Magos, Dimitrios

Subjects
LINEAR programming, SENSITIVITY analysis, NONFICTION
Abstract

The article reviews the book "Linear Programming Sensitivity Analysis and Related Topics," by Marie-France Derhy.

Published
2012

Catalog

Books, media, physical & digital resources
See catalog results