標(biāo)題: Titlebook: Web and Internet Economics; 14th International C George Christodoulou,Tobias Harks Conference proceedings 2018 Springer Nature Switzerland [打印本頁(yè)] 作者: SORB 時(shí)間: 2025-3-21 18:57
書目名稱Web and Internet Economics影響因子(影響力)
書目名稱Web and Internet Economics影響因子(影響力)學(xué)科排名
書目名稱Web and Internet Economics網(wǎng)絡(luò)公開(kāi)度
書目名稱Web and Internet Economics網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Web and Internet Economics被引頻次
書目名稱Web and Internet Economics被引頻次學(xué)科排名
書目名稱Web and Internet Economics年度引用
書目名稱Web and Internet Economics年度引用學(xué)科排名
書目名稱Web and Internet Economics讀者反饋
書目名稱Web and Internet Economics讀者反饋學(xué)科排名
作者: disparage 時(shí)間: 2025-3-21 20:54 作者: 仔細(xì)閱讀 時(shí)間: 2025-3-22 02:42
Amir Band dabei ausreichend dicht bleiben. Sie k?nnen in der Feuchte des Einbauwassergehalts erhebliche Untergrundsetzungen ertragen, ohne durchl?ssigkeitserh?hende Sch?digungen zu erfahren. An der Basis kann es kaum so gro?e Setzungsdifferenzen des Untergrundes geben, da? die Flexibilit?t der Abdichtungssc作者: 辭職 時(shí)間: 2025-3-22 04:56
Amir Ban? von Flugpl?nen quantitativ zu unterstützen. Hierzu wurde als erstes der zugrundeliegende Erstellungsproze? eines Flugplans n?her betrachtet, um anschlie?end die relevanten Restriktionen in Form einer mathematischen Notation beschreiben zu k?nnen. Das so entstandene Gesamtproblem lie? sich anschlie作者: Directed 時(shí)間: 2025-3-22 12:21
Argyrios Deligkas,John Fearnley,Themistoklis Melissourgos,Paul G. Spirakisd hervorgegangen. Es wendet sich in erster Linie an Studenten der Betriebs- und der Volkswirtschaftslehre und soll dieser Zielgruppe die M?glichkeiten zur Formulierung von Modellen zur Maximierung bzw. Minimierung gegebener Zielfunktionen unter Berücksichtigung von Beschr?nkungen und Nicht-Negativit作者: Congregate 時(shí)間: 2025-3-22 16:20
Tomer Ezra,Michal Feldman,Tim Roughgarden,Warut Suksompongelefeld hervorgegangen. Es wendet sich in erster Linie an Studenten der Betriebs- und Volkswirtschaftslehre. Es soll dieser Zielgruppe M?glichkeiten zur Formulierung von Modellen zur Maximierung bzw. Minimierung gegebener Zielfunktionen unter Berücksichtigung von Beschr?nkungen und Nicht-Negativit?t作者: 龍卷風(fēng) 時(shí)間: 2025-3-22 17:51 作者: Kernel 時(shí)間: 2025-3-23 01:04
Paul G?lz,Anson Kahng,Simon Mackenzie,Ariel D. Procacciauvrage comporte une partie de théorie mathématique sur le calcul matriciel et les systèmes d‘équations et d‘inéquations linéaires. Il traite ensuite d‘optimisation classique avec et sans contraintes, de programmation linéaire, de la méthode du simplexe et du simplexe révisé. Les derniers chapitres s作者: Critical 時(shí)間: 2025-3-23 02:25
Mohit Hota,Sanjiv Kapooryes.” Nowhere in the practice of education do we need to see through new eyes than in the domain of assessment. We have been trapped by our collective experiences to see a limited array of things to be assessed, a very few ways of assessing them, limited strategies for communicating results and infl作者: Truculent 時(shí)間: 2025-3-23 07:40
Nicole Immorlica,Brendan Lucier,Jieming Mao,Vasilis Syrgkanis,Christos Tzamosimal con- trol problems. The unifying thread in the presentation consists of an abstract theory, within which optimality conditions are expressed in the form of zeros of optimality junctions, algorithms are characterized by point-to-set iteration maps, and all the numerical approximations required i作者: 確定的事 時(shí)間: 2025-3-23 13:15 作者: objection 時(shí)間: 2025-3-23 15:03 作者: GLOSS 時(shí)間: 2025-3-23 19:04 作者: 參考書目 時(shí)間: 2025-3-23 23:50
dass dynamisch wachsende Dienstleistungsbranchen von der industriellen Nachfrage abh?ngen, eine Vielzahl von Dienstleistungen nur in Verbindung mit einem industriellen Produkt absetzbar ist (?hybride Produkte“ oder ?complex packages“) und die Industrie für die Entstehung von Produkt- und Prozessinn作者: 構(gòu)成 時(shí)間: 2025-3-24 02:44
Amir Banung notwendig, sie ist jedoch in Oberfl?chenabdichtungen nicht verfügbar. Die Zugabe von Fasern zu dem Erdstoff erh?ht die Festigkeit. Dies ist zwar nicht eindeutig günstig, die zugeh?rige Bruchdehnung erwies sich jedoch bei Faserbewehrung immer gr??er als ohne. Eine Glasfaserzugabe erh?hte die Durc作者: 憎惡 時(shí)間: 2025-3-24 10:12 作者: Sciatica 時(shí)間: 2025-3-24 11:41
Argyrios Deligkas,John Fearnley,Themistoklis Melissourgos,Paul G. SpirakisOptimalit?tsbedingungen hergeleitet und von der reinen Optimierungstechnik unabh?ngige theoretische Aspekte dargestellt. Entsprechend den zu erwartenden F?higkeiten der angesprochenen Zielgruppe werden nur diejenigen mathematischen Grundlagen aus der klassischen Analysis und der linearen Algebra vor作者: 生命 時(shí)間: 2025-3-24 15:53
Tomer Ezra,Michal Feldman,Tim Roughgarden,Warut Suksompongellt. Entsprechend den zu erwartenden F?higkeiten der angesprochenen Zielgruppe werden nur diejenigen mathematischen Grundlagen aus der klassischen Analysis und der linearen Algebra vorausgesetzt, die üblicherweise in den Lehrveranstaltungen zur Einführung in die Mathematik für Wirtschaftswissenschaftler verm978-3-662-00427-2Series ISSN 1431-6870 作者: JADED 時(shí)間: 2025-3-24 22:50 作者: Diaphragm 時(shí)間: 2025-3-25 01:45
Paul G?lz,Anson Kahng,Simon Mackenzie,Ariel D. Procacciat présentées à la fin de l‘ouvrage. Certains sujets de programmation linéaire, comme par exemple la théorie des graphes ou celle des réseaux n‘ont pas été abordés dans cet ouvrage. Les personnes intéressées pourront enrichir leur connaissance en consultant les ouvrages cités en référence. Cet ouvrage est dest作者: Cpap155 時(shí)間: 2025-3-25 06:52
Nicole Immorlica,Brendan Lucier,Jieming Mao,Vasilis Syrgkanis,Christos Tzamosditions and show that they are satisfied at a point if and only if this point is a zero of an upper semicontinuous optimality junction. The use of optimality functions has several advantages. First, optimality functions can be used in an abstract study of optimization algo- rithms. Second, many opti作者: GNAW 時(shí)間: 2025-3-25 11:01 作者: Anemia 時(shí)間: 2025-3-25 14:02 作者: cogitate 時(shí)間: 2025-3-25 19:10 作者: 放氣 時(shí)間: 2025-3-25 23:46
Ordinal Approximation for Social Choice, Matching, and Facility Location Problems Given Candidate Podinal information about agent preferences. For example, we present natural social choice mechanisms for choosing a single facility to open with distortion of at most 3 for minimizing both the total and the median social cost; this factor is provably the best possible. We analyze many general problem作者: Acumen 時(shí)間: 2025-3-26 02:39
Ordinal Approximation for Social Choice, Matching, and Facility Location Problems Given Candidate Podinal information about agent preferences. For example, we present natural social choice mechanisms for choosing a single facility to open with distortion of at most 3 for minimizing both the total and the median social cost; this factor is provably the best possible. We analyze many general problem作者: 背帶 時(shí)間: 2025-3-26 05:56
Infinite-Duration Poorman-Bidding Gamesth which a player can achieve a goal. For reachability objectives, such . are known to exist for both bidding rules. We show that the properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case. Our most interesting results concern 作者: Pert敏捷 時(shí)間: 2025-3-26 11:18
Infinite-Duration Poorman-Bidding Gamesth which a player can achieve a goal. For reachability objectives, such . are known to exist for both bidding rules. We show that the properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case. Our most interesting results concern 作者: venous-leak 時(shí)間: 2025-3-26 16:21 作者: 提名的名單 時(shí)間: 2025-3-26 18:18 作者: 暫停,間歇 時(shí)間: 2025-3-26 23:51 作者: Admire 時(shí)間: 2025-3-27 04:36
Strategy-Proof Incentives for Predictions our requirements from a mechanism in almost all prediction settings. To illustrate, we extensively analyze a prediction setting with continuous outcomes, and show how our suggested mechanism restores prompt truthfulness where incumbent mechanisms fail.作者: CHART 時(shí)間: 2025-3-27 08:57 作者: 的是兄弟 時(shí)間: 2025-3-27 12:10 作者: 敘述 時(shí)間: 2025-3-27 16:59 作者: fledged 時(shí)間: 2025-3-27 17:46 作者: 不可思議 時(shí)間: 2025-3-27 22:30
Shuchi Chawla,Joseph (Seffi) Naor,Debmalya Panigrahi,Mohit Singh,Seeun William Umboh作者: Delectable 時(shí)間: 2025-3-28 04:50 作者: Cosmopolitan 時(shí)間: 2025-3-28 07:41
Yu Cheng,Nick Gravin,Kamesh Munagala,Kangning Wang作者: 神圣在玷污 時(shí)間: 2025-3-28 14:30 作者: 樸素 時(shí)間: 2025-3-28 16:55
A Simple Mechanism for a Budget-Constrained Buyeronotone hazard rate condition, then selling items separately or in a grand bundle is still approximately optimal. We give a complementary example showing that no constant approximation simple mechanism is possible if budget . can be interdependent with valuations.作者: 極端的正確性 時(shí)間: 2025-3-28 20:08
A Simple Mechanism for a Budget-Constrained Buyeronotone hazard rate condition, then selling items separately or in a grand bundle is still approximately optimal. We give a complementary example showing that no constant approximation simple mechanism is possible if budget . can be interdependent with valuations.作者: left-ventricle 時(shí)間: 2025-3-29 02:49
The Communication Complexity of Graphical Games on Grid Graphsium problem, we show that in any protocol, the players in some game must communicate at least . bits in?total, and moreover, every player must communicate at least . bits. We also provide protocols with matching or almost matching upper bounds.作者: 滔滔不絕的人 時(shí)間: 2025-3-29 03:52 作者: ellagic-acid 時(shí)間: 2025-3-29 08:30
Approximating the Existential Theory of the Realshat we obtain a quasi-polynomial time approximation scheme (QPTAS) for a fragment of constrained .-ETR. We use our theorem to create several new PTAS and QPTAS algorithms for problems from a variety of fields.作者: cumulative 時(shí)間: 2025-3-29 15:15 作者: Antagonism 時(shí)間: 2025-3-29 17:23 作者: 一大塊 時(shí)間: 2025-3-29 21:49 作者: 怒目而視 時(shí)間: 2025-3-30 03:50 作者: WAX 時(shí)間: 2025-3-30 07:35
Infinite-Duration Poorman-Bidding Games. Such games are central in formal verification since they model the interaction between a non-terminating system and its environment. We study . in which the players bid for the right to move the token. Two bidding rules have been defined. In . bidding, in each round, the players simultaneously sub作者: 殘廢的火焰 時(shí)間: 2025-3-30 08:52 作者: 秘傳 時(shí)間: 2025-3-30 14:50
Incentives and Coordination in Bottleneck Modelsme-first-served observable queue. Agents dislike standing in line and they take actions in discrete time steps: we assume that each agent has a cost of 1 for every time step he waits before joining the queue and a cost of . for every time step he waits in the queue. At each time step a single agent 作者: Thyroid-Gland 時(shí)間: 2025-3-30 17:47 作者: Scintigraphy 時(shí)間: 2025-3-31 00:09
Strategy-Proof Incentives for Predictionsinduce truthfulness. However, when agents have multiple opportunities for revealing information, and take into account long-term effects of their actions, deception and reticence may appear. Such situations have been described in the literature. No simple rules exist to distinguish between the truth作者: 充氣女 時(shí)間: 2025-3-31 02:58 作者: 泛濫 時(shí)間: 2025-3-31 07:28 作者: 遺傳 時(shí)間: 2025-3-31 10:47
Revealed Preference Dimension via Matrix Sign Rankdirected graph. Not all graphs can be constructed as revealed preference graphs when the market dimension is fixed. This paper solves the open problem of determining exactly which graphs are attainable as revealed preference graphs in .-dimensional markets. This is achieved via an exact characteriza作者: 出來(lái) 時(shí)間: 2025-3-31 14:07 作者: 棲息地 時(shí)間: 2025-3-31 19:45 作者: emission 時(shí)間: 2025-3-31 22:14 作者: 罐里有戒指 時(shí)間: 2025-4-1 04:52
A Simple Mechanism for a Budget-Constrained Buyert seller with . heterogeneous items faces a single buyer and seeks to maximize her revenue. The buyer has a budget and additive valuations drawn independently for each item from (non-identical) distributions. We show that when the buyer’s budget is publicly known, the better of selling each item sep作者: Infirm 時(shí)間: 2025-4-1 08:29
The Communication Complexity of Graphical Games on Grid Graphsd on the two dimensional . grid graph. Unlike previous works focusing on the computational complexity of centralized algorithms, we study the communication complexity of distributed protocols for these problems, in the setting that each player initially knows only his private input of constant lengt作者: 做方舟 時(shí)間: 2025-4-1 11:20
The Communication Complexity of Graphical Games on Grid Graphsd on the two dimensional . grid graph. Unlike previous works focusing on the computational complexity of centralized algorithms, we study the communication complexity of distributed protocols for these problems, in the setting that each player initially knows only his private input of constant lengt作者: Lymphocyte 時(shí)間: 2025-4-1 16:42
Approximating the Existential Theory of the Realsmials. We propose the approximate existential theory of the reals (.-ETR), in which the constraints only need to be satisfied approximately. We first show that unconstrained .-ETR = ETR, and then study the .-ETR problem when the solution is constrained to lie in a given convex set. Our main theorem 作者: 英寸 時(shí)間: 2025-4-1 21:08
Approximating the Existential Theory of the Realsmials. We propose the approximate existential theory of the reals (.-ETR), in which the constraints only need to be satisfied approximately. We first show that unconstrained .-ETR = ETR, and then study the .-ETR problem when the solution is constrained to lie in a given convex set. Our main theorem 作者: Apoptosis 時(shí)間: 2025-4-2 02:37
Pricing Multi-unit Marketslower bounds on the largest fraction of the optimal social welfare that can be guaranteed with posted prices, under a range of assumptions about the designer’s information and agents’ valuations. Our results provide insights about the relative power of uniform and non-uniform prices, the relative di作者: 柔軟 時(shí)間: 2025-4-2 04:52
Optimal Pricing for MHR Distributionsfor a single item. We show that for the natural class of Monotone Hazard Rate (MHR) distributions, offering the same, take-it-or-leave-it price to all bidders can achieve an (asymptotically) optimal revenue. In particular, the approximation ratio is shown to be ., matched by a tight lower bound for 作者: 惡心 時(shí)間: 2025-4-2 09:41 作者: 發(fā)酵劑 時(shí)間: 2025-4-2 13:25 作者: Asparagus 時(shí)間: 2025-4-2 19:22 作者: 反話 時(shí)間: 2025-4-2 23:06
Combinatorial Assortment Optimizationence store. The price of each product is fixed in advance, and a probabilistic choice function describes which product a customer will choose from any given subset. We introduce the combinatorial assortment problem, where each customer may select a bundle of products. We consider a choice model in w作者: linear 時(shí)間: 2025-4-3 00:58
Varying the Number of Signals in Matching Markets large volume of applications. The resulting congestion makes it unlikely for candidates to receive offers from their most preferred organizations, leading to significant mismatch. We study how signaling mechanisms can be used as a market design tool to reduce the congestion in such markets. Specifi作者: 反抗者 時(shí)間: 2025-4-3 05:15 作者: 清醒 時(shí)間: 2025-4-3 10:40
Social Welfare and Profit Maximization from Revealed Preferencesased bundles at posted prices, i.e., .. We study both social welfare and profit maximization with revealed preferences. Although social welfare maximization is a seemingly non-convex optimization problem in prices, we show that (.) it can be reduced to a dual convex optimization problem in prices, a作者: 輕快帶來(lái)危險(xiǎn) 時(shí)間: 2025-4-3 14:16
Conference proceedings 2018rd, UK, in December 2018.. The 28 full papers presented were carefully reviewed and selected from 119 submissions. The papers reflect the work of researchers in theoretical computer science, artificial intelligence, and microeconomics who have joined forces to tackle problems at the intersection of
