Marginality and convexity in partition function form games

Autor: Andrés Jiménez-Losada, M. G. Fiestras-Janeiro, José Mª Alonso-Meijide, Mikel Álvarez-Mozos

Publikováno v: Dipòsit Digital de la UB
Universidad de Barcelona
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
instname
idUS. Depósito de Investigación de la Universidad de Sevilla

In this paper an order on the set of embedded coalitions is studied in detail. This allows us to define new notions of superaddivity and convexity of games in partition function form which are compared to other proposals in the literature. The main r

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc27368b3db7e32fa5db372006880e74
http://hdl.handle.net/2445/180174

An arithmetic Bernstein-Kushnirenko inequality

Autor: Martín Sombra, César Martínez

Publikováno v: Dipòsit Digital de la UB
Universidad de Barcelona

We present an upper bound for the height of the isolated zeros in the torus of a system of Laurent polynomials over an adelic field satisfying the product formula. This upper bound is expressed in terms of the mixed integrals of the local roof functi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58a40faa57c1873d13319cad43b1a9f8
http://hdl.handle.net/2445/168539

The bargaining set for almost-convex games

Autor: Jesús Montes, Josep M. Izquierdo, Carles Rafels, Jesús Getán

Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname
Dipòsit Digital de la UB
Universidad de Barcelona

We generalize the well-known result of the coincidence of the bargaining set and the core for convex games (Maschler et al., 1972) to the class of games named almost-convex games, that is, coalitional games where all proper subgames are convex.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2961c59035d869b04c78c2567623b606
https://doi.org/10.1007/s10479-012-1226-y

A numerical algorithm for finding solutions of a generalized Nash equilibrium problem

Autor: Matioli, Luiz Carlos, Sosa, Wilfredo, Yuan, Jinyun, Universitat Autònoma de Barcelona. Centre de Recerca Matemàtica

Publikováno v: Dipòsit Digital de Documents de la UAB
Universitat Autònoma de Barcelona
Recercat. Dipósit de la Recerca de Catalunya
instname
Recercat: Dipósit de la Recerca de Catalunya
Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)

A family of nonempty closed convex sets is built by using the data of the Generalized Nash equilibrium problem (GNEP). The sets are selected iteratively such that the intersection of the selected sets contains solutions of the GNEP. The algorithm int

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9eafe1e48a54e4675d7546fdd1d13475
https://ddd.uab.cat/record/60909

Applicability of deterministic global optimization to the short-term hydrothermal coordination problem

Autor: Ferrer Biosca, Alberto

Publikováno v: TDX (Tesis Doctorals en Xarxa)
TDR. Tesis Doctorales en Red
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Esta Tesis esta motivada por el interés en aplicar procedimientos de optimización global a problemas del mundo real. Para ello, nos hemos centrado en el problema de Coordinación Hidrotérmica de la Generación Eléctrica a Corto Plazo (llamado Pro

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7854fa5e8471b47a5f96d5e800057df3
http://www.tdx.cat/TDX-0928105-135935